comefrom: <awangdev>Longest Consecutive Sequence_2.java
code: public int longestConsecutive(int[] num) {
          if (num == null || num.length == 0) {
              return 0;
          }
          int maxL = 1;
          HashMap<Integer, Boolean> history = new HashMap<Integer, Boolean>();
          for (int i : num) {
              history.put(i, false);
          }
          for (int i : num) {
              if (history.get(i)) {
                  continue;
              }
              int temp = i;
              int total = 1;
              while (history.containsKey(temp + 1)) {
                  total++;
                  temp++;
                  history.put(temp, true);
              }
              temp = i;
              while (history.containsKey(temp - 1)) {
                  total++;
                  temp--;
                  history.put(temp, true);
              }
              maxL = Math.max(maxL, total);
          }
          return maxL;
      }
masked: public int sample_funcname ( int [ ] var_0 ) {
    if ( var_0 == null || var_0 . length == 0 ) {
      return 0 ;
    }
    int var_1 = 1 ;
    HashMap < Integer , Boolean > var_2 = new HashMap < Integer , Boolean > ( ) ;
    for ( int var_3 : var_0 ) {
      var_2 . put ( var_3 , false ) ;
    }
    for ( int var_3 : var_0 ) {
      if ( var_2 . get ( var_3 ) ) {
        continue ;
      }
      int var_4 = var_3 ;
      int var_5 = 1 ;
      while ( var_2 . containsKey ( var_4 + 1 ) ) {
        var_5 ++ ;
        var_4 ++ ;
        var_2 . put ( var_4 , true ) ;
      }
      var_4 = var_3 ;
      while ( var_2 . containsKey ( var_4 - 1 ) ) {
        var_5 ++ ;
        var_4 -- ;
        var_2 . put ( var_4 , true ) ;
      }
      var_1 = Math . max ( var_1 , var_5 ) ;
    }
    return var_1 ;
  }
  