问题描述:
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.
示例:
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
问题分析:
先把数组升序排序,依次取一个值nums[i]作为三角形的一个最长边。那么我们就可以在[0.i-1]的范围内寻找满足当前条件的三角形个数。由于数组数升序排列的,我们只需要找到两条边的一个边界即可,例如两边分别为a和b(a<b,a+b > nums[i]),比a小的边与b的和小于nums[i]。因而以b作为次长边的三角形个数为b的索引- a的索引。不断改变a和b求解即可。
过程详见代码:
class Solution {
public:
int triangleNumber(vector<int>& nums) {
int res = 0;
sort(nums.begin(), nums.end());
for (int i = 0; i<nums.size(); i++)
{
int left = 0, right = i - 1;
while (left<right)
{
if (nums[right] + nums[left]>nums[i])
{
res += right - left;
right--;
}
else
{
left++;
}
}
}
return res;
}
};