-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
674.java
81 lines (61 loc) · 2.15 KB
/
674.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
__________________________________________________________________________________________________
sample 0 ms submission
class Solution {
public int findLengthOfLCIS(int[] nums) {
int longest = 1;
int maxLong = 0;
// int startIndex = 0;
// int endIndex = 0;
if(nums.length == 0) {
return 0;
}
int i = 0 ;
boolean isSkippable = false;
while( i < nums.length -1 ) {
if(nums[i] < nums[i+1]) {
if(!isSkippable ||
(isSkippable && isIncreasingSequence(i, i - longest + 1, nums))) {
longest++;
isSkippable = false;
}
i++;
} else {
// try to skip + longest
i = longest + i;
isSkippable = true;
}
// System.out.println("i = "+i+" and longest = "+longest);
}
return longest;
}
public boolean isIncreasingSequence(int i, int j, int[]nums) {
while(j < i) {
if(nums[j] < nums[j+1]) {
j++;
} else {
break;
}
}
return j == i;
}
}
__________________________________________________________________________________________________
sample 39276 kb submission
class Solution {
public int findLengthOfLCIS(int[] nums) {
if (nums == null || nums.length == 0) return 0;
int[] dp = new int[nums.length];
for (int i = 0; i < dp.length; i++) {
dp[i] = 1;
}
int longest = 1;
for (int i = 1; i < nums.length; i++) {
if (nums[i] > nums[i - 1]) {
dp[i] = dp[i - 1] + 1;
longest = Math.max(longest, dp[i]);
}
}
return longest;
}
}
__________________________________________________________________________________________________