forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
_763.java
31 lines (27 loc) · 956 Bytes
/
_763.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
package com.fishercoder.solutions;
import java.util.ArrayList;
import java.util.List;
public class _763 {
public static class Solution1 {
public List<Integer> partitionLabels(String S) {
List<Integer> result = new ArrayList<>();
int[] last = new int[26];
/**This is the key step:
* we find the last occurrence of each letter and record them in last[]*/
for (int i = 0; i < S.length(); i++) {
last[S.charAt(i) - 'a'] = i;
}
/**record the last end index of the current substring*/
int end = 0;
int start = 0;
for (int i = 0; i < S.length(); i++) {
end = Math.max(end, last[S.charAt(i) - 'a']);
if (end == i) {
result.add(end - start + 1);
start = end + 1;
}
}
return result;
}
}
}