leetcode

0 class Solution {

1 public:

2 int triangleNumber(vector<int> &nums) const {

3 const int n = size(nums);

4 int res = 0;

5

6 sort(begin(nums), end(nums));

7 for (int k = 2; k < n; k++) {

8 int i = 0, j = k - 1;

9 while (i < j) {

10 if (nums[i] + nums[j] <= nums[k])

11 i++;

12 else

13 res += j - i, j--;

14 }

15 }

16

17 return res;

18 }

19 };