comefrom: <awangdev>[lint]. 2 Sum II_1.java
code: public int twoSum2(int[] nums, int target) {
          if (nums == null || nums.length == 0) {
              return 0;
          }
          int count = 0;
          int left = 0;
          int right = nums.length - 1;
          Arrays.sort(nums);
          while (left < right) {
              if (nums[left] + nums[right] > target) {
                  count += (right - left);
                  right--;
              } else {
                  left++;
              }
          }
          return count;
      }
masked: public int sample_funcname ( int [ ] var_0 , int var_1 ) {
    if ( var_0 == null || var_0 . length == 0 ) {
      return 0 ;
    }
    int var_2 = 0 ;
    int var_3 = 0 ;
    int var_4 = var_0 . length - 1 ;
    Arrays . sort ( var_0 ) ;
    while ( var_3 < var_4 ) {
      if ( var_0 [ var_3 ] + var_0 [ var_4 ] > var_1 ) {
        var_2 += ( var_4 - var_3 ) ;
        var_4 -- ;
      }
      else {
        var_3 ++ ;
      }
    }
    return var_2 ;
  }
  