weixin_39504758的博客

875爱吃香蕉的珂珂class Solution: def minEatingSpeed(self, piles: List[int], H: int) -> int: # 暴力 K_max = max(piles) for i in range(1, K_max + 1): if self.canEatAll(piles, i) <= H: return i #

树的遍历深度优先搜索前序遍历class Solution: def preorderTraversal(self, root: TreeNode) -> List[int]: #递归解法 #result = [] #def preorder(root): # if not root: # return # result.append(root.val)

542 01矩阵class Solution: def updateMatrix(self, matrix: List[List[int]]) -> List[List[int]]: m, n = len(matrix), len(matrix[0]) dist = [[0] * n for _ in range(m)] zeroes_pos = [(i, j) for i in range(m) for j in range(n) if m

733图像渲染class Solution: def floodFill(self, image: List[List[int]], sr: int, sc: int, newColor: int) -> List[List[int]]: target = image[sr][sc] m, n = len(image), len(image[0]) q = collections.deque([(sr, sc)]) image[

394字符串解码class Solution: def decodeString(self, s): stack = [] for string in s: if string != ']': stack.append(string) else: tmp = '' while stack[-1] != '[':

225用队列实现栈class MyStack: def __init__(self): """ Initialize your data structure here. """ self.q1 = [] self.q2 = [] self.tp = None def push(self, x: int) -> None: """ Push element

232用栈实现队列class MyQueue: def __init__(self): """ Initialize your data structure here. """ self.items = [] def push(self, x: int) -> None: """ Push element x to the back of queue. """

494目标和class Solution: def findTargetSumWays(self, nums: List[int], S: int) -> int: d = {} def dfs(cur, i, d): if i < len(nums) and (cur, i) not in d: d[(cur, i)] = dfs(cur + nums[i], i+1, d) + dfs(cur

133克隆图"""# Definition for a Node.class Node: def __init__(self, val = 0, neighbors = []): self.val = val self.neighbors = neighbors"""class Solution: def cloneGraph(self, node: 'Node') -> 'Node': if not node:

150逆波兰表达式求值class Solution(object): def evalRPN(self, tokens): """ :type tokens: List[str] :rtype: int """ stack =[] for token in tokens: if token not in '+-*/': stack.append(t

739. 每日温度class Solution: def dailyTemperatures(self, T): stack = [] n = len(T) outputlist = [0] * n for i in range(n): while stack != [] and T[i] > T[stack[-1]]: top =stack.pop()

20有效的括号class Solution: def isValid(self, s: str) -> bool: if not s: return True stack = collections.deque() for i in s: if i in '([{': stack.append(i) else:

155最小栈class MinStack(object): def __init__(self): """ initialize your data structure here. """ self.items = [] self.minitems = [] def push(self, x): """ :type x: int :rtype: None

多重背包问题#背包问题VIIclass Solution: """ @param n: the money of you @param prices: the price of rice[i] @param weight: the weight of rice[i] @param amounts: the amount of rice[i] @return: the maximum weight """ def backPackVII(se

完全背包问题完全背包：枚举每件物品取0，1，2，3 … m / A[i] 件，dp[i][j] = max(dp[i - 1][j],dp[i - 1][j - k * A[i]] + k * V[i])#背包问题IIIclass Solution: """ @param A: an integer array @param V: an integer array @param m: An integer @return: an array """

背包问题0-1背包问题状态转移方程dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w[i - 1]] + v[i - 1]),i代表第几个物品，j代表背包容量，w[i - 1],v[i - 1]代表第i个物品的重量和价值。#背包问题Iclass Solution: """ @param m: An integer m denotes the size of a backpack @param A: Given n items with s

Leetcode279完全平方数class Solution: def numSquares(self, n: int) -> int: square_nums = [a * a for a in range(1, int(n**0.5+1))] level = 0 queue = [n] while queue: level += 1 next_que = set()

Leetcode752 打开转盘锁class Solution: def openLock(self, deadends: List[str], target: str) -> int: def neighbor(node): y = list() for i in range(4): for j in (-1, 1): update = (int(nod

Leetcode200岛屿数量bfsclass Solution: def numIslands(self, grid): if not grid or not grid[0]: return 0 self.m, self.n = len(grid), len(grid[0]) islands = 0 for row in range(self.m): for col in range

286墙与门#286墙与门class Solution: def wallsAndGates(self, rooms): EMPTYROOM = 2**31 - 1 door = 0 neighbors = [[-1,0], [1,0], [0,-1], [0,1]] if not rooms: return row = len(rooms) col = len(rooms[0

346数据流中的移动平均值#346数据流中的移动平均值from collections import dequefrom pythonds import Dequeclass MovingAverage(): def __init__(self, size): self.queue = Deque() self.maxsize = size self.count = 0 def nxt(self, val): se

设计循环队列class MyCircularQueue: def __init__(self, k: int): """ Initialize your data structure here. Set the size of the queue to be k. """ self.len = k self.values = [-1] * self.len self.front = 0

80. 删除排序数组中的重复项 IIclass Solution: def removeDuplicates(self, nums: List[int]) -> int: # 双指针O（N） length = len(nums) slow, fast = 1, 1 count = 1 while fast < length: if nums[fast] == nums[fast -

118.杨辉三角Iclass Solution: def generate(self, numRows: int) -> List[List[int]]: # 动态规划 O(N^2) triangle = [] for row_num in range(numRows): row = [None for _ in range(row_num + 1)] row[0], row[-1] = 1,

hh