class Solution:
    # @param nums, an array of integer
    # @param target, an integer
    # @return an integer
    def twoSum2(self, nums, target):
        # Write your code here
        nums.sort()
        i, j = 0, len(nums) - 1
        res = 0
        while i < j:
            if nums[i] + nums[j] <= target:
                i += 1
            else:
                res += j - i
                j -= 1
        return res

Create TwoSum II for Lint
Create TwoSum II for Lint
