1
class Solution {
2
    public int triangleNumber(int[] nums) {
3
        int n = nums.length;
4
        Arrays.sort(nums);
5
        int count =0;
6
        for(int k = n-1; k>=2; k--)
7
        {
8
            int i = 0;
9
            int j = k-1;
10
            while(i < j)
11
            {
12
                int sum = nums[i] +nums[j];
13
                if(sum > nums[k])
14
                {
15
                    count += j-i;
16
                    j--;
17
                }
18
                else
19
                {
20
                    i++;
21
                }
22
            }
23
        }
24
        return count;
25
    }
26
}