994. 腐烂的橘子
Medium | Array, Breadth-First Search, Matrix
Posts
996. 平方数组的数量
Hard | Array, Hash Table, Math, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask
999. 车的可用捕获量
Easy | Array, Matrix, Simulation
3201. 寻找最长有效子序列 I
Medium | Array, Dynamic Programming
3202. 求有效子序列的最大长度 II
Medium | Array, Dynamic Programming
3203. 合并两棵树后的最小直径
Hard | Tree, Depth-First Search, Breadth-First Search, Graph Theory
3206. 交替组 I
Easy | Array, Sliding Window
3207. 敌人战斗后的最大点数
Medium | Array, Greedy
3208. 交替组 II
Medium | Array, Sliding Window
3209. 按位与值为 K 的子数组数目
Hard | Array, Binary Search, Bit Manipulation, Segment Tree