-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1370_increasing_decreasing_string.py
More file actions
45 lines (41 loc) · 1.65 KB
/
1370_increasing_decreasing_string.py
File metadata and controls
45 lines (41 loc) · 1.65 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
class Solution:
def sortString(self, s: str) -> str:
ch_dict = {}
for ch in s:
if ch not in ch_dict:
ch_dict[ch] = 1
else:
ch_dict[ch] += 1
ch_arr = list(ch_dict.keys())
ch_arr.sort()
ch_arr_reversed = ch_arr[::-1]
ans = ''
while len(ch_dict) != 0:
for ch in ch_arr:
if ch in ch_dict:
ans += ch
ch_dict[ch] -= 1
if ch_dict[ch] == 0:
del ch_dict[ch]
for ch in ch_arr_reversed:
if ch in ch_dict:
ans += ch
ch_dict[ch] -= 1
if ch_dict[ch] == 0:
del ch_dict[ch]
return ans
'''
This is my personal record of solving Leetcode Problems.
If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
Copyright (C) 2020-2022 mengxinayan
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
'''