-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathL659.java
More file actions
54 lines (48 loc) · 1.72 KB
/
L659.java
File metadata and controls
54 lines (48 loc) · 1.72 KB
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
package com.liang.leetcode;
import java.util.HashMap;
import java.util.Map;
/**
* @ClassName L659
* @description split-array-into-consecutive-subsequences
* @Author LiaNg
* @Date 2018/11/1
*/
public class L659 {
public static void main(String[] args) {
int[] numbers = {1, 2, 3, 3, 4, 5};
L659 l = new L659();
System.out.println(l.isPossible(numbers));
}
/**
* 将数组分隔为连续子序列
*/
public boolean isPossible(int[] nums) {
Map<Integer, Integer> freq = new HashMap();
Map<Integer, Integer> sequence = new HashMap();
for (int i : nums) {
freq.put(i, freq.getOrDefault(i, 0) + 1);
}
for (int i : nums) {
//若当前元素个数为0， continue
if (freq.get(i) == 0) {
continue;
}
//大于0，表示当前元素可以插入到已经构建好的序列的末端
else if (sequence.getOrDefault(i, 0) > 0) {
sequence.put(i, sequence.get(i) - 1);
sequence.put(i + 1, sequence.getOrDefault(i + 1, 0) + 1);
}
//表示当前元素可以作为新序列的第一个元素
else if (freq.getOrDefault(i + 1, 0) > 0 && freq.getOrDefault(i + 2, 0) > 0) {
freq.put(i + 1, freq.get(i + 1) - 1);
freq.put(i + 2, freq.get(i + 2) - 1);
//注意这里，构建好一个序列，那么该序列最后一个元素+1一定能插入到序列末端
sequence.put(i + 3, sequence.getOrDefault(i + 3, 0) + 1);
} else {
return false;
}
freq.put(i, freq.get(i) - 1);
}
return true;
}
}