3Sum Smaller

Given an array of n integers nums and a target, find the number of index triplets i, j, k with 0 <= i < j < k < n that satisfy the condition nums[i] + nums[j] + nums[k] < target.

Example:

Input: nums = [-2,0,1,3], and target = 2
Output: 2 
Explanation: Because there are two triplets which sums are less than 2:
             [-2,0,1]
             [-2,0,3]

Follow up: Could you solve it in O(n2) runtime?

思路：首先array是可以sort的，并没有规定不能sort，只是要求i, j, k满足性质: 0, <= i < j < k < n, 只是index满足性质，而不是value，是可以sort的。i, j, k, 如果sum >= target, 那么k -- 是没问题的，i, j, k 如果sum < target，那么 j, j+1, j + 2.....k -1, k  ,那么k - j个，全部都小于target；j ++;

class Solution {
    public int threeSumSmaller(int[] nums, int target) {
        if(nums == null || nums.length == 0) {
            return 0;
        }
        Arrays.sort(nums);
        int count = 0;
        for(int i = 0; i < nums.length - 2; i++) {
            int j = i + 1; int k = nums.length - 1;
            while(j < k) {
                int sum = nums[i] + nums[j] + nums[k];
                if(sum < target) {
                    count += k - j;
                    j++;
                } else {
                    // sum >= target;
                    k--;
                }
            }
        }
        return count;
    }
}