问题:
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].
解决:
① 计算可以组成三角形的三元组的个数。三角形的性质:任意两条边之和要大于第三边。
问题其实就变成了找出所有这样的三个数字,使得任意两个数字之和都大于第三个数字。那么可以转变一下,三个数字中如果较小的两个数字之和大于第三个数字,那么任意两个数字之和都大于第三个数字。
所以,将数组排序,先确定前两个数,将这两个数之和sum作为目标值,然后用二分查找法来快速确定第一个小于目标值的数。
class Solution { //62ms
public int triangleNumber(int[] nums) {
int res = 0;
int len = nums.length;
Arrays.sort(nums);
for (int i = 0;i < len;i ++){
for (int j = i + 1;j < len;j ++){
int sum = nums[i] + nums[j];
int left = j + 1;
int right = len;
while (left < right){
int mid = (right - left) / 2 + left;
if (nums[mid] < sum){
left = mid + 1;
}else {
right = mid;
}
}
res += right - 1 - j;
}
}
return res;
}
}
② 使用二分查找查找较小的那两个数,会简单很多。
class Solution { //26ms
public int triangleNumber(int[] nums) {
if (nums == null || nums.length == 0) return 0;
int res = 0;
int len = nums.length;
Arrays.sort(nums);
for (int i = 0;i < len;i ++){
int left = 0;
int right = i - 1;
while (left < right){
if (nums[left] + nums[right] > nums[i]){
res += right - left;
right --;
}else {
left ++;
}
}
}
return res;
}
}