统计由1,2,3,4可以组成多少个无重复的三位数
import itertools
sum, a = 0, [1, 2, 3, 4]
for i in itertools.permutations(a, 3):
print(i)
sum += 1
print(sum)
enumerate(S)用于迭代一个字符串对象,并返回对对象的下标和值ord()用于计算一个字符的acII码
class Solution:
def partitionLabels(self, S: str) -> List[int]:
last = [0] * 26
for i, ch in enumerate(S):
last[ord(ch) - ord(“a”)] = i
ans = []
left, right = 0, 0
for i, ch in enumerate(S):
right = max(right, last[ord(ch) - ord(“a”)])
if i == right:
ans.append(right - left + 1)
left = right + 1
return ans