yys130826的博客

class Solution: def solveNQueens(self, n: int) -> List[List[str]]: if not n: return [] chessboard = [['.'] * n for _ in range(n)] res = [] def backtrack(n, row, chessboard): if row == n: .

class Solution: def uniquePaths(self, m: int, n: int) -> int: dp=[[0 for _ in range(n)]for _ in range(m)]#初始化储存路径数的dp表格。n表示列数，m表示行数。 for i in range(m):#dp表中，最左边都是只有一种路径选择。所以都填1 dp[i][0]=1 for i in range(n):#最上方也是.