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].
这道题是让找能够组成三角形的三个数,如果出现重复的数字,把它们当作不同的数字对待,像例子中的2,2,3,4,第一个2与第二个2分别与3,4,组成三角形。可以用三个指针来遍历这个数组,分别是i,j,k开始的时候j=i+1,k=i+2,当nums[i]+nums[j]>nums[k]时,开始计数,每一轮k都加1,并且res每次增加k-j,因为开始的时候对nums数组排序,则数组中的数字是递增的(不一定单调),那么nums[i]+nums[j]>nums[k]时,必然有nums[i]+nums[j+1]>nusm[k],nums[i]+nums[j+2]>nums[k]....直到j=k-1,所以res增加k-j,最后返回结果即可,时间复杂度为O(n*n)。代码如下:
Arrays.sort(nums);
int res=0;
for(int i=0;i<nums.length-2;i++){
for(int j=i+1,k=i+2;k<nums.length;k++){
while(j<k&&nums[i]+nums[j]<=nums[k]){j++;}
res+=k-j;
}
}
return res;