Valid Triangle Number

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:

1. The length of the given array won't exceed 1000.
2. The integers in the given array are in the range of [0, 1000].

思路：首先满足三角形的条件就是任意两边之和大于第三边；

array.sort之后，a < b <  c, 所以，a + c > b, b + c > a 肯定成立，那么就要判断 a + b > c的个数有多少个；

那么我们就需要固定c，然后求a, b 的组合有多少个，那么就是双指针的算法；

如果a + b < c,  由于 a < b, 所以只能 a ++;

如果a + b > c, 那么count += b - a; 如果a往右边移动也是> c, 所以b 应该往左移动;

class Solution {
    public int triangleNumber(int[] nums) {
        if(nums == null || nums.length < 3) {
            return 0;
        }
        Arrays.sort(nums);
        int count = 0;
        for(int i = 2; i < nums.length; i++) {
            int left = 0; int right = i - 1;
            while(left < right) {
                if(nums[left] + nums[right] > nums[i]) {
                    count += right - left;
                    right--;
                } else {
                    left++;
                }
            }
        }
        return count;
    }
}