Two Sum - Greater Than Target

Given an array of integers, find how many pairs in the array such that their sum is bigger than a specific target number. Please return the number of pairs.

Example

Example 1:

Input: [2, 7, 11, 15], target = 24
Output: 1
Explanation: 11 + 15 is the only pair.

Example 2:

Input: [1, 1, 1, 1], target = 1
Output: 6

Challenge

Do it in O(1) extra space and O(nlogn) time.

思路: sort之后，利用单调性，可以用头尾同向双指针，来count，

如果sum > target, i ....j 所有都是pair，那么count += j - i; 同时j --；

如果sum < target, i，j不是，i排除，i++；

public class Solution {
    /**
     * @param nums: an array of integer
     * @param target: An integer
     * @return: an integer
     */
    public int twoSum2(int[] nums, int target) {
        if(nums == null || nums.length == 0) {
            return 0;
        }
        Arrays.sort(nums);
        int i = 0; int j = nums.length - 1;
        int count = 0;
        while(i < j) {
            int sum = nums[i] + nums[j];
            if(sum > target) {
                count += j - i;
                j--;
            } else { // sum < target;
                i++;
            }
        }
        return count;
    }
}