Given an array consists of non-negative integers, your task is to count the number of triplets chosen from the array that can make triangles if we take them as side lengths of a triangle.
Example 1:
Input: [2,2,3,4] Output: 3 Explanation: Valid combinations are: 2,3,4 (using the first 2) 2,3,4 (using the second 2) 2,2,3
Note:
- The length of the given array won't exceed 1000.
- The integers in the given array are in the range of [0, 1000].
三层循坏,最里面的反向寻找,找到第一个使两数之和大于第三边条件的k就break,因为之后的k均能达到条件,好像效率比较低,还需要想想有什么优化的地方
class Solution {
public:void swap(int& e1, int& e2){
int tmp = e1;
e1 = e2;
e2 = tmp;
}
void quickSort(vector<int>& a, int l, int r){ //c语言改成int*
if(l >= r) return;
int ref = a[l];
int lt = l;
int gt = r;
int i = l + 1;
while(i<=gt){
if(a[i] < ref) swap(a[i++], a[lt++]);
else if(a[i] > ref) swap(a[i], a[gt--]);
else ++i;
}
quickSort(a, l, lt - 1);
quickSort(a, gt + 1, r);
}
int triangleNumber(vector<int>& nums) {
int count=0;
quickSort(nums,0,nums.size()-1);
for(int i=0;i<nums.size();i++){
for(int j=i+1;j<nums.size();j++){
for(int k=nums.size()-1;k>=j+1;k--){
if(nums[i]+nums[j]>nums[k]){
count+=(k-j);
break;
}
}
}
}
return count;
}
};
快超多的方法:
从最大的开始向前遍历,然后找次大的和最小的,如果次大和最小的加起来大于最大的,那么中间的所有数字加加上次大的都能大于最大的
然后次大的向前挪一个,如果不行,则最小的往后挪一个。
class Solution {
public:
int triangleNumber(vector<int>& nums) {
int res = 0;
sort(nums.begin(), nums.end());
for (int i = nums.size() - 1; i >= 2; i --) {
int left = 0, right = i - 1;
while (left < right) {
if (nums[left] + nums[right] > nums[i]) {
res += (right - left);
right--;
} else
left++;
}
}
return res;
}
};