611. 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].

任意取三个数，看是否能够成一个三角形，只要该三个数满足：两边之和大于第三边即可。

思路一：

O（n3）求解，直接暴力求解

思路二：

O（n2long(n)），是在思路一的基础上进行了优化，程序如下所示：

class Solution {
    public int triangleNumber(int[] nums) {
        int res = 0;
        Arrays.sort(nums);
        for (int i = 0; i < nums.length; ++ i){
            for (int j = i + 1; j < nums.length; ++ j){
                int left = j + 1, right = nums.length - 1;
                if (left >= nums.length){
                    break;
                }
                int target = nums[i] + nums[j];
                while (left <= right){
                    int mid = left + (right - left)/2;
                    if (target <= nums[mid]){
                        right = mid - 1;
                    }
                    else if (target > nums[mid]){
                        left = mid + 1;
                    }
                }
                res += right - j;
            }
        }
        return res;
    }
}