-
Notifications
You must be signed in to change notification settings - Fork 1
/
LeetCode-443-String-Compression.java
42 lines (38 loc) · 1.27 KB
/
LeetCode-443-String-Compression.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
class Solution {
// public int compress(char[] chars) {
// int s = 0, i = 0;
// while(i < chars.length) {
// int j = i; // j is the last index of the substring
// while(j < chars.length - 1 && chars[j] == chars[j + 1]) j++;
// if (j != i) {
// int len = j - i + 1;
// chars[s++] = chars[i];
// String lenStr = String.valueOf(len);
// for (char c : lenStr.toCharArray()) chars[s++] = c;
// } else {
// // there is only one character in the substring, no need compression
// chars[s++] = chars[i];
// }
// i = j + 1;
// }
// return s;
// }
public int compress(char[] chars) {
int n = chars.length;
int s = 0, i = 0;
while (i < n) {
int j = i, count = 0;
while (j < n && chars[i] == chars[j]) {
count++;
j++;
}
chars[s++] = chars[i];
if (count > 1) {
char[] numChars = (count + "").toCharArray();
for (char c : numChars) chars[s++] = c;
}
i = j;
}
return s;
}
}