Leetcode-259. 3 Sum Smaller

Problem Description:
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.

For example, given nums = [-2, 0, 1, 3], and target = 2.

Return 2. 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(n^2) runtime?

---

Analysis:
We just need the num of the triplets, so we can Sort the nums first and then fix the left index(i) at each time while adjusting the middle and right indexes (j, k).

Codes:
O(n^2) runtime.

int threeSumSmaller(vector<int>& nums, int target) 
{
    sort(nums.begin(), nums.end());
    int n = nums.size();
    int res = 0, i, j, k;
    for (int i = 0; i < n - 2; ++i)
    {
        int j = i + 1, k = n - 1;// [i, j, k]
        while (j < k)
        {
            if (nums[i] + nums[j] + nums[k] >= target) k--;
            else{
                res += k - j; //i, j fixed, k could be the all the index in [j, k].
                j++;
            }
        }
    }
}