-
Notifications
You must be signed in to change notification settings - Fork 42
/
LongestContinuousIncreasingSubsequence.java
92 lines (82 loc) · 2.16 KB
/
LongestContinuousIncreasingSubsequence.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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
package LeetCodeJava.Array;
// https://leetcode.com/problems/longest-continuous-increasing-subsequence/
public class LongestContinuousIncreasingSubsequence {
// VO
// public int findLengthOfLCIS(int[] nums) {
// }
// V1
// https://leetcode.com/problems/longest-continuous-increasing-subsequence/solutions/2565636/clean-0ms-java-solution/
public int findLengthOfLCIS_1(int[] nums)
{
int max =0;
int count =0;
for(int i=1; i<nums.length;i++)
{
if(nums[i-1] < nums[i])
{
count++;
max = Math.max(count , max);
}
else
count =0;
}
return max+1;
}
// V2
// https://leetcode.com/problems/longest-continuous-increasing-subsequence/solutions/3426987/solution/
public int findLengthOfLCIS_2(int[] nums) {
int maxCount = 1;
int currentCount = 1;
int i = 0 ;
int j = 1;
while(j<nums.length)
{
if(nums[j]>nums[i])
{
currentCount++;
i++;
j++;
}
else
{
i = j;
j++;
currentCount = 1;
}
if(maxCount<currentCount)
{
maxCount = currentCount;
}
}
return maxCount;
}
// V3
// https://leetcode.com/problems/longest-continuous-increasing-subsequence/solutions/3118835/simple-java-solution-using-2-pointer-approach-time-beats-100-of-the-solutions/
public int findLengthOfLCIS_3(int[] nums)
{
int maxCount = 1;
int currentCount = 1;
int i = 0 ;
int j = 1;
while(j<nums.length)
{
if(nums[j]>nums[i])
{
currentCount++;
i++;
j++;
}
else
{
i = j;
j++;
currentCount = 1;
}
if(maxCount<currentCount)
{
maxCount = currentCount;
}
}
return maxCount;
}
}