leetcode 刷题 35 36
【摘要】 https://leetcode-cn.com/problems/search-insert-position/
class Solution: def searchInsert(self, nums: List[int], target: int) -> int: for i in range(len(nums)): if target<=nums[i...
https://leetcode-cn.com/problems/search-insert-position/
class Solution: def searchInsert(self, nums: List[int], target: int) -> int: for i in range(len(nums)): if target<=nums[i]: return i return len(nums)
class Solution(object): def isValidSudoku(self, board): """ :type board: List[List[str]] :rtype: bool """ dic_list1 = [set() for _ in range(9)] dic_list2 = [set() for _ in range(9)] dic_list3 = [[set() for _ in range(3)] for _ in range(3)] for i in range(9): for j in range(9): if not board[i][j].isnumeric(): continue y = i // 3 x = j // 3 num = board[i][j] if (num in dic_list1[i]) or (num in dic_list2[j]) or (num in dic_list3[x][y]): return False else: dic_list1[i].add(num) dic_list2[j].add(num) dic_list3[x][y].add(num) return True
class Solution: def isValidSudoku(self, board): """ :type board: List[List[str]] :rtype: bool """ return self.checkRow(board) and self.checkLine(board) and self.checkBox(board) def checkRow(self, board): for row in range(9): tmp = [] for line in range(9): if board[row][line] != '.': tmp.append(board[row][line]) if len(tmp) != len(set(tmp)): return False return True def checkLine(self, board): for line in range(9): tmp = [] for row in range(9): if board[row][line] != '.': tmp.append(board[row][line]) if len(tmp) != len(set(tmp)): return False return True def checkBox(self, board): for i in range(0, 8, 3): for j in range(0, 8, 3): tmp = [] for m in range(i, i+3): for n in range(j, j+3): if board[m][n] != '.': tmp.append(board[m][n]) if len(tmp) != len(set(tmp)): return False return True
文章来源: maoli.blog.csdn.net,作者:刘润森!,版权归原作者所有,如需转载,请联系作者。
原文链接:maoli.blog.csdn.net/article/details/90349455
【版权声明】本文为华为云社区用户转载文章,如果您发现本社区中有涉嫌抄袭的内容,欢迎发送邮件进行举报,并提供相关证据,一经查实,本社区将立刻删除涉嫌侵权内容,举报邮箱:
cloudbbs@huaweicloud.com
- 点赞
- 收藏
- 关注作者
评论(0)