-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
611.java
58 lines (48 loc) · 1.51 KB
/
611.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
__________________________________________________________________________________________________
sample 3 ms submission
class Solution {
public int triangleNumber(int[] nums) {
int count = 0;
if(nums == null || nums.length < 3)
return count;
Arrays.sort(nums);
int n = nums.length;
for(int i=n-1; i>=2; i--)
{
int l=0, r=i-1;
while(l<r)
{
if(nums[l] + nums[r] > nums[i])
{
count += r-l;
r--;
}
else
l++;
}
}
return count;
}
}
__________________________________________________________________________________________________
sample 36896 kb submission
class Solution {
public int triangleNumber(int[] nums) {
int count;
count = 0;
Arrays.sort(nums);
for (int i = 0; i < nums.length - 2; i++) {
if (nums[i] == 0) {
continue;
}
for (int j = i + 1, k = j + 1; j < nums.length - 1; j++) {
while (k < nums.length && nums[i] + nums[j] > nums[k]) {
k++;
}
count += (k - j - 1);
}
}
return (count);
}
}
__________________________________________________________________________________________________