newCraftsman的博客

a

a

【代码】204. 计数质数。

668. 乘法表中第k小的数（Hard）378. 有序矩阵中第 K 小的元素（Medium）题解class Solution: def maxDistance(self, position: List[int], m: int) -> int: # 判断当前的mid是否合法：存放的下m个球 def check(x: int) -> bool: pre = position[0] cnt = 1.

73. 矩阵置零（Medium）130. 被围绕的区域（Medium）934. 最短的桥（Medium）547. 省份数量、朋友圈（Medium）684. 冗余连接（Medium）题解class Solution: # BFS def orangesRotting(self, grid: List[List[int]]) -> int: row, col, time = len(grid), len(grid[0]), 0 directi.

49. 字母异位词分组（Medium）438. 找到字符串中所有字母异位词（Medium）题解class Solution: # 贪心 def partitionLabels(self, s: str) -> List[int]: # 得到每个字母最后一次出现的下标位置 last = [0] * 26 for i, ch in enumerate(s): last[ord(ch) - ord("a").

题解class Solution: def __init__(self, nums: List[int]): self.array = nums self.original = list(nums) # 保存原始数组 def reset(self) -> List[int]: """ Resets the array to its original configuration and return it...

LeetCode 112. 路径总和（Easy）/ 113. 路径总和 II（Medium）/ 437. 路径总和 III（Medium） / 二叉树路径问题题解官方题解class Solution: def minFallingPathSum(self, matrix: List[List[int]]) -> int: n = len(matrix) # dp[j]表示从第j列下降（到某一行）得到的最小路径值 dp = [i for.

题解class Solution: def splitIntoFibonacci(self, num): ans = [] def backtrack(idx): # 若已经到达原始字符串的长度，则表示已经拆分完 if idx == len(num): return len(ans) >= 3 curr = 0 ..

最长重复子串剑指Offer 48. 最长不含重复字符的子字符串（Medium）递归前缀和+分治（后序遍历）class Solution: # 递归 def longestSubstring(self, s, k): if len(s) < k: return 0 for c in set(s): if s.count(c) < k: ret

547. 省份数量（Medium）684. 冗余连接（Medium）题解class Solution(object): def trulyMostPopular(self, names, synonyms): # 检查是否是同一个父节点，返回父节点 def find(x): if x != name_len[x]: name_len[x] = find(name_len[x]) .

题解class Solution: def isHappy(self, n: int) -> bool: # 计算下一个平方和数 def get_next(num): total_sum = 0 while num > 0: # 对num除以10，得到整除部分num、余数部分remainder num, remainder = div..

题解class Solution(object): # 贪心：最多修改一次，则只需比较连续的三个元素 def checkPossibility(self, nums): n = len(nums) cnt = 0 for i in range(1, n): # 若当前值比上一个值小，则需要进行修改 if nums[i] < nums[i - 1]: ..

题解class Solution: # 贪心 + 单调递增栈 def removeKdigits(self, num: str, k: int) -> str: # 单调递增栈，栈中的元素代表截止到当前位置， # 删除不超过 k 次个数字后，所能得到的最小整数 stack = [] # 构建单调递增的数字串 for digit in num: # 若左边..

题解class Solution: def maxSumOfThreeSubarrays(self, nums: List[int], k: int) -> List[int]: N = len(nums) ss = [sum(nums[:k])] for i in range(k, N) : ss.append(ss[-1] + nums[i] - nums[i-k]) maxl, maxr..

题解# Definition for a binary tree node.# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution: def maxProduct(self, root: TreeNode) -> int: total = 0...

题解（4种方法）class Solution(object): def shortestToChar(self, S, C): prev = float('-inf') # 记录上一个字符 C 出现的位置 ans = [] # 从左向右遍历，记录上一个字符 C 出现的位置 prev，那么答案就是 i - prev for i, x in enumerate(S): if x == C: prev = ..

题解class Solution(object): def findKthNumber(self, m, n, k): # x是否足够大可以成为乘法表中的第k小的值 def enough(x): rank = 0 for i in range(1, m+1): # 遍历每一行 # 每遍历一行，能增加的排序数都会减少（因为这里是乘法关系） # 而最多..

题解class Solution: def shortestCommonSupersequence(self, str1: str, str2: str) -> str: m = len(str1) n = len(str2) #--------------- 先找最长公共子序列LCS -----------------# dp = [["" for _ in range(n + 1)] for _ in range(..

官方题解DFS + BFS + 并查集class Solution: def solve(self, board: List[List[str]]) -> None: """ Do not return anything, modify board in-place instead. """ if not board: return n, m = len(boa..

题解class Solution: def beautifulArray(self, N: int) -> List[int]: # 哈希表记录数字i的漂亮数组 memo = {1 : [1]} def f(N): # 若不在哈希表中给定数，则进行计算 if N not in memo: # 奇数映射 + 偶数映射 memo..

题解"""# Definition for a Node.class Node: def __init__(self, val: int = 0, left: 'Node' = None, right: 'Node' = None, next: 'Node' = None): self.val = val self.left = left self.right = right self.next = next"""..

题解class Solution: def allPathsSourceTarget(self, graph: List[List[int]]) -> List[List[int]]: res = [] path = [0] # 每条路径都从第0个节点开始 def dfs(x: int): # 若已经到达第n-1个节点，则找到一条路径 if x == len(graph) - 1: ..

题解class Solution: def isInterleave(self, s1: str, s2: str, s3: str) -> bool: l1, l2, l3 = len(s1), len(s2), len(s3) if l1 + l2 != l3: return False # dp[i][j]表示s1[0..i]与s2[0..j]能否构成s3[0..i+j] # dp = ..

题解class Solution: def isPalindrome(self, s: str) -> bool: n = len(s) l, r = 0, n - 1 # 双指针还未相遇时，进行循环 while l < r: # 当s[l]不是字母或数字时，左指针l后移一位 while l < r and not s[l].isalnum():..

题解class Solution: def partition(self, s: str) -> List[List[str]]: n = len(s) # dp[i][j]表示s[i..j]是否为回文串，空串、单个字符均为回文串 dp = [[True] * n for _ in range(n)] # 从后往前遍历，确定哪些子串为回文串 for i in range(n - 1, -1, -1):..

题目链接119. 杨辉三角 II题解

题解链接class Solution: def setZeroes(self, matrix: List[List[int]]) -> None: """ Do not return anything, modify matrix in-place instead. """ flag_col = False row = len(matrix) col = len(matrix[0]) ..

题解class Solution: def splitArray(self, nums: List[int], m: int) -> int: def check(x: int) -> bool: total, cnt = 0, 1 for num in nums: if total + num > x: cnt += 1 ..

题解链接class Solution: def findDiagonalOrder(self, matrix: List[List[int]]) -> List[int]: if not matrix or not matrix[0]: return [] N, M = len(matrix), len(matrix[0]) row, column = 0, 0 direction = 1..

题解链接

题解链接class Solution: # 【DFS+BFS】连通分量搜索+多源最短路径 def shortestBridge(self, A: List[List[int]]) -> int: source = collections.deque() m = len(A) n = len(A[0]) def dfs(i, j): if i < 0 or j < 0 or i &g..

题解链接class Solution: # 双向BFS def findLadders(self, beginWord: str, endWord: str, wordList: List[str]) -> List[List[str]]: wordList = set(wordList) # 转换为hash实现O(1)的in判断 if endWord not in wordList: return [] #..

官方题解class Solution: def partitionDisjoint(self, A: List[int]) -> int: left_max = A[0] cur_max = A[0] split = 0 for i in range(1, len(A)): if A[i] >= cur_max: cur_max = A[i] ..

题目链接class Solution: def getMaxMatrix(self, matrix: List[List[int]]) -> List[int]: m, n = len(matrix), len(matrix[0]) ans = [0] * 4 r1, c1, r2, c2 = [0] * 4 max_sum = matrix[0][0] # 全局最大和 for i in range(m)..

题解链接class Solution(object): def findLongestChain(self, pairs): cur, ans = float('-inf'), 0 for x, y in sorted(pairs, key=lambda x: x[1]): if cur < x: cur = y ans += 1 return an..

完整题解class Solution: def countSmaller(self, nums: List[int]) -> List[int]: size = len(nums) if size == 0: return [] if size == 1: return [0] temp = [None for _ in range(size)] res ..

题目链接class Solution: def maxIncreaseKeepingSkyline(self, grid: List[List[int]]) -> int: m, n = len(grid), len(grid[0]) skyline_row = [] skyline_col = [] for i in range(m): skyline_row.append(max(grid[i..

题解

完整题解class Solution: def intersection(self, start1: List[int], end1: List[int], start2: List[int], end2: List[int]) -> List[float]: # 判断 (xk, yk) 是否在「线段」(x1, y1)~(x2, y2) 上 # 这里的前提是 (xk, yk) 一定在「直线」(x1, y1)~(x2, y2) 上 def..