[LeetCode] 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:

Note:

The length of the given array won't exceed 1000.

The integers in the given array are in the range of [0, 1000]. 

解法一：

<a>class Solution {</a>

解法二：

參考資料：

<a href="https://discuss.leetcode.com/topic/92099/java-o-n-2-time-o-1-space" target="_blank">https://discuss.leetcode.com/topic/92099/java-o-n-2-time-o-1-space</a>

，如需轉載請自行聯系原部落客。