g0601_0700.s0659_split_array_into_consecutive_subsequences.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g0601_0700.s0659_split_array_into_consecutive_subsequences;
// #Medium #Array #Hash_Table #Greedy #Heap_Priority_Queue
// #2022_03_21_Time_4_ms_(95.88%)_Space_72.5_MB_(21.48%)
public class Solution {
public boolean isPossible(int[] nums) {
int[] element = new int[2001];
for (int num : nums) {
element[num + 1000] += 1;
}
for (int i = 0; i < element.length; i++) {
while (element[i] > 0) {
int length = 1;
while (i + length < element.length
&& element[i + length] >= element[i + length - 1]) {
length += 1;
}
if (length < 3) {
return false;
} else {
for (int j = i; j < i + length; j++) {
element[j] -= 1;
}
}
}
}
return true;
}
}