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].
public int triangleNumber(int[] nums) {
int count = 0;
int mid = 0;
ArrayList<Integer> list = new ArrayList<Integer>();
for (int i = 0; i < nums.length; i++)
list.add(nums[i]);
list.sort(null);
for (int i = 0; i < list.size() - 1; i++)
for (int j = i + 1; j < list.size(); j++) {
int sum = (int) list.get(i) + (int) list.get(j);
int left = j;
int right = list.size();
while (right - 1 > left) {
mid = (right + left) / 2;
if (sum <= (int) list.get(mid))
right = mid;
if (sum > (int) list.get(mid))
left = mid;
}
count += left - j;
}
return count;
}