<qiyuangong>005_Longest_Palindromic_Substring_3.java
private static char[] removeBoundaries(char[] cs) {
         if (cs==null || cs.length<3)
             return "".toCharArray();

         char[] cs2 = new char[(cs.length-1)/2];
         for (int i = 0; i<cs2.length; i++) {
             cs2[i] = cs[i*2+1];
         }
         return cs2;
     }
private static char [ ] sample_funcname ( char [ ] var_0 ) {
  if ( var_0 == null || var_0 . length < 3 ) return "" . toCharArray ( ) ;
  char [ ] var_8 = new char [ ( var_0 . length - 1 ) / 2 ] ;
  for ( int var_10 = 0 ;
  var_10 < var_8 . length ;
  var_10 ++ ) {
    var_8 [ var_10 ] = var_0 [ var_10 * 2 + 1 ] ;
  }
  return var_8 ;
}
