跳至主要內容

目录

目录

已完成 490 道

题号标题题解标签难度力扣
1两数之和[✓]数组 哈希表🟢🀄️open in new window 🔗open in new window
2两数相加[✓]递归 链表 数学🟠🀄️open in new window 🔗open in new window
3无重复字符的最长子串[✓]哈希表 字符串 滑动窗口🟠🀄️open in new window 🔗open in new window
4寻找两个正序数组的中位数[✓]数组 二分查找 分治🔴🀄️open in new window 🔗open in new window
5最长回文子串[✓]双指针 字符串 动态规划🟠🀄️open in new window 🔗open in new window
6Z 字形变换[✓]字符串🟠🀄️open in new window 🔗open in new window
7整数反转[✓]数学🟠🀄️open in new window 🔗open in new window
8字符串转换整数 (atoi)[✓]字符串🟠🀄️open in new window 🔗open in new window
9回文数[✓]数学🟢🀄️open in new window 🔗open in new window
10正则表达式匹配[✓]递归 字符串 动态规划🔴🀄️open in new window 🔗open in new window
11盛最多水的容器[✓]贪心 数组 双指针🟠🀄️open in new window 🔗open in new window
12整数转罗马数字[✓]哈希表 数学 字符串🟠🀄️open in new window 🔗open in new window
13罗马数字转整数[✓]哈希表 数学 字符串🟢🀄️open in new window 🔗open in new window
14最长公共前缀[✓]字典树 字符串🟢🀄️open in new window 🔗open in new window
15三数之和[✓]数组 双指针 排序🟠🀄️open in new window 🔗open in new window
16最接近的三数之和[✓]数组 双指针 排序🟠🀄️open in new window 🔗open in new window
17电话号码的字母组合[✓]哈希表 字符串 回溯🟠🀄️open in new window 🔗open in new window
18四数之和[✓]数组 双指针 排序🟠🀄️open in new window 🔗open in new window
19删除链表的倒数第 N 个结点[✓]链表 双指针🟠🀄️open in new window 🔗open in new window
20有效的括号[✓]栈 字符串🟢🀄️open in new window 🔗open in new window
21合并两个有序链表[✓]递归 链表🟢🀄️open in new window 🔗open in new window
22括号生成[✓]字符串 动态规划 回溯🟠🀄️open in new window 🔗open in new window
23合并 K 个升序链表[✓]链表 分治 堆（优先队列） 1+🔴🀄️open in new window 🔗open in new window
24两两交换链表中的节点[✓]递归 链表🟠🀄️open in new window 🔗open in new window
25K 个一组翻转链表[✓]递归 链表🔴🀄️open in new window 🔗open in new window
26删除有序数组中的重复项[✓]数组 双指针🟢🀄️open in new window 🔗open in new window
27移除元素[✓]数组 双指针🟢🀄️open in new window 🔗open in new window
28找出字符串中第一个匹配项的下标[✓]双指针 字符串 字符串匹配🟢🀄️open in new window 🔗open in new window
29两数相除[✓]位运算 数学🟠🀄️open in new window 🔗open in new window
30串联所有单词的子串[✓]哈希表 字符串 滑动窗口🔴🀄️open in new window 🔗open in new window
31下一个排列[✓]数组 双指针🟠🀄️open in new window 🔗open in new window
32最长有效括号[✓]栈 字符串 动态规划🔴🀄️open in new window 🔗open in new window
33搜索旋转排序数组[✓]数组 二分查找🟠🀄️open in new window 🔗open in new window
34在排序数组中查找元素的第一个和最后一个位置[✓]数组 二分查找🟠🀄️open in new window 🔗open in new window
35搜索插入位置[✓]数组 二分查找🟢🀄️open in new window 🔗open in new window
36有效的数独[✓]数组 哈希表 矩阵🟠🀄️open in new window 🔗open in new window
37解数独[✓]数组 哈希表 回溯 1+🔴🀄️open in new window 🔗open in new window
38外观数列[✓]字符串🟠🀄️open in new window 🔗open in new window
39组合总和[✓]数组 回溯🟠🀄️open in new window 🔗open in new window
40组合总和 II[✓]数组 回溯🟠🀄️open in new window 🔗open in new window
41缺失的第一个正数[✓]数组 哈希表🔴🀄️open in new window 🔗open in new window
42接雨水[✓]栈 数组 双指针 2+🔴🀄️open in new window 🔗open in new window
43字符串相乘[✓]数学 字符串 模拟🟠🀄️open in new window 🔗open in new window
44通配符匹配[✓]贪心 递归 字符串 1+🔴🀄️open in new window 🔗open in new window
45跳跃游戏 II[✓]贪心 数组 动态规划🟠🀄️open in new window 🔗open in new window
46全排列[✓]数组 回溯🟠🀄️open in new window 🔗open in new window
47全排列 II[✓]数组 回溯🟠🀄️open in new window 🔗open in new window
48旋转图像[✓]数组 数学 矩阵🟠🀄️open in new window 🔗open in new window
49字母异位词分组[✓]数组 哈希表 字符串 1+🟠🀄️open in new window 🔗open in new window
50Pow(x, n)[✓]递归 数学🟠🀄️open in new window 🔗open in new window
51N 皇后[✓]数组 回溯🔴🀄️open in new window 🔗open in new window
52N 皇后 II[✓]回溯🔴🀄️open in new window 🔗open in new window
53最大子数组和[✓]数组 分治 动态规划🟠🀄️open in new window 🔗open in new window
54螺旋矩阵[✓]数组 矩阵 模拟🟠🀄️open in new window 🔗open in new window
55跳跃游戏[✓]贪心 数组 动态规划🟠🀄️open in new window 🔗open in new window
56合并区间[✓]数组 排序🟠🀄️open in new window 🔗open in new window
57插入区间[✓]数组🟠🀄️open in new window 🔗open in new window
58最后一个单词的长度[✓]字符串🟢🀄️open in new window 🔗open in new window
59螺旋矩阵 II[✓]数组 矩阵 模拟🟠🀄️open in new window 🔗open in new window
61旋转链表[✓]链表 双指针🟠🀄️open in new window 🔗open in new window
62不同路径[✓]数学 动态规划 组合数学🟠🀄️open in new window 🔗open in new window
63不同路径 II[✓]数组 动态规划 矩阵🟠🀄️open in new window 🔗open in new window
64最小路径和[✓]数组 动态规划 矩阵🟠🀄️open in new window 🔗open in new window
66加一[✓]数组 数学🟢🀄️open in new window 🔗open in new window
67二进制求和[✓]位运算 数学 字符串 1+🟢🀄️open in new window 🔗open in new window
68文本左右对齐[✓]数组 字符串 模拟🔴🀄️open in new window 🔗open in new window
69x 的平方根[✓]数学 二分查找🟢🀄️open in new window 🔗open in new window
70爬楼梯[✓]记忆化搜索 数学 动态规划🟢🀄️open in new window 🔗open in new window
71简化路径[✓]栈 字符串🟠🀄️open in new window 🔗open in new window
72编辑距离[✓]字符串 动态规划🟠🀄️open in new window 🔗open in new window
73矩阵置零[✓]数组 哈希表 矩阵🟠🀄️open in new window 🔗open in new window
74搜索二维矩阵[✓]数组 二分查找 矩阵🟠🀄️open in new window 🔗open in new window
75颜色分类[✓]数组 双指针 排序🟠🀄️open in new window 🔗open in new window
76最小覆盖子串[✓]哈希表 字符串 滑动窗口🔴🀄️open in new window 🔗open in new window
77组合[✓]回溯🟠🀄️open in new window 🔗open in new window
78子集[✓]位运算 数组 回溯🟠🀄️open in new window 🔗open in new window
79单词搜索[✓]数组 字符串 回溯 1+🟠🀄️open in new window 🔗open in new window
80删除有序数组中的重复项 II[✓]数组 双指针🟠🀄️open in new window 🔗open in new window
81搜索旋转排序数组 II[✓]数组 二分查找🟠🀄️open in new window 🔗open in new window
82删除排序链表中的重复元素 II[✓]链表 双指针🟠🀄️open in new window 🔗open in new window
83删除排序链表中的重复元素[✓]链表🟢🀄️open in new window 🔗open in new window
84柱状图中最大的矩形[✓]栈 数组 单调栈🔴🀄️open in new window 🔗open in new window
85最大矩形[✓]栈 数组 动态规划 2+🔴🀄️open in new window 🔗open in new window
86分隔链表[✓]链表 双指针🟠🀄️open in new window 🔗open in new window
88合并两个有序数组[✓]数组 双指针 排序🟢🀄️open in new window 🔗open in new window
90子集 II[✓]位运算 数组 回溯🟠🀄️open in new window 🔗open in new window
92反转链表 II[✓]链表🟠🀄️open in new window 🔗open in new window
93复原 IP 地址[✓]字符串 回溯🟠🀄️open in new window 🔗open in new window
94二叉树的中序遍历[✓]栈 树 深度优先搜索 1+🟢🀄️open in new window 🔗open in new window
95不同的二叉搜索树 II[✓]树 二叉搜索树 动态规划 2+🟠🀄️open in new window 🔗open in new window
96不同的二叉搜索树[✓]树 二叉搜索树 数学 2+🟠🀄️open in new window 🔗open in new window
97交错字符串[✓]字符串 动态规划🟠🀄️open in new window 🔗open in new window
98验证二叉搜索树[✓]树 深度优先搜索 二叉搜索树 1+🟠🀄️open in new window 🔗open in new window
99恢复二叉搜索树[✓]树 深度优先搜索 二叉搜索树 1+🟠🀄️open in new window 🔗open in new window
100相同的树[✓]树 深度优先搜索 广度优先搜索 1+🟢🀄️open in new window 🔗open in new window
101对称二叉树[✓]树 深度优先搜索 广度优先搜索 1+🟢🀄️open in new window 🔗open in new window
102二叉树的层序遍历[✓]树 广度优先搜索 二叉树🟠🀄️open in new window 🔗open in new window
103二叉树的锯齿形层序遍历[✓]树 广度优先搜索 二叉树🟠🀄️open in new window 🔗open in new window
104二叉树的最大深度[✓]树 深度优先搜索 广度优先搜索 1+🟢🀄️open in new window 🔗open in new window
105从前序与中序遍历序列构造二叉树[✓]树 数组 哈希表 2+🟠🀄️open in new window 🔗open in new window
106从中序与后序遍历序列构造二叉树[✓]树 数组 哈希表 2+🟠🀄️open in new window 🔗open in new window
107二叉树的层序遍历 II[✓]树 广度优先搜索 二叉树🟠🀄️open in new window 🔗open in new window
108将有序数组转换为二叉搜索树[✓]树 二叉搜索树 数组 2+🟢🀄️open in new window 🔗open in new window
109有序链表转换二叉搜索树[✓]树 二叉搜索树 链表 2+🟠🀄️open in new window 🔗open in new window
110平衡二叉树[✓]树 深度优先搜索 二叉树🟢🀄️open in new window 🔗open in new window
111二叉树的最小深度[✓]树 深度优先搜索 广度优先搜索 1+🟢🀄️open in new window 🔗open in new window
112路径总和[✓]树 深度优先搜索 广度优先搜索 1+🟢🀄️open in new window 🔗open in new window
113路径总和 II[✓]树 深度优先搜索 回溯 1+🟠🀄️open in new window 🔗open in new window
114二叉树展开为链表[✓]栈 树 深度优先搜索 2+🟠🀄️open in new window 🔗open in new window
116填充每个节点的下一个右侧节点指针[✓]树 深度优先搜索 广度优先搜索 2+🟠🀄️open in new window 🔗open in new window
117填充每个节点的下一个右侧节点指针 II[✓]树 深度优先搜索 广度优先搜索 2+🟠🀄️open in new window 🔗open in new window
118杨辉三角[✓]数组 动态规划🟢🀄️open in new window 🔗open in new window
120三角形最小路径和[✓]数组 动态规划🟠🀄️open in new window 🔗open in new window
121买卖股票的最佳时机[✓]数组 动态规划🟢🀄️open in new window 🔗open in new window
122买卖股票的最佳时机 II[✓]贪心 数组 动态规划🟠🀄️open in new window 🔗open in new window
123买卖股票的最佳时机 III[✓]数组 动态规划🔴🀄️open in new window 🔗open in new window
124二叉树中的最大路径和[✓]树 深度优先搜索 动态规划 1+🔴🀄️open in new window 🔗open in new window
125验证回文串[✓]双指针 字符串🟢🀄️open in new window 🔗open in new window
127单词接龙[✓]广度优先搜索 哈希表 字符串🔴🀄️open in new window 🔗open in new window
128最长连续序列[✓]并查集 数组 哈希表🟠🀄️open in new window 🔗open in new window
129求根节点到叶节点数字之和[✓]树 深度优先搜索 二叉树🟠🀄️open in new window 🔗open in new window
130被围绕的区域[✓]深度优先搜索 广度优先搜索 并查集 2+🟠🀄️open in new window 🔗open in new window
131分割回文串[✓]字符串 动态规划 回溯🟠🀄️open in new window 🔗open in new window
133克隆图[✓]深度优先搜索 广度优先搜索 图 1+🟠🀄️open in new window 🔗open in new window
134加油站[✓]贪心 数组🟠🀄️open in new window 🔗open in new window
135分发糖果[✓]贪心 数组🔴🀄️open in new window 🔗open in new window
136只出现一次的数字[✓]位运算 数组🟢🀄️open in new window 🔗open in new window
137只出现一次的数字 II[✓]位运算 数组🟠🀄️open in new window 🔗open in new window
138随机链表的复制[✓]哈希表 链表🟠🀄️open in new window 🔗open in new window
139单词拆分[✓]字典树 记忆化搜索 数组 3+🟠🀄️open in new window 🔗open in new window
141环形链表[✓]哈希表 链表 双指针🟢🀄️open in new window 🔗open in new window
142环形链表 II[✓]哈希表 链表 双指针🟠🀄️open in new window 🔗open in new window
143重排链表[✓]栈 递归 链表 1+🟠🀄️open in new window 🔗open in new window
144二叉树的前序遍历[✓]栈 树 深度优先搜索 1+🟢🀄️open in new window 🔗open in new window
145二叉树的后序遍历[✓]栈 树 深度优先搜索 1+🟢🀄️open in new window 🔗open in new window
146LRU 缓存[✓]设计 哈希表 链表 1+🟠🀄️open in new window 🔗open in new window
147对链表进行插入排序[✓]链表 排序🟠🀄️open in new window 🔗open in new window
148排序链表[✓]链表 双指针 分治 2+🟠🀄️open in new window 🔗open in new window
149直线上最多的点数[✓]几何 数组 哈希表 1+🔴🀄️open in new window 🔗open in new window
150逆波兰表达式求值[✓]栈 数组 数学🟠🀄️open in new window 🔗open in new window
151反转字符串中的单词[✓]双指针 字符串🟠🀄️open in new window 🔗open in new window
152乘积最大子数组[✓]数组 动态规划🟠🀄️open in new window 🔗open in new window
153寻找旋转排序数组中的最小值[✓]数组 二分查找🟠🀄️open in new window 🔗open in new window
154寻找旋转排序数组中的最小值 II[✓]数组 二分查找🔴🀄️open in new window 🔗open in new window
155最小栈[✓]栈 设计🟠🀄️open in new window 🔗open in new window
156上下翻转二叉树 🔒[✓]树 深度优先搜索 二叉树🟠🀄️open in new window 🔗open in new window
160相交链表[✓]哈希表 链表 双指针🟢🀄️open in new window 🔗open in new window
162寻找峰值[✓]数组 二分查找🟠🀄️open in new window 🔗open in new window
167两数之和 II - 输入有序数组[✓]数组 双指针 二分查找🟠🀄️open in new window 🔗open in new window
169多数元素[✓]数组 哈希表 分治 2+🟢🀄️open in new window 🔗open in new window
172阶乘后的零[✓]数学🟠🀄️open in new window 🔗open in new window
173二叉搜索树迭代器[✓]栈 树 设计 3+🟠🀄️open in new window 🔗open in new window
174地下城游戏[✓]数组 动态规划 矩阵🔴🀄️open in new window 🔗open in new window
188买卖股票的最佳时机 IV[✓]数组 动态规划🔴🀄️open in new window 🔗open in new window
189轮转数组[✓]数组 数学 双指针🟠🀄️open in new window 🔗open in new window
190颠倒二进制位[✓]位运算 分治🟢🀄️open in new window 🔗open in new window
191位1的个数[✓]位运算 分治🟢🀄️open in new window 🔗open in new window
198打家劫舍[✓]数组 动态规划🟠🀄️open in new window 🔗open in new window
199二叉树的右视图[✓]树 深度优先搜索 广度优先搜索 1+🟠🀄️open in new window 🔗open in new window
200岛屿数量[✓]深度优先搜索 广度优先搜索 并查集 2+🟠🀄️open in new window 🔗open in new window
201数字范围按位与[✓]位运算🟠🀄️open in new window 🔗open in new window
202快乐数[✓]哈希表 数学 双指针🟢🀄️open in new window 🔗open in new window
203移除链表元素[✓]递归 链表🟢🀄️open in new window 🔗open in new window
205同构字符串[✓]哈希表 字符串🟢🀄️open in new window 🔗open in new window
206反转链表[✓]递归 链表🟢🀄️open in new window 🔗open in new window
207课程表[✓]深度优先搜索 广度优先搜索 图 1+🟠🀄️open in new window 🔗open in new window
208实现 Trie (前缀树)[✓]设计 字典树 哈希表 1+🟠🀄️open in new window 🔗open in new window
209长度最小的子数组[✓]数组 二分查找 前缀和 1+🟠🀄️open in new window 🔗open in new window
210课程表 II[✓]深度优先搜索 广度优先搜索 图 1+🟠🀄️open in new window 🔗open in new window
211添加与搜索单词 - 数据结构设计[✓]深度优先搜索 设计 字典树 1+🟠🀄️open in new window 🔗open in new window
212单词搜索 II[✓]字典树 数组 字符串 2+🔴🀄️open in new window 🔗open in new window
215数组中的第K个最大元素[✓]数组 分治 快速选择 2+🟠🀄️open in new window 🔗open in new window
216组合总和 III[✓]数组 回溯🟠🀄️open in new window 🔗open in new window
217存在重复元素[✓]数组 哈希表 排序🟢🀄️open in new window 🔗open in new window
219存在重复元素 II[✓]数组 哈希表 滑动窗口🟢🀄️open in new window 🔗open in new window
221最大正方形[✓]数组 动态规划 矩阵🟠🀄️open in new window 🔗open in new window
222完全二叉树的节点个数[✓]位运算 树 二分查找 1+🟢🀄️open in new window 🔗open in new window
224基本计算器[✓]栈 递归 数学 1+🔴🀄️open in new window 🔗open in new window
225用队列实现栈[✓]栈 设计 队列🟢🀄️open in new window 🔗open in new window
226翻转二叉树[✓]树 深度优先搜索 广度优先搜索 1+🟢🀄️open in new window 🔗open in new window
227基本计算器 II[✓]栈 数学 字符串🟠🀄️open in new window 🔗open in new window
228汇总区间[✓]数组🟢🀄️open in new window 🔗open in new window
230二叉搜索树中第 K 小的元素[✓]树 深度优先搜索 二叉搜索树 1+🟠🀄️open in new window 🔗open in new window
232用栈实现队列[✓]栈 设计 队列🟢🀄️open in new window 🔗open in new window
233数字 1 的个数[✓]递归 数学 动态规划🔴🀄️open in new window 🔗open in new window
234回文链表[✓]栈 递归 链表 1+🟢🀄️open in new window 🔗open in new window
235二叉搜索树的最近公共祖先[✓]树 深度优先搜索 二叉搜索树 1+🟠🀄️open in new window 🔗open in new window
236二叉树的最近公共祖先[✓]树 深度优先搜索 二叉树🟠🀄️open in new window 🔗open in new window
237删除链表中的节点[✓]链表🟠🀄️open in new window 🔗open in new window
238除自身以外数组的乘积[✓]数组 前缀和🟠🀄️open in new window 🔗open in new window
239滑动窗口最大值[✓]队列 数组 滑动窗口 2+🔴🀄️open in new window 🔗open in new window
240搜索二维矩阵 II[✓]数组 二分查找 分治 1+🟠🀄️open in new window 🔗open in new window
242有效的字母异位词[✓]哈希表 字符串 排序🟢🀄️open in new window 🔗open in new window
257二叉树的所有路径[✓]树 深度优先搜索 字符串 2+🟢🀄️open in new window 🔗open in new window
259较小的三数之和 🔒[✓]数组 双指针 二分查找 1+🟠🀄️open in new window 🔗open in new window
264丑数 II[✓]哈希表 数学 动态规划 1+🟠🀄️open in new window 🔗open in new window
268丢失的数字[✓]位运算 数组 哈希表 3+🟢🀄️open in new window 🔗open in new window
274H 指数[✓]数组 计数排序 排序🟠🀄️open in new window 🔗open in new window
275H 指数 II[✓]数组 二分查找🟠🀄️open in new window 🔗open in new window
278第一个错误的版本[✓]二分查找 交互🟢🀄️open in new window 🔗open in new window
279完全平方数[✓]广度优先搜索 数学 动态规划🟠🀄️open in new window 🔗open in new window
283移动零[✓]数组 双指针🟢🀄️open in new window 🔗open in new window
287寻找重复数[✓]位运算 数组 双指针 1+🟠🀄️open in new window 🔗open in new window
289生命游戏[✓]数组 矩阵 模拟🟠🀄️open in new window 🔗open in new window
290单词规律[✓]哈希表 字符串🟢🀄️open in new window 🔗open in new window
295数据流的中位数[✓]设计 双指针 数据流 2+🔴🀄️open in new window 🔗open in new window
297二叉树的序列化与反序列化[✓]树 深度优先搜索 广度优先搜索 3+🔴🀄️open in new window 🔗open in new window
300最长递增子序列[✓]数组 二分查找 动态规划🟠🀄️open in new window 🔗open in new window
303区域和检索 - 数组不可变[✓]设计 数组 前缀和🟢🀄️open in new window 🔗open in new window
307区域和检索 - 数组可修改[✓]设计 树状数组 线段树 1+🟠🀄️open in new window 🔗open in new window
309买卖股票的最佳时机含冷冻期[✓]数组 动态规划🟠🀄️open in new window 🔗open in new window
316去除重复字母[✓]栈 贪心 字符串 1+🟠🀄️open in new window 🔗open in new window
322零钱兑换[✓]广度优先搜索 数组 动态规划🟠🀄️open in new window 🔗open in new window
328奇偶链表[✓]链表🟠🀄️open in new window 🔗open in new window
334递增的三元子序列[✓]贪心 数组🟠🀄️open in new window 🔗open in new window
338比特位计数[✓]位运算 动态规划🟢🀄️open in new window 🔗open in new window
343整数拆分[✓]数学 动态规划🟠🀄️open in new window 🔗open in new window
344反转字符串[✓]双指针 字符串🟢🀄️open in new window 🔗open in new window
345反转字符串中的元音字母[✓]双指针 字符串🟢🀄️open in new window 🔗open in new window
346数据流中的移动平均值 🔒[✓]设计 队列 数组 1+🟢🀄️open in new window 🔗open in new window
347前 K 个高频元素[✓]数组 哈希表 分治 5+🟠🀄️open in new window 🔗open in new window
354俄罗斯套娃信封问题[✓]数组 二分查找 动态规划 1+🔴🀄️open in new window 🔗open in new window
355设计推特[✓]设计 哈希表 链表 1+🟠🀄️open in new window 🔗open in new window
366寻找二叉树的叶子节点 🔒[✓]树 深度优先搜索 二叉树🟠🀄️open in new window 🔗open in new window
369给单链表加一 🔒[✓]链表 数学🟠🀄️open in new window 🔗open in new window
373查找和最小的 K 对数字[✓]数组 堆（优先队列）🟠🀄️open in new window 🔗open in new window
374猜数字大小[✓]二分查找 交互🟢🀄️open in new window 🔗open in new window
375猜数字大小 II[✓]数学 动态规划 博弈🟠🀄️open in new window 🔗open in new window
378有序矩阵中第 K 小的元素[✓]数组 二分查找 矩阵 2+🟠🀄️open in new window 🔗open in new window
379电话目录管理系统 🔒[✓]设计 队列 数组 2+🟠🀄️open in new window 🔗open in new window
380O(1) 时间插入、删除和获取随机元素[✓]设计 数组 哈希表 2+🟠🀄️open in new window 🔗open in new window
382链表随机节点[✓]水塘抽样 链表 数学 1+🟠🀄️open in new window 🔗open in new window
383赎金信[✓]哈希表 字符串 计数🟢🀄️open in new window 🔗open in new window
392判断子序列[✓]双指针 字符串 动态规划🟢🀄️open in new window 🔗open in new window
394字符串解码[✓]栈 递归 字符串🟠🀄️open in new window 🔗open in new window
399除法求值[✓]深度优先搜索 广度优先搜索 并查集 4+🟠🀄️open in new window 🔗open in new window
400第 N 位数字[✓]数学 二分查找🟠🀄️open in new window 🔗open in new window
415字符串相加[✓]数学 字符串 模拟🟢🀄️open in new window 🔗open in new window
416分割等和子集[✓]数组 动态规划🟠🀄️open in new window 🔗open in new window
426将二叉搜索树转化为排序的双向链表 🔒[✓]栈 树 深度优先搜索 4+🟠🀄️open in new window 🔗open in new window
427建立四叉树[✓]树 数组 分治 1+🟠🀄️open in new window 🔗open in new window
430扁平化多级双向链表[✓]深度优先搜索 链表 双向链表🟠🀄️open in new window 🔗open in new window
432全 O(1) 的数据结构[✓]设计 哈希表 链表 1+🔴🀄️open in new window 🔗open in new window
433最小基因变化[✓]广度优先搜索 哈希表 字符串🟠🀄️open in new window 🔗open in new window
435无重叠区间[✓]贪心 数组 动态规划 1+🟠🀄️open in new window 🔗open in new window
437路径总和 III[✓]树 深度优先搜索 二叉树🟠🀄️open in new window 🔗open in new window
438找到字符串中所有字母异位词[✓]哈希表 字符串 滑动窗口🟠🀄️open in new window 🔗open in new window
440字典序的第K小数字[✓]字典树🔴🀄️open in new window 🔗open in new window
442数组中重复的数据[✓]数组 哈希表🟠🀄️open in new window 🔗open in new window
443压缩字符串[✓]双指针 字符串🟠🀄️open in new window 🔗open in new window
445两数相加 II[✓]栈 链表 数学🟠🀄️open in new window 🔗open in new window
450删除二叉搜索树中的节点[✓]树 二叉搜索树 二叉树🟠🀄️open in new window 🔗open in new window
451根据字符出现频率排序[✓]哈希表 字符串 桶排序 3+🟠🀄️open in new window 🔗open in new window
452用最少数量的箭引爆气球[✓]贪心 数组 排序🟠🀄️open in new window 🔗open in new window
459重复的子字符串[✓]字符串 字符串匹配🟢🀄️open in new window 🔗open in new window
474一和零[✓]数组 字符串 动态规划🟠🀄️open in new window 🔗open in new window
485最大连续 1 的个数[✓]数组🟢🀄️open in new window 🔗open in new window
494目标和[✓]数组 动态规划 回溯🟠🀄️open in new window 🔗open in new window
496下一个更大元素 I[✓]栈 数组 哈希表 1+🟢🀄️open in new window 🔗open in new window
498对角线遍历[✓]数组 矩阵 模拟🟠🀄️open in new window 🔗open in new window
502IPO[✓]贪心 数组 排序 1+🔴🀄️open in new window 🔗open in new window
503下一个更大元素 II[✓]栈 数组 单调栈🟠🀄️open in new window 🔗open in new window
506相对名次[✓]数组 排序 堆（优先队列）🟢🀄️open in new window 🔗open in new window
509斐波那契数[✓]递归 记忆化搜索 数学 1+🟢🀄️open in new window 🔗open in new window
514自由之路[✓]深度优先搜索 广度优先搜索 字符串 1+🔴🀄️open in new window 🔗open in new window
516最长回文子序列[✓]字符串 动态规划🟠🀄️open in new window 🔗open in new window
518零钱兑换 II[✓]数组 动态规划🟠🀄️open in new window 🔗open in new window
530二叉搜索树的最小绝对差[✓]树 深度优先搜索 广度优先搜索 2+🟢🀄️open in new window 🔗open in new window
543二叉树的直径[✓]树 深度优先搜索 二叉树🟢🀄️open in new window 🔗open in new window
557反转字符串中的单词 III[✓]双指针 字符串🟢🀄️open in new window 🔗open in new window
559N 叉树的最大深度[✓]树 深度优先搜索 广度优先搜索🟢🀄️open in new window 🔗open in new window
560和为 K 的子数组[✓]数组 哈希表 前缀和🟠🀄️open in new window 🔗open in new window
567字符串的排列[✓]哈希表 双指针 字符串 1+🟠🀄️open in new window 🔗open in new window
572另一棵树的子树[✓]树 深度优先搜索 二叉树 2+🟢🀄️open in new window 🔗open in new window
583两个字符串的删除操作[✓]字符串 动态规划🟠🀄️open in new window 🔗open in new window
589N 叉树的前序遍历[✓]栈 树 深度优先搜索🟢🀄️open in new window 🔗open in new window
590N 叉树的后序遍历[✓]栈 树 深度优先搜索🟢🀄️open in new window 🔗open in new window
605种花问题[✓]贪心 数组🟢🀄️open in new window 🔗open in new window
611有效三角形的个数[✓]贪心 数组 双指针 2+🟠🀄️open in new window 🔗open in new window
617合并二叉树[✓]树 深度优先搜索 广度优先搜索 1+🟢🀄️open in new window 🔗open in new window
622设计循环队列[✓]设计 队列 数组 1+🟠🀄️open in new window 🔗open in new window
632最小区间[✓]贪心 数组 哈希表 3+🔴🀄️open in new window 🔗open in new window
637二叉树的层平均值[✓]树 深度优先搜索 广度优先搜索 1+🟢🀄️open in new window 🔗open in new window
641设计循环双端队列[✓]设计 队列 数组 1+🟠🀄️open in new window 🔗open in new window
643子数组最大平均数 I[✓]数组 滑动窗口🟢🀄️open in new window 🔗open in new window
649Dota2 参议院[✓]贪心 队列 字符串🟠🀄️open in new window 🔗open in new window
654最大二叉树[✓]栈 树 数组 3+🟠🀄️open in new window 🔗open in new window
662二叉树最大宽度[✓]树 深度优先搜索 广度优先搜索 1+🟠🀄️open in new window 🔗open in new window
670最大交换[✓]贪心 数学🟠🀄️open in new window 🔗open in new window
678有效的括号字符串[✓]栈 贪心 字符串 1+🟠🀄️open in new window 🔗open in new window
682棒球比赛[✓]栈 数组 模拟🟢🀄️open in new window 🔗open in new window
695岛屿的最大面积[✓]深度优先搜索 广度优先搜索 并查集 2+🟠🀄️open in new window 🔗open in new window
700二叉搜索树中的搜索[✓]树 二叉搜索树 二叉树🟢🀄️open in new window 🔗open in new window
701二叉搜索树中的插入操作[✓]树 二叉搜索树 二叉树🟠🀄️open in new window 🔗open in new window
703数据流中的第 K 大元素[✓]树 设计 二叉搜索树 3+🟢🀄️open in new window 🔗open in new window
704二分查找[✓]数组 二分查找🟢🀄️open in new window 🔗open in new window
705设计哈希集合[✓]设计 数组 哈希表 2+🟢🀄️open in new window 🔗open in new window
706设计哈希映射[✓]设计 数组 哈希表 2+🟢🀄️open in new window 🔗open in new window
707设计链表[✓]设计 链表🟠🀄️open in new window 🔗open in new window
712两个字符串的最小ASCII删除和[✓]字符串 动态规划🟠🀄️open in new window 🔗open in new window
714买卖股票的最佳时机含手续费[✓]贪心 数组 动态规划🟠🀄️open in new window 🔗open in new window
724寻找数组的中心下标[✓]数组 前缀和🟢🀄️open in new window 🔗open in new window
729我的日程安排表 I[✓]设计 线段树 数组 2+🟠🀄️open in new window 🔗open in new window
731我的日程安排表 II[✓]设计 线段树 数组 3+🟠🀄️open in new window 🔗open in new window
735小行星碰撞[✓]栈 数组 模拟🟠🀄️open in new window 🔗open in new window
739每日温度[✓]栈 数组 单调栈🟠🀄️open in new window 🔗open in new window
746使用最小花费爬楼梯[✓]数组 动态规划🟢🀄️open in new window 🔗open in new window
763划分字母区间[✓]贪心 哈希表 双指针 1+🟠🀄️open in new window 🔗open in new window
772基本计算器 III 🔒[✓]栈 递归 数学 1+🔴🀄️open in new window 🔗open in new window
783二叉搜索树节点最小距离[✓]树 深度优先搜索 广度优先搜索 2+🟢🀄️open in new window 🔗open in new window
790多米诺和托米诺平铺[✓]动态规划🟠🀄️open in new window 🔗open in new window
796旋转字符串[✓]字符串 字符串匹配🟢🀄️open in new window 🔗open in new window
844比较含退格的字符串[✓]栈 双指针 字符串 1+🟢🀄️open in new window 🔗open in new window
845数组中的最长山脉[✓]数组 双指针 动态规划 1+🟠🀄️open in new window 🔗open in new window
852山脉数组的峰顶索引[✓]数组 二分查找🟠🀄️open in new window 🔗open in new window
862和至少为 K 的最短子数组[✓]队列 数组 二分查找 4+🔴🀄️open in new window 🔗open in new window
872叶子相似的树[✓]树 深度优先搜索 二叉树🟢🀄️open in new window 🔗open in new window
876链表的中间结点[✓]链表 双指针🟢🀄️open in new window 🔗open in new window
880索引处的解码字符串[✓]栈 字符串🟠🀄️open in new window 🔗open in new window
889根据前序和后序遍历构造二叉树[✓]树 数组 哈希表 2+🟠🀄️open in new window 🔗open in new window
901股票价格跨度[✓]栈 设计 数据流 1+🟠🀄️open in new window 🔗open in new window
909蛇梯棋[✓]广度优先搜索 数组 矩阵🟠🀄️open in new window 🔗open in new window
918环形子数组的最大和[✓]队列 数组 分治 2+🟠🀄️open in new window 🔗open in new window
921使括号有效的最少添加[✓]栈 贪心 字符串🟠🀄️open in new window 🔗open in new window
931下降路径最小和[✓]数组 动态规划 矩阵🟠🀄️open in new window 🔗open in new window
933最近的请求次数[✓]设计 队列 数据流🟢🀄️open in new window 🔗open in new window
945使数组唯一的最小增量[✓]贪心 数组 计数 1+🟠🀄️open in new window 🔗open in new window
946验证栈序列[✓]栈 数组 模拟🟠🀄️open in new window 🔗open in new window
951翻转等价二叉树[✓]树 深度优先搜索 二叉树🟠🀄️open in new window 🔗open in new window
954二倍数对数组[✓]贪心 数组 哈希表 1+🟠🀄️open in new window 🔗open in new window
958二叉树的完全性检验[✓]树 广度优先搜索 二叉树🟠🀄️open in new window 🔗open in new window
962最大宽度坡[✓]栈 数组 单调栈🟠🀄️open in new window 🔗open in new window
973最接近原点的 K 个点[✓]几何 数组 数学 4+🟠🀄️open in new window 🔗open in new window
986区间列表的交集[✓]数组 双指针🟠🀄️open in new window 🔗open in new window
994腐烂的橘子[✓]广度优先搜索 数组 矩阵🟠🀄️open in new window 🔗open in new window
1004最大连续1的个数 III[✓]数组 二分查找 前缀和 1+🟠🀄️open in new window 🔗open in new window
1008前序遍历构造二叉搜索树[✓]栈 树 二叉搜索树 3+🟠🀄️open in new window 🔗open in new window
1021删除最外层的括号[✓]栈 字符串🟢🀄️open in new window 🔗open in new window
1047删除字符串中的所有相邻重复项[✓]栈 字符串🟢🀄️open in new window 🔗open in new window
1049最后一块石头的重量 II[✓]数组 动态规划🟠🀄️open in new window 🔗open in new window
1071字符串的最大公因子[✓]数学 字符串🟢🀄️open in new window 🔗open in new window
1081不同字符的最小子序列[✓]栈 贪心 字符串 1+🟠🀄️open in new window 🔗open in new window
1106解析布尔表达式[✓]栈 递归 字符串🔴🀄️open in new window 🔗open in new window
1137第 N 个泰波那契数[✓]记忆化搜索 数学 动态规划🟢🀄️open in new window 🔗open in new window
1143最长公共子序列[✓]字符串 动态规划🟠🀄️open in new window 🔗open in new window
1190反转每对括号间的子串[✓]栈 字符串🟠🀄️open in new window 🔗open in new window
1207独一无二的出现次数[✓]数组 哈希表🟢🀄️open in new window 🔗open in new window
1233删除子文件夹[✓]深度优先搜索 字典树 数组 1+🟠🀄️open in new window 🔗open in new window
1277统计全为 1 的正方形子矩阵[✓]数组 动态规划 矩阵🟠🀄️open in new window 🔗open in new window
1288删除被覆盖区间[✓]数组 排序🟠🀄️open in new window 🔗open in new window
1312让字符串成为回文串的最少插入次数[✓]字符串 动态规划🔴🀄️open in new window 🔗open in new window
1318或运算的最小翻转次数[✓]位运算🟠🀄️open in new window 🔗open in new window
1331数组序号转换[✓]数组 哈希表 排序🟢🀄️open in new window 🔗open in new window
1372二叉树中的最长交错路径[✓]树 深度优先搜索 动态规划 1+🟠🀄️open in new window 🔗open in new window
1381设计一个支持增量操作的栈[✓]栈 设计 数组🟠🀄️open in new window 🔗open in new window
1405最长快乐字符串[✓]贪心 字符串 堆（优先队列）🟠🀄️open in new window 🔗open in new window
1419数青蛙[✓]字符串 计数🟠🀄️open in new window 🔗open in new window
1431拥有最多糖果的孩子[✓]数组🟢🀄️open in new window 🔗open in new window
1441用栈操作构建数组[✓]栈 数组 模拟🟠🀄️open in new window 🔗open in new window
1448统计二叉树中好节点的数目[✓]树 深度优先搜索 广度优先搜索 1+🟠🀄️open in new window 🔗open in new window
1456定长子串中元音的最大数目[✓]字符串 滑动窗口🟠🀄️open in new window 🔗open in new window
1472设计浏览器历史记录[✓]栈 设计 数组 3+🟠🀄️open in new window 🔗open in new window
1475商品折扣后的最终价格[✓]栈 数组 单调栈🟢🀄️open in new window 🔗open in new window
1493删掉一个元素以后全为 1 的最长子数组[✓]数组 动态规划 滑动窗口🟠🀄️open in new window 🔗open in new window
1497检查数组对是否可以被 k 整除[✓]数组 哈希表 计数🟠🀄️open in new window 🔗open in new window
1522N 叉树的直径 🔒[✓]树 深度优先搜索🟠🀄️open in new window 🔗open in new window
1545找出第 N 个二进制字符串中的第 K 位[✓]递归 字符串 模拟🟠🀄️open in new window 🔗open in new window
1574删除最短的子数组使剩余数组有序[✓]栈 数组 双指针 2+🟠🀄️open in new window 🔗open in new window
1590使数组和能被 P 整除[✓]数组 哈希表 前缀和🟠🀄️open in new window 🔗open in new window
1593拆分字符串使唯一子字符串的数目最大[✓]哈希表 字符串 回溯🟠🀄️open in new window 🔗open in new window
1652拆炸弹[✓]数组 滑动窗口🟢🀄️open in new window 🔗open in new window
1657确定两个字符串是否接近[✓]哈希表 字符串 计数 1+🟠🀄️open in new window 🔗open in new window
1671得到山形数组的最少删除次数[✓]贪心 数组 二分查找 1+🔴🀄️open in new window 🔗open in new window
1679K 和数对的最大数目[✓]数组 哈希表 双指针 1+🟠🀄️open in new window 🔗open in new window
1732找到最高海拔[✓]数组 前缀和🟢🀄️open in new window 🔗open in new window
1768交替合并字符串[✓]双指针 字符串🟢🀄️open in new window 🔗open in new window
1813句子相似性 III[✓]数组 双指针 字符串🟠🀄️open in new window 🔗open in new window
1829每个查询的最大异或值[✓]位运算 数组 前缀和🟠🀄️open in new window 🔗open in new window
1942最小未被占据椅子的编号[✓]数组 哈希表 堆（优先队列）🟠🀄️open in new window 🔗open in new window
1957删除字符使字符串变好[✓]字符串🟢🀄️open in new window 🔗open in new window
1963使字符串平衡的最小交换次数[✓]栈 贪心 双指针 1+🟠🀄️open in new window 🔗open in new window
2044统计按位或能得到最大值的子集数目[✓]位运算 数组 回溯 1+🟠🀄️open in new window 🔗open in new window
2064分配给商店的最多商品的最小值[✓]数组 二分查找🟠🀄️open in new window 🔗open in new window
2070每一个查询的最大美丽值[✓]数组 二分查找 排序🟠🀄️open in new window 🔗open in new window
2095删除链表的中间节点[✓]链表 双指针🟠🀄️open in new window 🔗open in new window
2130链表最大孪生和[✓]栈 链表 双指针🟠🀄️open in new window 🔗open in new window
2196根据描述创建二叉树[✓]树 数组 哈希表 1+🟠🀄️open in new window 🔗open in new window
2215找出两数组的不同[✓]数组 哈希表🟢🀄️open in new window 🔗open in new window
2259移除指定数字得到的最大结果[✓]贪心 字符串 枚举🟢🀄️open in new window 🔗open in new window
2260必须拿起的最小连续卡牌数[✓]数组 哈希表 滑动窗口🟠🀄️open in new window 🔗open in new window
2261含最多 K 个可整除元素的子数组[✓]字典树 数组 哈希表 3+🟠🀄️open in new window 🔗open in new window
2262字符串的总引力[✓]哈希表 字符串 动态规划🔴🀄️open in new window 🔗open in new window
2275按位与结果大于零的最长组合[✓]位运算 数组 哈希表 1+🟠🀄️open in new window 🔗open in new window
2352相等行列对[✓]数组 哈希表 矩阵 1+🟠🀄️open in new window 🔗open in new window
2390从字符串中移除星号[✓]栈 字符串 模拟🟠🀄️open in new window 🔗open in new window
2406将区间分为最少组数[✓]贪心 数组 双指针 3+🟠🀄️open in new window 🔗open in new window
2416字符串的前缀分数和[✓]字典树 数组 字符串 1+🔴🀄️open in new window 🔗open in new window
2458移除子树后的二叉树高度[✓]树 深度优先搜索 广度优先搜索 2+🔴🀄️open in new window 🔗open in new window
2461长度为 K 子数组中的最大和[✓]数组 哈希表 滑动窗口🟠🀄️open in new window 🔗open in new window
2463最小移动总距离[✓]数组 动态规划 排序🔴🀄️open in new window 🔗open in new window
2490回环句[✓]字符串🟢🀄️open in new window 🔗open in new window
2491划分技能点相等的团队[✓]数组 哈希表 双指针 1+🟠🀄️open in new window 🔗open in new window
2501数组中最长的方波[✓]数组 哈希表 二分查找 2+🟠🀄️open in new window 🔗open in new window
2516每种字符至少取 K 个[✓]哈希表 字符串 滑动窗口🟠🀄️open in new window 🔗open in new window
2530执行 K 次操作后的最大分数[✓]贪心 数组 堆（优先队列）🟠🀄️open in new window 🔗open in new window
2563统计公平数对的数目[✓]数组 双指针 二分查找 1+🟠🀄️open in new window 🔗open in new window
2583二叉树中的第 K 大层和[✓]树 广度优先搜索 二叉树 1+🟠🀄️open in new window 🔗open in new window
2601质数减法运算[✓]贪心 数组 数学 2+🟠🀄️open in new window 🔗open in new window
2618检查是否是类的对象实例[✓]🟠🀄️open in new window 🔗open in new window
2619数组原型对象的最后一个元素[✓]🟢🀄️open in new window 🔗open in new window
2620计数器[✓]🟢🀄️open in new window 🔗open in new window
2621睡眠函数[✓]🟢🀄️open in new window 🔗open in new window
2622有时间限制的缓存[✓]🟠🀄️open in new window 🔗open in new window
2623记忆函数[✓]🟠🀄️open in new window 🔗open in new window
2624蜗牛排序[✓]🟠🀄️open in new window 🔗open in new window
2625扁平化嵌套数组[✓]🟠🀄️open in new window 🔗open in new window
2626数组归约运算[✓]🟢🀄️open in new window 🔗open in new window
2627函数防抖[✓]🟠🀄️open in new window 🔗open in new window
2628完全相等的 JSON 字符串 🔒[✓]🟠🀄️open in new window 🔗open in new window
2629复合函数[✓]🟢🀄️open in new window 🔗open in new window
2630记忆函数 II[✓]🔴🀄️open in new window 🔗open in new window
2631分组[✓]🟠🀄️open in new window 🔗open in new window
2632柯里化 🔒[✓]🟠🀄️open in new window 🔗open in new window
2633将对象转换为 JSON 字符串 🔒[✓]🟠🀄️open in new window 🔗open in new window
2634过滤数组中的元素[✓]🟢🀄️open in new window 🔗open in new window
2635转换数组中的每个元素[✓]🟢🀄️open in new window 🔗open in new window
2636Promise 对象池 🔒[✓]🟠🀄️open in new window 🔗open in new window
2637有时间限制的 Promise 对象[✓]🟠🀄️open in new window 🔗open in new window
2641二叉树的堂兄弟节点 II[✓]树 深度优先搜索 广度优先搜索 2+🟠🀄️open in new window 🔗open in new window
2648生成斐波那契数列[✓]🟢🀄️open in new window 🔗open in new window
2649嵌套数组生成器[✓]🟠🀄️open in new window 🔗open in new window
2650设计可取消函数[✓]🔴🀄️open in new window 🔗open in new window
2665计数器 II[✓]🟢🀄️open in new window 🔗open in new window
2666只允许一次函数调用[✓]🟢🀄️open in new window 🔗open in new window
2667创建 Hello World 函数[✓]🟢🀄️open in new window 🔗open in new window
2675将对象数组转换为矩阵 🔒[✓]🔴🀄️open in new window 🔗open in new window
2676节流 🔒[✓]🟠🀄️open in new window 🔗open in new window
2677分块数组[✓]🟢🀄️open in new window 🔗open in new window
2684矩阵中移动的最大次数[✓]数组 动态规划 矩阵🟠🀄️open in new window 🔗open in new window
2690无穷方法对象 🔒[✓]🟢🀄️open in new window 🔗open in new window
2691不可变辅助工具 🔒[✓]🔴🀄️open in new window 🔗open in new window
2692使对象不可变 🔒[✓]🟠🀄️open in new window 🔗open in new window
2693使用自定义上下文调用函数[✓]🟠🀄️open in new window 🔗open in new window
2694事件发射器[✓]🟠🀄️open in new window 🔗open in new window
2695包装数组[✓]🟢🀄️open in new window 🔗open in new window
2696删除子串后的字符串最小长度[✓]栈 字符串 模拟🟢🀄️open in new window 🔗open in new window
2700两个对象之间的差异 🔒[✓]🟠🀄️open in new window 🔗open in new window
2703返回传递的参数的长度[✓]🟢🀄️open in new window 🔗open in new window
2704相等还是不相等[✓]🟢🀄️open in new window 🔗open in new window
2705精简对象[✓]🟠🀄️open in new window 🔗open in new window
2715执行可取消的延迟函数[✓]🟢🀄️open in new window 🔗open in new window
2721并行执行异步函数[✓]🟠🀄️open in new window 🔗open in new window
2722根据 ID 合并两个数组[✓]🟠🀄️open in new window 🔗open in new window
2723两个 Promise 对象相加[✓]🟢🀄️open in new window 🔗open in new window
2724排序方式[✓]🟢🀄️open in new window 🔗open in new window
2725间隔取消[✓]🟢🀄️open in new window 🔗open in new window
2726使用方法链的计算器[✓]🟢🀄️open in new window 🔗open in new window
2727判断对象是否为空[✓]🟢🀄️open in new window 🔗open in new window
2740找出分区值[✓]数组 排序🟠🀄️open in new window 🔗open in new window
2754将函数绑定到上下文 🔒[✓]🟠🀄️open in new window 🔗open in new window
2755深度合并两个对象 🔒[✓]🟠🀄️open in new window 🔗open in new window
2756批处理查询 🔒[✓]🔴🀄️open in new window 🔗open in new window
2757生成循环数组的值 🔒[✓]🟠🀄️open in new window 🔗open in new window
2758下一天 🔒[✓]🟢🀄️open in new window 🔗open in new window
2759将 JSON 字符串转换为对象 🔒[✓]🔴🀄️open in new window 🔗open in new window
2774数组的上界 🔒[✓]🟢🀄️open in new window 🔗open in new window
2775将 undefined 转为 null 🔒[✓]🟠🀄️open in new window 🔗open in new window
2776转换回调函数为 Promise 函数 🔒[✓]🟠🀄️open in new window 🔗open in new window
2777日期范围生成器 🔒[✓]🟠🀄️open in new window 🔗open in new window
2794从两个数组中创建对象 🔒[✓]🟢🀄️open in new window 🔗open in new window
2795并行执行 Promise 以获取独有的结果 🔒[✓]🟠🀄️open in new window 🔗open in new window
2796重复字符串 🔒[✓]🟢🀄️open in new window 🔗open in new window
2797带有占位符的部分函数 🔒[✓]🟢🀄️open in new window 🔗open in new window
2803阶乘生成器 🔒[✓]🟢🀄️open in new window 🔗open in new window
2804数组原型的 forEach 方法 🔒[✓]🟢🀄️open in new window 🔗open in new window
2805自定义间隔 🔒[✓]🟠🀄️open in new window 🔗open in new window
2821延迟每个 Promise 对象的解析 🔒[✓]🟠🀄️open in new window 🔗open in new window
2822对象反转 🔒[✓]🟢🀄️open in new window 🔗open in new window
2823深度对象筛选 🔒[✓]🟠🀄️open in new window 🔗open in new window
2914使二进制字符串变美丽的最少修改次数[✓]字符串🟠🀄️open in new window 🔗open in new window
2938区分黑球与白球[✓]贪心 双指针 字符串🟠🀄️open in new window 🔗open in new window
3011判断一个数组是否可以变为有序[✓]位运算 数组 排序🟠🀄️open in new window 🔗open in new window
3097或值至少为 K 的最短子数组 II[✓]位运算 数组 滑动窗口🟠🀄️open in new window 🔗open in new window
3133数组最后一个元素的最小值[✓]位运算🟠🀄️open in new window 🔗open in new window
3136有效单词[✓]字符串🟢🀄️open in new window 🔗open in new window
3163压缩字符串 III[✓]字符串🟠🀄️open in new window 🔗open in new window
3309连接二进制表示可形成的最大数值[✓]位运算 数组 枚举🟠🀄️open in new window 🔗open in new window
3318计算子数组的 x-sum I[✓]数组 哈希表 滑动窗口 1+🟢🀄️open in new window 🔗open in new window
3319第 K 大的完美二叉子树的大小[✓]树 深度优先搜索 二叉树 1+🟠🀄️open in new window 🔗open in new window
3321计算子数组的 x-sum II[✓]数组 哈希表 滑动窗口 1+🔴🀄️open in new window 🔗open in new window
Copyright © 2024 2xiao