-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsolution.py
36 lines (31 loc) · 1.08 KB
/
solution.py
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
from typing import List
class Solution:
def compress(self, chars: List[str]) -> int:
ichar = chars[0]
count = 1
index = 0
for i in range(1, len(chars)):
if ichar == chars[i]:
count +=1
else:
chars[index] = ichar
index += 1
if count > 1:
for char in str(count):
chars[index] = char
index += 1
ichar = chars[i]
count = 1
chars[index] = ichar
index += 1
if count > 1:
for char in str(count):
chars[index] = char
index += 1
print(f'chars: {chars}\ncount: {index}')
return index
# print(Solution().compress(["a","b","b","c","c","c"]))
Solution().compress(["a","b","b","b","b","b","b","b","b","b","b","b","b"])
# Solution().compress(["a","b","b","b","b","b","b","b","b","b","b","b","b"])
# Solution().compress(["a","b","b","b"])
# Solution().compress(["a","a","b","b","c","c","c"])