T217 存在重复元素:给你一个整数数组
nums
。如果任一值在数组中出现 至少两次 ,返回true
;如果数组中每个元素互不相同,返回false
。用set就直接出来了
class Solution: def containsDuplicate(self, nums: List[int]) -> bool: return len(nums)!=len(set(nums))
T219存在重复元素2:
给你一个整数数组 nums 和一个整数 k ,判断数组中是否存在两个 不同的索引 i 和 j ,满足 nums[i] == nums[j] 且 abs(i - j) <= k 。如果存在,返回 true ;否则,返回 false 。
来源:力扣(LeetCode)链接:https://leetcode.cn/problems/contains-duplicate-ii
''' 只需要判断靠的最近的相同数字的索引之差,所以如果从头遍历的话,需要把相同数字的索引更新为最大的即可 ''' class Solution: def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool: a={} #创建一个字典,放数字与索引,并且用相同数字的最大索引进行更新 for i,num in enumerate(nums): #enumerate是python自带的枚举函数,针对列表和字符串,得到他们的索引与具体值构成字典(索引默认从0开始) if num in a and i-a[num]<=k: return bool(1) a[num]=i return bool(0)
T36有效的数独:
请你判断一个 9 x 9 的数独是否有效。只需要 根据以下规则 ,验证已经填入的数字是否有效即可。
数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。(请参考示例图)
注意:
一个有效的数独(部分已被填充)不一定是可解的。
只需要根据以上规则,验证已经填入的数字是否有效即可。
空白格用 '.' 表示。来源:力扣(LeetCode)链接:https://leetcode.cn/problems/valid-sudoku
''' 主思想我们考虑每一行、列、块中数字1-9出现的次数,如果>1,就不满足要求,为了满足这个想法,我们至少需要解决两件事: 1.怎么把行、列、块表示成我们想要的数组形式 2.怎么统计数字出现的次数 ''' class Solution: def isValidSudoku(self, board: List[List[str]]) -> bool: rows=[[0]*9 for _ in range(9)]#初始化检查行(二维数组) columns=[[0]*9 for _ in range(9)]#初始化检查列(二维数组) subboxes=[[[0]*9 for _ in range(3)] for _ in range(3)]#初始化检查块(三维数组) for i in range(9): for j in range(9): a=board[i][j] if a!='.':#与空格无关 a=int(a) #计数 rows[i][a-1]+=1 columns[j][a-1]+=1 subboxes[i//3][j//3][a-1]+=1 #判别 if rows[i][a-1]>1 or columns[j][a-1]>1 or subboxes[i//3][j//3][a-1]>1: return bool(0) return bool(1)
这题是真的把我整迷糊了好久,看完其他人的思路我才完成的,其中最难的是块的三维数组构造,我放个图应该就一目了然了(i//3与j//3应该不难理解)
示例1:
输入:board =
[["5","3",".",".","7",".",".",".","."]
,["6",".",".","1","9","5",".",".","."]
,[".","9","8",".",".",".",".","6","."]
,["8",".",".",".","6",".",".",".","3"]
,["4",".",".","8",".","3",".",".","1"]
,["7",".",".",".","2",".",".",".","6"]
,[".","6",".",".",".",".","2","8","."]
,[".",".",".","4","1","9",".",".","5"]
,[".",".",".",".","8",".",".","7","9"]]
输出:true来源:力扣(LeetCode)链接:https://leetcode.cn/problems/valid-sudoku
示例2:
输入:board =
[["8","3",".",".","7",".",".",".","."]
,["6",".",".","1","9","5",".",".","."]
,[".","9","8",".",".",".",".","6","."]
,["8",".",".",".","6",".",".",".","3"]
,["4",".",".","8",".","3",".",".","1"]
,["7",".",".",".","2",".",".",".","6"]
,[".","6",".",".",".",".","2","8","."]
,[".",".",".","4","1","9",".",".","5"]
,[".",".",".",".","8",".",".","7","9"]]
输出:false
解释:除了第一行的第一个数字从 5 改为 8 以外,空格内其他数字均与 示例1 相同。 但由于位于左上角的 3x3 宫内有两个 8 存在, 因此这个数独是无效的。来源:力扣(LeetCode)链接:https://leetcode.cn/problems/valid-sudoku
还做了T349,T350,T705,T706,其中T705和T706是哈希表相关知识,在python的字典帮助下,应该是很好解决的(python语言就从字典的角度去理解和编码哈希表应该是显然易懂的)。这四题都不难,这边也不贴出了。