comefrom: <qiyuangong>409_Longest_Palindrome_1.java
code: public int longestPalindrome(String s) {
          int[] count = new int[128];
          for (char c: s.toCharArray())
              count[c]++;
  
          int ans = 0;
          for (int v: count) {
              ans += v / 2 * 2;
              if (ans % 2 == 0 && v % 2 == 1)
                  ans++;
          }
          return ans;
      }
masked: public int sample_funcname ( String var_1 ) {
    int [ ] var_3 = new int [ 128 ] ;
    for ( char var_5 : var_1 . toCharArray ( ) ) var_3 [ var_5 ] ++ ;
    int var_7 = 0 ;
    for ( int var_8 : var_3 ) {
      var_7 += var_8 / 2 * 2 ;
      if ( var_7 % 2 == 0 && var_8 % 2 == 1 ) var_7 ++ ;
    }
    return var_7 ;
  }
  