LeetCode-52-N-Queens II 同前一题

来源：互联网发布：java in是什么意思啊编辑：程序博客网时间：2024/06/07 04:01

class Solution(object):      N=0      P=[]      ans=0    def totalNQueens(self, n):          """         :type n: int         :rtype: List[List[str]]         """          self.N=n          self.ans=0          self.dfs(n,0)            return self.ans                           def dfs(self, n, raw):          if(n==0):              self.ans+=1            return        for i in range(raw*self.N,raw*self.N+self.N):              if self.judge(i):                  self.P.append(i)                  self.dfs(n-1,raw+1)                  self.P.pop()                        def judge(self,p):          x=p/self.N          y=p%self.N          for i in range(len(self.P)):              curx=self.P[i]/self.N              cury=self.P[i]%self.N              if curx==x or cury==y or abs(curx-x)==abs(cury-y):                  return False          return True

阅读全文

1 0