<awangdev>[lint]. 2 Sum II_1.java
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;
    }
public int sample_funcname ( int [ ] var_0 , int var_1 ) {
  if ( var_0 == null || var_0 . length == 0 ) {
    return 0 ;
  }
  int var_5 = 0 ;
  int var_6 = 0 ;
  int var_8 = var_0 . length - 1 ;
  Arrays . sort ( var_0 ) ;
  while ( var_6 < var_8 ) {
    if ( var_0 [ var_6 ] + var_0 [ var_8 ] > var_1 ) {
      var_5 += ( var_8 - var_6 ) ;
      var_8 -- ;
    }
    else {
      var_6 ++ ;
    }
  }
  return var_5 ;
}
