comefrom: <awangdev>Largest Number_1.java
code: public String largestNumber(int[] num) {
          if (num == null || num.length == 0) {
              return "";
          }
          String[] strs = new String[num.length];
          for (int i = 0; i < num.length; i++) {
              strs[i] = num[i] + "";
          }
  
          Arrays.sort(strs, new Comparator<String>() {
              public int compare(String s1, String s2) {
                  return (s2 + s1).compareTo(s1 + s2);
              }
          });
  
          StringBuffer sb = new StringBuffer();
          for (int i = 0; i < num.length; i++) {
              sb.append(strs[i]);
          }
          String rst = sb.toString();
          
          if (rst.charAt(0) == '0') {
              return "0";
          }
          return rst;
      }
masked: public String var_0 ( int [ ] var_1 ) {
    if ( var_1 == null || var_1 . length == 0 ) {
      return "" ;
    }
    String [ ] var_2 = new String [ var_1 . length ] ;
    for ( int var_3 = 0 ;
    var_3 < var_1 . length ;
    var_3 ++ ) {
      var_2 [ var_3 ] = var_1 [ var_3 ] + "" ;
    }
    Arrays . sort ( var_2 , new Comparator < String > ( ) {
      public int compare ( String var_4 , String var_5 ) {
        return ( var_5 + var_4 ) . compareTo ( var_4 + var_5 ) ;
      }
    }
    ) ;
    StringBuffer var_6 = new StringBuffer ( ) ;
    for ( int var_3 = 0 ;
    var_3 < var_1 . length ;
    var_3 ++ ) {
      var_6 . append ( var_2 [ var_3 ] ) ;
    }
    String var_7 = var_6 . toString ( ) ;
    if ( var_7 . charAt ( 0 ) == '0' ) {
      return "0" ;
    }
    return var_7 ;
  }
  