题目
划分字母区间 题目链接 官方题解
关键词
双指针,贪心算法
代码记录
下面的实现其实和官方解法类似,只是官方题解是记录字符最后出现的位置,我这里是是通过记录字符出现的次数。
class Solution:
def partitionLabels(self
, S
: str) -> List
[int]:
total_dic
={}
for i
in range(len(S
)):
if S
[i
] in total_dic
:
total_dic
[S
[i
]]+=1
else:
total_dic
[S
[i
]]=1
cur_list
=[]
res
=[]
for i
in range(len(S
)):
cur_list
.append
(S
[i
])
total_dic
[S
[i
]]-=1
if all(total_dic
[item
]==0 for item
in list(set(cur_list
))):
res
.append
(len(cur_list
))
cur_list
=[]
return res
转载请注明原文地址: https://lol.8miu.com/read-33109.html