comefrom: <awangdev>14. Longest Common Prefix_1.java
code: public String longestCommonPrefix(String[] strs) {
          if (strs == null || strs.length == 0) {
              return "";
          }
          
          Arrays.sort(strs);
          String head = strs[0];
          String tail = strs[strs.length - 1];
          
          int size = head.length() < tail.length() ? head.length() : tail.length();
          StringBuffer sb = new StringBuffer();
          for (int i = 0; i < size; i++) {
              if (head.charAt(i) != tail.charAt(i)) {
                  break;
              }
              sb.append(head.charAt(i));
          }
          return sb.toString();
      }
masked: public String var_0 ( String [ ] var_1 ) {
    if ( var_1 == null || var_1 . length == 0 ) {
      return "" ;
    }
    Arrays . sort ( var_1 ) ;
    String var_2 = var_1 [ 0 ] ;
    String var_3 = var_1 [ var_1 . length - 1 ] ;
    int var_4 = var_2 . length ( ) < var_3 . length ( ) ? var_2 . length ( ) : var_3 . length ( ) ;
    StringBuffer var_5 = new StringBuffer ( ) ;
    for ( int var_6 = 0 ;
    var_6 < var_4 ;
    var_6 ++ ) {
      if ( var_2 . charAt ( var_6 ) != var_3 . charAt ( var_6 ) ) {
        break ;
      }
      var_5 . append ( var_2 . charAt ( var_6 ) ) ;
    }
    return var_5 . toString ( ) ;
  }
  