回溯python_回溯法-python

class Solution:

def permute(self, nums: List[int]) -> List[List[int]]:

if not nums: return nums

result = []

self.backtrack(nums, result, [])

return result

def backtrack(self, nums, result, tem_result):

# 错误写法 result.append(tem_result[]) 这样把地址传入，后面回退的时候会是一堆空列表

if not nums: result.append(tem_result[:])

nums_len = len(nums)

# for 选择 in 选择列表:

for i in range(nums_len):

# 做选择

tem_result.append(nums[i])

# backtrack(新的选择列表)

self.backtrack(nums[0:i] + nums[i+1:nums_len], result, tem_result)

# 撤销选择

tem_result.pop()

class Solution:

def permute(self, nums: List[int]) -> List[List[int]]:

def trackBack(nums,track):

if len(track) == len(nums):

res.append(track[:]) # 需要传递下track的拷贝，否则对track的修改会影响到结果

return

for i in nums:

if i in track:

continue

track.append(i)

trackBack(nums,track)

track.pop()

res = []

track = []

trackBack(nums,track)

return res

全排列 leetcode

class Solution:

def solveNQueens(self, n: int) -> List[List[str]]:

board=[['.']*n for _ in range(n)] #初始化二维棋盘

print(board)

res=[]

def backtrack(board,row):

# if 满足条件:

# res.append(路径)

# return

if row==len(board):

tmp_list=[] #二维变一维添加到res中

for e_row in board:

tmp=''.join(e_row)

tmp_list.append(tmp)

res.append(tmp_list)

return

# for 选择 in 选择列表:

# 做选择

# backtrack(路径,选择列表)

# 撤销选择

for col in range(len(board[0])):

if not isValid(board,row,col):

# print(isValid(board,row,col))

continue

board[row][col]='Q'

# print(board)

backtrack(board,row+1)

board[row][col]='.'

def isValid(board,row,col):

n=len(board)

# 检查列是否有皇后互相冲突

for i in range(n):

if board[i][col]=='Q':

return False

# 检查右上方是否有皇后互相冲突

r_row,r_col=row,col

while r_row>0 and r_col

r_row-=1

r_col+=1

if board[r_row][r_col]=='Q':

return False

# 检查左上方是否有皇后互相冲突

l_row,l_col=row,col

while l_row>0 and l_col>0:

l_row-=1

l_col-=1

if board[l_row][l_col]=='Q':

return False

return True

backtrack(board,0)

return res

N皇后问题