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(n2) runtime?
思路:
1. 三个坐标不同,和
int threeSumSmaller(vector<int>& nums, int target) {
//sorting+two-pointer
int res=0;
sort(nums.begin(),nums.end());
for(int i=0;i<nums.size();i++){
int j=i+1,k=nums.size()-1;
while(j<k){
if(nums[j]+nums[k]<target-nums[i]){
res+=k-j;
j++;
}else
k--;
}
}
return res;
}