39.组合总和
题目链接:组合总和
还是想叉了,每个元素都可以用好几次:
candidates = [2,3,6,7], target = 7
- 选2,剩下区间[2,3,6,7]
- 选3,剩下区间[3,6,7],不是[2,3,6,7]
- 选6,剩下区间[6,7]
- 选7,剩下区间[7]
不然会重复的。
class Solution:
def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]:
path=[]
result=[]
def backtracking(candidates, target, index):
#剪枝但不同去重,can里元素都不一样
if sum(path) > target:
return
if sum(path)==target:
result.append(path[:])
return
for i in range(index,len(candidates)):
path.append(candidates[i])
backtracking(candidates,target,i)
path.pop()
backtracking(candidates,target,0)
return result
131.分割回文串
题目链接:分割回文串
这个题注意字符串的下标就行。
class Solution:
def partition(self, s: str) -> List[List[str]]:
path = []
result = []
def backtracking(s,index):
if ''.join(path) == s:
result.append(path[:])
return
for i in range((index+1),(len(s)+1)):
a = s[index:i]
if a[::-1] != a:
continue
else:
path.append(a)
backtracking(s,i)
path.pop()
backtracking(s,0)
return result
是否为回文串
解析
如果要自己写的话:
def is_palindrome(self, s: str, start: int, end: int) -> bool:
i: int = start
j: int = end
while i < j:
if s[i] != s[j]:
return False
i += 1
j -= 1
return True