| 2172 |
数组的最大与和 |
[位运算] [数组] [动态规划] [状态压缩] |
Hard |
| 2171 |
拿出最少数目的魔法豆 |
[数组] [前缀和] [排序] |
Medium |
| 2170 |
使数组变成交替数组的最少操作数 |
[贪心] [数组] [哈希表] [计数] |
Medium |
| 2166 |
设计位集 |
[设计] [数组] [哈希表] |
Medium |
| 2164 |
对奇偶下标分别排序 |
[数组] [排序] |
Easy |
| 2163 |
删除元素后和的最小差值 |
[数组] [动态规划] [堆（优先队列）] |
Hard |
| 2161 |
根据给定数字划分数组 |
[数组] [双指针] [模拟] |
Medium |
| 2158 |
Amount of New Area Painted Each Day 🔒 |
[线段树] [数组] [有序集合] |
Hard |
| 2155 |
分组得分最高的所有下标 |
[数组] |
Medium |
| 2154 |
将找到的值乘以 2 |
[数组] [哈希表] [排序] [模拟] |
Easy |
| 2152 |
Minimum Number of Lines to Cover Points 🔒 |
[位运算] [几何] [数组] [哈希表] [数学] [动态规划] [回溯] [状态压缩] |
Medium |
| 2151 |
基于陈述统计最多好人数 |
[位运算] [数组] [回溯] [枚举] |
Hard |
| 2150 |
找出数组中的所有孤独数字 |
[数组] [哈希表] [计数] |
Medium |
| 2149 |
按符号重排数组 |
[数组] [双指针] [模拟] |
Medium |
| 2148 |
元素计数 |
[数组] [排序] |
Easy |
| 2146 |
价格范围内最高排名的 K 样物品 |
[广度优先搜索] [数组] [矩阵] [排序] [堆（优先队列）] |
Medium |
| 2145 |
统计隐藏数组数目 |
[数组] [前缀和] |
Medium |
| 2144 |
打折购买糖果的最小开销 |
[贪心] [数组] [排序] |
Easy |
| 2143 |
Choose Numbers From Two Arrays in Range 🔒 |
[数组] [动态规划] |
Hard |
| 2141 |
同时运行 N 台电脑的最长时间 |
[贪心] [数组] [二分查找] [排序] |
Hard |
| 2140 |
解决智力问题 |
[数组] [动态规划] |
Medium |
| 2137 |
Pour Water Between Buckets to Make Water Levels Equal 🔒 |
[数组] [二分查找] |
Medium |
| 2136 |
全部开花的最早一天 |
[贪心] [数组] [排序] |
Hard |
| 2135 |
统计追加字母可以获得的单词数 |
[位运算] [数组] [哈希表] [字符串] [排序] |
Medium |
| 2134 |
最少交换次数来组合所有的 1 II |
[数组] [滑动窗口] |
Medium |
| 2133 |
检查是否每一行每一列都包含全部整数 |
[数组] [哈希表] [矩阵] |
Easy |
| 2132 |
用邮票贴满网格图 |
[贪心] [数组] [矩阵] [前缀和] |
Hard |
| 2131 |
连接两字母单词得到的最长回文串 |
[贪心] [数组] [哈希表] [字符串] [计数] |
Medium |
| 2128 |
Remove All Ones With Row and Column Flips 🔒 |
[位运算] [数组] [数学] [矩阵] |
Medium |
| 2126 |
摧毁小行星 |
[贪心] [数组] [排序] |
Medium |
| 2125 |
银行中的激光束数量 |
[数组] [数学] [字符串] [矩阵] |
Medium |
| 2123 |
Minimum Operations to Remove Adjacent Ones in Matrix 🔒 |
[图] [数组] [矩阵] |
Hard |
| 2122 |
还原原数组 |
[数组] [哈希表] [枚举] [排序] |
Hard |
| 2121 |
相同元素的间隔之和 |
[数组] [哈希表] [前缀和] |
Medium |
| 2115 |
从给定原材料中找到所有可以做出的菜 |
[图] [拓扑排序] [数组] [哈希表] [字符串] |
Medium |
| 2114 |
句子中的最多单词数 |
[数组] [字符串] |
Easy |
| 2113 |
Elements in Array After Removing and Replacing Elements 🔒 |
[数组] |
Medium |
| 2111 |
使数组 K 递增的最少操作次数 |
[数组] [二分查找] |
Hard |
| 2110 |
股票平滑下跌阶段的数目 |
[数组] [数学] [动态规划] |
Medium |
| 2109 |
向字符串添加空格 |
[数组] [字符串] [模拟] |
Medium |
| 2108 |
找出数组中的第一个回文字符串 |
[数组] [双指针] [字符串] |
Easy |
| 2107 |
Number of Unique Flavors After Sharing K Candies 🔒 |
[数组] [哈希表] [滑动窗口] |
Medium |
| 2106 |
摘水果 |
[数组] [二分查找] [前缀和] [滑动窗口] |
Hard |
| 2105 |
给植物浇水 II |
[数组] [双指针] [模拟] |
Medium |
| 2104 |
子数组范围和 |
[栈] [数组] [单调栈] |
Medium |
| 2101 |
引爆最多的炸弹 |
[深度优先搜索] [广度优先搜索] [图] [几何] [数组] [数学] |
Medium |
| 2100 |
适合打劫银行的日子 |
[数组] [动态规划] [前缀和] |
Medium |
| 2099 |
找到和最大的长度为 K 的子序列 |
[数组] [哈希表] [排序] [堆（优先队列）] |
Easy |
| 2098 |
Subsequence of Size K With the Largest Even Sum 🔒 |
[贪心] [数组] [排序] |
Medium |
| 2094 |
找出 3 位偶数 |
[数组] [哈希表] [枚举] [排序] |
Easy |
| 2091 |
从数组中移除最大值和最小值 |
[贪心] [数组] |
Medium |
| 2090 |
半径为 k 的子数组平均值 |
[数组] [滑动窗口] |
Medium |
| 2089 |
找出数组排序后的目标下标 |
[数组] [二分查找] [排序] |
Easy |
| 2088 |
统计农场中肥沃金字塔的数目 |
[数组] [动态规划] [矩阵] |
Hard |
| 2087 |
网格图中机器人回家的最小代价 |
[贪心] [数组] [矩阵] |
Medium |
| 2085 |
统计出现过一次的公共字符串 |
[数组] [哈希表] [字符串] [计数] |
Easy |
| 2080 |
区间内查询数字的频率 |
[设计] [线段树] [数组] [哈希表] [二分查找] |
Medium |
| 2079 |
给植物浇水 |
[数组] |
Medium |
| 2078 |
两栋颜色不同且距离最远的房子 |
[贪心] [数组] |
Easy |
| 2073 |
买票需要的时间 |
[队列] [数组] [模拟] |
Easy |
| 2071 |
你可以安排的最多任务数目 |
[贪心] [队列] [数组] [二分查找] [排序] [单调队列] |
Hard |
| 2070 |
每一个查询的最大美丽值 |
[数组] [二分查找] [排序] |
Medium |
| 2065 |
最大化一张图中的路径价值 |
[图] [数组] [回溯] |
Hard |
| 2064 |
分配给商店的最多商品的最小值 |
[数组] [二分查找] |
Medium |
| 2061 |
扫地机器人清扫过的空间个数 🔒 |
[数组] [矩阵] [模拟] |
Medium |
| 2059 |
转化数字的最小运算数 |
[广度优先搜索] [数组] |
Medium |
| 2057 |
值相等的最小索引 |
[数组] |
Easy |
| 2056 |
棋盘上有效移动组合的数目 |
[数组] [字符串] [回溯] [模拟] |
Hard |
| 2055 |
蜡烛之间的盘子 |
[数组] [字符串] [二分查找] [前缀和] |
Medium |
| 2054 |
两个最好的不重叠活动 |
[数组] [二分查找] [动态规划] [排序] [堆（优先队列）] |
Medium |
| 2053 |
数组中第 K 个独一无二的字符串 |
[数组] [哈希表] [字符串] [计数] |
Easy |
| 2052 |
将句子分隔成行的最低成本 🔒 |
[数组] [动态规划] |
Medium |
| 2049 |
统计最高分的节点数目 |
[树] [深度优先搜索] [数组] [二叉树] |
Medium |
| 2044 |
统计按位或能得到最大值的子集数目 |
[位运算] [数组] [回溯] |
Medium |
| 2043 |
简易银行系统 |
[设计] [数组] [哈希表] [模拟] |
Medium |
| 2040 |
两个有序数组的第 K 小乘积 |
[数组] [二分查找] |
Hard |
| 2039 |
网络空闲的时刻 |
[广度优先搜索] [图] [数组] |
Medium |
| 2037 |
使每位学生都有座位的最少移动次数 |
[数组] [排序] |
Easy |
| 2036 |
最大交替子数组和 🔒 |
[数组] [动态规划] |
Medium |
| 2035 |
将数组分成两个数组并最小化数组和的差 |
[位运算] [数组] [双指针] [二分查找] [动态规划] [状态压缩] [有序集合] |
Hard |
| 2033 |
获取单值网格的最小操作数 |
[数组] [数学] [矩阵] [排序] |
Medium |
| 2032 |
至少在两个数组中出现的值 |
[数组] [哈希表] |
Easy |
| 2031 |
1 比 0 多的子数组个数 🔒 |
[树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] |
Medium |
| 2029 |
石子游戏 IX |
[贪心] [数组] [数学] [计数] [博弈] |
Medium |
| 2028 |
找出缺失的观测数据 |
[数组] [数学] [模拟] |
Medium |
| 2025 |
分割数组的最多方案数 |
[数组] [哈希表] [计数] [枚举] [前缀和] |
Hard |
| 2023 |
连接后等于目标字符串的字符串对 |
[数组] [字符串] |
Medium |
| 2022 |
将一维数组转变成二维数组 |
[数组] [矩阵] [模拟] |
Easy |
| 2021 |
街上最亮的位置 🔒 |
[数组] [有序集合] [前缀和] |
Medium |
| 2019 |
解出数学表达式的学生分数 |
[栈] [记忆化搜索] [数组] [数学] [字符串] [动态规划] |
Hard |
| 2018 |
判断单词是否能放入填字游戏内 |
[数组] [枚举] [矩阵] |
Medium |
| 2017 |
网格游戏 |
[数组] [矩阵] [前缀和] |
Medium |
| 2016 |
增量元素之间的最大差值 |
[数组] |
Easy |
| 2015 |
Average Height of Buildings in Each Segment 🔒 |
[贪心] [数组] [排序] [堆（优先队列）] |
Medium |
| 2013 |
检测正方形 |
[设计] [数组] [哈希表] [计数] |
Medium |
| 2012 |
数组美丽值求和 |
[数组] |
Medium |
| 2011 |
执行操作后的变量值 |
[数组] [字符串] [模拟] |
Easy |
| 2009 |
使数组连续的最少操作数 |
[数组] [二分查找] |
Hard |
| 2008 |
出租车的最大盈利 |
[数组] [二分查找] [动态规划] [排序] |
Medium |
| 2007 |
从双倍数组中还原原数组 |
[贪心] [数组] [哈希表] [排序] |
Medium |
| 2006 |
差的绝对值为 K 的数对数目 |
[数组] [哈希表] [计数] |
Easy |
| 2001 |
可互换矩形的组数 |
[数组] [哈希表] [数学] [计数] [数论] |
Medium |
| 1998 |
数组的最大公因数排序 |
[并查集] [数组] [数学] [排序] |
Hard |
| 1997 |
访问完所有房间的第一天 |
[数组] [动态规划] |
Medium |
| 1996 |
游戏中弱角色的数量 |
[栈] [贪心] [数组] [排序] [单调栈] |
Medium |
| 1995 |
统计特殊四元组 |
[数组] [枚举] |
Easy |
| 1994 |
好子集的数目 |
[位运算] [数组] [数学] [动态规划] [状态压缩] |
Hard |
| 1992 |
找到所有的农场组 |
[深度优先搜索] [广度优先搜索] [数组] [矩阵] |
Medium |
| 1991 |
找到数组的中间位置 |
[数组] [前缀和] |
Easy |
| 1986 |
完成任务的最少工作时间段 |
[位运算] [数组] [动态规划] [回溯] [状态压缩] |
Medium |
| 1985 |
找出数组中的第 K 大整数 |
[数组] [字符串] [分治] [快速选择] [排序] [堆（优先队列）] |
Medium |
| 1984 |
学生分数的最小差值 |
[数组] [排序] [滑动窗口] |
Easy |
| 1982 |
从子集的和还原数组 |
[数组] [分治] |
Hard |
| 1981 |
最小化目标值与所选元素的差 |
[数组] [动态规划] [矩阵] |
Medium |
| 1980 |
找出不同的二进制字符串 |
[数组] [字符串] [回溯] |
Medium |
| 1979 |
找出数组的最大公约数 |
[数组] [数学] |
Easy |
| 1975 |
最大方阵和 |
[贪心] [数组] [矩阵] |
Medium |
| 1970 |
你能穿过矩阵的最后一天 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [二分查找] [矩阵] |
Hard |
| 1968 |
构造元素不等于两相邻元素平均值的数组 |
[贪心] [数组] [排序] |
Medium |
| 1964 |
找出到每个位置为止最长的有效障碍赛跑路线 |
[树状数组] [数组] [二分查找] |
Hard |
| 1962 |
移除石子使总数最小 |
[数组] [堆（优先队列）] |
Medium |
| 1961 |
检查字符串是否为数组前缀 |
[数组] [字符串] |
Easy |
| 1959 |
K 次调整数组大小浪费的最小总空间 |
[数组] [动态规划] |
Medium |
| 1958 |
检查操作是否合法 |
[数组] [枚举] [矩阵] |
Medium |
| 1956 |
感染 K 种病毒所需的最短时间 🔒 |
[几何] [数组] [数学] [二分查找] [枚举] |
Hard |
| 1955 |
统计特殊子序列的数目 |
[数组] [动态规划] |
Hard |
| 1953 |
你可以工作的最大周数 |
[贪心] [数组] |
Medium |
| 1950 |
所有子数组最小值中的最大值 🔒 |
[栈] [数组] [单调栈] |
Medium |
| 1948 |
删除系统中的重复文件夹 |
[字典树] [数组] [哈希表] [字符串] [哈希函数] |
Hard |
| 1947 |
最大兼容性评分和 |
[位运算] [数组] [动态规划] [回溯] [状态压缩] |
Medium |
| 1946 |
子字符串突变后可能得到的最大整数 |
[贪心] [数组] [字符串] |
Medium |
| 1944 |
队列中可以看到的人数 |
[栈] [数组] [单调栈] |
Hard |
| 1943 |
描述绘画结果 |
[数组] [前缀和] |
Medium |
| 1942 |
最小未被占据椅子的编号 |
[数组] [有序集合] [堆（优先队列）] |
Medium |
| 1940 |
排序数组之间的最长公共子序列 🔒 |
[数组] [哈希表] [计数] |
Medium |
| 1936 |
新增的最少台阶数 |
[贪心] [数组] |
Medium |
| 1929 |
数组串联 |
[数组] |
Easy |
| 1926 |
迷宫中离入口最近的出口 |
[广度优先搜索] [数组] [矩阵] |
Medium |
| 1924 |
安装栅栏 II 🔒 |
[几何] [数组] [数学] |
Hard |
| 1923 |
最长公共子路径 |
[数组] [二分查找] [后缀数组] [哈希函数] [滚动哈希] |
Hard |
| 1921 |
消灭怪物的最大数量 |
[贪心] [数组] [排序] |
Medium |
| 1920 |
基于排列构建数组 |
[数组] [模拟] |
Easy |
| 1918 |
第 K 小的子数组和· 🔒 |
[数组] [二分查找] [滑动窗口] |
Medium |
| 1914 |
循环轮转矩阵 |
[数组] [矩阵] [模拟] |
Medium |
| 1913 |
两个数对之间的最大乘积差 |
[数组] [排序] |
Easy |
| 1912 |
设计电影租借系统 |
[设计] [数组] [哈希表] [有序集合] [堆（优先队列）] |
Hard |
| 1911 |
最大子序列交替和 |
[数组] [动态规划] |
Medium |
| 1909 |
删除一个元素使数组严格递增 |
[数组] |
Easy |
| 1908 |
Nim 游戏 II 🔒 |
[位运算] [脑筋急转弯] [数组] [数学] [动态规划] [博弈] |
Medium |
| 1906 |
查询差绝对值的最小值 |
[数组] [哈希表] |
Medium |
| 1905 |
统计子岛屿 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 1901 |
找出顶峰元素 II |
[数组] [二分查找] [分治] [矩阵] |
Medium |
| 1899 |
合并若干三元组以形成目标三元组 |
[贪心] [数组] |
Medium |
| 1898 |
可移除字符的最大数目 |
[数组] [字符串] [二分查找] |
Medium |
| 1895 |
最大的幻方 |
[数组] [矩阵] [前缀和] |
Medium |
| 1894 |
找到需要补充粉笔的学生编号 |
[数组] [二分查找] [前缀和] [模拟] |
Medium |
| 1893 |
检查是否区域内所有整数都被覆盖 |
[数组] [哈希表] [前缀和] |
Easy |
| 1891 |
割绳子 🔒 |
[数组] [二分查找] |
Medium |
| 1889 |
装包裹的最小浪费空间 |
[数组] [二分查找] [前缀和] [排序] |
Hard |
| 1887 |
使数组元素相等的减少操作次数 |
[数组] [排序] |
Medium |
| 1886 |
判断矩阵经轮转后是否一致 |
[数组] [矩阵] |
Easy |
| 1885 |
统计数对 🔒 |
[数组] [二分查找] [排序] |
Medium |
| 1883 |
准时抵达会议现场的最小跳过休息次数 |
[数组] [动态规划] |
Hard |
| 1882 |
使用服务器处理任务 |
[数组] [堆（优先队列）] |
Medium |
| 1879 |
两个数组最小的异或值之和 |
[位运算] [数组] [动态规划] [状态压缩] |
Hard |
| 1878 |
矩阵中最大的三个菱形和 |
[数组] [数学] [矩阵] [前缀和] [排序] [堆（优先队列）] |
Medium |
| 1877 |
数组中最大数对和的最小值 |
[贪心] [数组] [双指针] [排序] |
Medium |
| 1874 |
两个数组的最小乘积和 🔒 |
[贪心] [数组] [排序] |
Medium |
| 1872 |
石子游戏 VIII |
[数组] [数学] [动态规划] [博弈] [前缀和] |
Hard |
| 1870 |
准时到达的列车最小时速 |
[数组] [二分查找] |
Medium |
| 1868 |
两个行程编码数组的积 🔒 |
[数组] [双指针] |
Medium |
| 1865 |
找出和为指定值的下标对 |
[设计] [数组] [哈希表] |
Medium |
| 1863 |
找出所有子集的异或总和再求和 |
[位运算] [数组] [数学] [回溯] [组合数学] |
Easy |
| 1862 |
向下取整数对和 |
[数组] [数学] [二分查找] [前缀和] |
Hard |
| 1861 |
旋转盒子 |
[数组] [双指针] [矩阵] |
Medium |
| 1856 |
子数组最小乘积的最大值 |
[栈] [数组] [前缀和] [单调栈] |
Medium |
| 1855 |
下标对中的最大距离 |
[贪心] [数组] [双指针] [二分查找] |
Medium |
| 1854 |
人口最多的年份 |
[数组] [计数] |
Easy |
| 1852 |
每个子数组的数字种类数 🔒 |
[数组] [哈希表] [滑动窗口] |
Medium |
| 1851 |
包含每个查询的最小区间 |
[数组] [二分查找] [排序] [扫描线] [堆（优先队列）] |
Hard |
| 1848 |
到目标元素的最小距离 |
[数组] |
Easy |
| 1847 |
最近的房间 |
[数组] [二分查找] [排序] |
Hard |
| 1846 |
减小和重新排列数组后的最大元素 |
[贪心] [数组] [排序] |
Medium |
| 1840 |
最高建筑高度 |
[数组] [数学] |
Hard |
| 1838 |
最高频元素的频数 |
[数组] [二分查找] [前缀和] [滑动窗口] |
Medium |
| 1835 |
所有数对按位与结果的异或和 |
[位运算] [数组] [数学] |
Hard |
| 1834 |
单线程 CPU |
[数组] [排序] [堆（优先队列）] |
Medium |
| 1833 |
雪糕的最大数量 |
[贪心] [数组] [排序] |
Medium |
| 1829 |
每个查询的最大异或值 |
[位运算] [数组] [前缀和] |
Medium |
| 1828 |
统计一个圆中点的数目 |
[几何] [数组] [数学] |
Medium |
| 1827 |
最少操作使数组递增 |
[贪心] [数组] |
Easy |
| 1826 |
有缺陷的传感器 🔒 |
[数组] [双指针] |
Easy |
| 1824 |
最少侧跳次数 |
[贪心] [数组] [动态规划] |
Medium |
| 1823 |
找出游戏的获胜者 |
[递归] [队列] [数组] [数学] [模拟] |
Medium |
| 1822 |
数组元素积的符号 |
[数组] [数学] |
Easy |
| 1820 |
最多邀请的个数 🔒 |
[数组] [回溯] [矩阵] |
Medium |
| 1819 |
序列中不同最大公约数的数目 |
[数组] [数学] [计数] [数论] |
Hard |
| 1818 |
绝对差值和 |
[数组] [二分查找] [有序集合] [排序] |
Medium |
| 1817 |
查找用户活跃分钟数 |
[数组] [哈希表] |
Medium |
| 1816 |
截断句子 |
[数组] [字符串] |
Easy |
| 1815 |
得到新鲜甜甜圈的最多组数 |
[位运算] [记忆化搜索] [数组] [动态规划] [状态压缩] |
Hard |
| 1814 |
统计一个数组中好对子的数目 |
[数组] [哈希表] [数学] [计数] |
Medium |
| 1813 |
句子相似性 III |
[数组] [双指针] [字符串] |
Medium |
| 1807 |
替换字符串中的括号内容 |
[数组] [哈希表] [字符串] |
Medium |
| 1806 |
还原排列的最少操作步数 |
[数组] [数学] [模拟] |
Medium |
| 1803 |
统计异或值在范围内的数对有多少 |
[位运算] [字典树] [数组] |
Hard |
| 1801 |
积压订单中的订单总数 |
[数组] [模拟] [堆（优先队列）] |
Medium |
| 1800 |
最大升序子数组和 |
[数组] |
Easy |
| 1799 |
N 次操作后的最大分数和 |
[位运算] [数组] [数学] [动态规划] [回溯] [状态压缩] [数论] |
Hard |
| 1798 |
你能构造出连续值的最大数目 |
[贪心] [数组] |
Medium |
| 1793 |
好子数组的最大分数 |
[栈] [数组] [双指针] [二分查找] [单调栈] |
Hard |
| 1792 |
最大平均通过率 |
[贪心] [数组] [堆（优先队列）] |
Medium |
| 1788 |
最大化花园的美观度 🔒 |
[贪心] [数组] [前缀和] |
Hard |
| 1787 |
使所有区间的异或结果为零 |
[位运算] [数组] [动态规划] |
Hard |
| 1785 |
构成特定和需要添加的最少元素 |
[贪心] [数组] |
Medium |
| 1779 |
找到最近的有相同 X 或 Y 坐标的点 |
[数组] |
Easy |
| 1776 |
车队 II |
[栈] [数组] [数学] [单调栈] [堆（优先队列）] |
Hard |
| 1775 |
通过最少操作次数使数组的和相等 |
[贪心] [数组] [哈希表] [计数] |
Medium |
| 1774 |
最接近目标价格的甜点成本 |
[数组] [动态规划] [回溯] |
Medium |
| 1773 |
统计匹配检索规则的物品数量 |
[数组] [字符串] |
Easy |
| 1772 |
按受欢迎程度排列功能 🔒 |
[数组] [哈希表] [字符串] [排序] |
Medium |
| 1770 |
执行乘法运算的最大分数 |
[数组] [动态规划] |
Medium |
| 1769 |
移动所有球到每个盒子所需的最小操作数 |
[数组] [字符串] |
Medium |
| 1765 |
地图中的最高点 |
[广度优先搜索] [数组] [矩阵] |
Medium |
| 1764 |
通过连接另一个数组的子数组得到一个数组 |
[贪心] [数组] [字符串匹配] |
Medium |
| 1762 |
能看到海景的建筑物 🔒 |
[栈] [数组] [单调栈] |
Medium |
| 1760 |
袋子里最少数目的球 |
[数组] [二分查找] |
Medium |
| 1756 |
设计最近使用（MRU）队列 🔒 |
[栈] [设计] [树状数组] [数组] [哈希表] [有序集合] |
Medium |
| 1755 |
最接近目标值的子序列和 |
[位运算] [数组] [双指针] [动态规划] [状态压缩] |
Hard |
| 1752 |
检查数组是否经排序和轮转得到 |
[数组] |
Easy |
| 1751 |
最多可以参加的会议数目 II |
[数组] [二分查找] [动态规划] |
Hard |
| 1749 |
任意子数组和的绝对值的最大值 |
[数组] [动态规划] |
Medium |
| 1748 |
唯一元素的和 |
[数组] [哈希表] [计数] |
Easy |
| 1746 |
经过一次操作后的最大子数组和 🔒 |
[数组] [动态规划] |
Medium |
| 1744 |
你能在你最喜欢的那天吃到你最喜欢的糖果吗？ |
[数组] [前缀和] |
Medium |
| 1743 |
从相邻元素对还原数组 |
[数组] [哈希表] |
Medium |
| 1738 |
找出第 K 大的异或坐标值 |
[位运算] [数组] [分治] [矩阵] [前缀和] [快速选择] [堆（优先队列）] |
Medium |
| 1735 |
生成乘积数组的方案数 |
[数组] [数学] [动态规划] |
Hard |
| 1734 |
解码异或后的排列 |
[位运算] [数组] |
Medium |
| 1733 |
需要教语言的最少人数 |
[贪心] [数组] |
Medium |
| 1732 |
找到最高海拔 |
[数组] [前缀和] |
Easy |
| 1730 |
获取食物的最短路径 🔒 |
[广度优先搜索] [数组] [矩阵] |
Medium |
| 1727 |
重新排列后的最大子矩阵 |
[贪心] [数组] [矩阵] [排序] |
Medium |
| 1726 |
同积元组 |
[数组] [哈希表] |
Medium |
| 1725 |
可以形成最大正方形的矩形数目 |
[数组] |
Easy |
| 1723 |
完成所有工作的最短时间 |
[位运算] [数组] [动态规划] [回溯] [状态压缩] |
Hard |
| 1722 |
执行交换操作后的最小汉明距离 |
[深度优先搜索] [并查集] [数组] |
Medium |
| 1720 |
解码异或后的数组 |
[位运算] [数组] |
Easy |
| 1718 |
构建字典序最大的可行序列 |
[数组] [回溯] |
Medium |
| 1714 |
数组中特殊等间距元素的和 🔒 |
[数组] [动态规划] |
Hard |
| 1713 |
得到子序列的最少操作次数 |
[贪心] [数组] [哈希表] [二分查找] |
Hard |
| 1712 |
将数组分成三个子数组的方案数 |
[数组] [双指针] [二分查找] [前缀和] |
Medium |
| 1711 |
大餐计数 |
[数组] [哈希表] |
Medium |
| 1710 |
卡车上的最大单元数 |
[贪心] [数组] [排序] |
Easy |
| 1708 |
长度为 K 的最大子数组 🔒 |
[贪心] [数组] |
Easy |
| 1707 |
与数组中元素的最大异或值 |
[位运算] [字典树] [数组] |
Hard |
| 1706 |
球会落何处 |
[深度优先搜索] [数组] [动态规划] [矩阵] [模拟] |
Medium |
| 1705 |
吃苹果的最大数目 |
[贪心] [数组] [堆（优先队列）] |
Medium |
| 1703 |
得到连续 K 个 1 的最少相邻交换次数 |
[贪心] [数组] [前缀和] [滑动窗口] |
Hard |
| 1701 |
平均等待时间 |
[数组] [模拟] |
Medium |
| 1700 |
无法吃午餐的学生数量 |
[栈] [队列] [数组] [模拟] |
Easy |
| 1697 |
检查边长度限制的路径是否存在 |
[并查集] [图] [数组] [排序] |
Hard |
| 1696 |
跳跃游戏 VI |
[队列] [数组] [动态规划] [滑动窗口] [单调队列] [堆（优先队列）] |
Medium |
| 1695 |
删除子数组的最大得分 |
[数组] [哈希表] [滑动窗口] |
Medium |
| 1691 |
堆叠长方体的最大高度 |
[数组] [动态规划] [排序] |
Hard |
| 1690 |
石子游戏 VII |
[数组] [数学] [动态规划] [博弈] |
Medium |
| 1687 |
从仓库到码头运输箱子 |
[线段树] [队列] [数组] [动态规划] [单调队列] [堆（优先队列）] |
Hard |
| 1686 |
石子游戏 VI |
[贪心] [数组] [数学] [博弈] [排序] [堆（优先队列）] |
Medium |
| 1685 |
有序数组中差绝对值之和 |
[数组] [数学] [前缀和] |
Medium |
| 1684 |
统计一致字符串的数目 |
[位运算] [数组] [哈希表] [字符串] |
Easy |
| 1681 |
最小不兼容性 |
[位运算] [数组] [动态规划] [状态压缩] |
Hard |
| 1679 |
K 和数对的最大数目 |
[数组] [哈希表] [双指针] [排序] |
Medium |
| 1675 |
数组的最小偏移量 |
[贪心] [数组] [有序集合] [堆（优先队列）] |
Hard |
| 1674 |
使数组互补的最少操作次数 |
[数组] [哈希表] [前缀和] |
Medium |
| 1673 |
找出最具竞争力的子序列 |
[栈] [贪心] [数组] [单调栈] |
Medium |
| 1672 |
最富有客户的资产总量 |
[数组] [矩阵] |
Easy |
| 1671 |
得到山形数组的最少删除次数 |
[贪心] [数组] [二分查找] [动态规划] |
Hard |
| 1670 |
设计前中后队列 |
[设计] [队列] [数组] [链表] [数据流] |
Medium |
| 1665 |
完成所有任务的最少初始能量 |
[贪心] [数组] [排序] |
Hard |
| 1664 |
生成平衡数组的方案数 |
[数组] [动态规划] |
Medium |
| 1662 |
检查两个字符串数组是否相等 |
[数组] [字符串] |
Easy |
| 1658 |
将 x 减到 0 的最小操作数 |
[数组] [哈希表] [二分查找] [前缀和] [滑动窗口] |
Medium |
| 1656 |
设计有序流 |
[设计] [数组] [哈希表] [数据流] |
Easy |
| 1655 |
分配重复整数 |
[位运算] [数组] [动态规划] [回溯] [状态压缩] |
Hard |
| 1654 |
到家的最少跳跃次数 |
[广度优先搜索] [数组] [动态规划] |
Medium |
| 1652 |
拆炸弹 |
[数组] |
Easy |
| 1649 |
通过指令创建有序数组 |
[树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] |
Hard |
| 1648 |
销售价值减少的颜色球 |
[贪心] [数组] [数学] [二分查找] [排序] [堆（优先队列）] |
Medium |
| 1646 |
获取生成数组中的最大值 |
[数组] [动态规划] [模拟] |
Easy |
| 1643 |
第 K 条最小指令 |
[数组] [数学] [动态规划] [组合数学] |
Hard |
| 1642 |
可以到达的最远建筑 |
[贪心] [数组] [堆（优先队列）] |
Medium |
| 1640 |
能否连接形成数组 |
[数组] [哈希表] |
Easy |
| 1639 |
通过给定词典构造目标字符串的方案数 |
[数组] [字符串] [动态规划] |
Hard |
| 1637 |
两点之间不包含任何点的最宽垂直面积 |
[数组] [排序] |
Medium |
| 1636 |
按照频率将数组升序排序 |
[数组] [哈希表] [排序] |
Easy |
| 1632 |
矩阵转换后的秩 |
[贪心] [并查集] [图] [拓扑排序] [数组] [矩阵] |
Hard |
| 1631 |
最小体力消耗路径 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [二分查找] [矩阵] [堆（优先队列）] |
Medium |
| 1630 |
等差子数组 |
[数组] [排序] |
Medium |
| 1629 |
按键持续时间最长的键 |
[数组] [字符串] |
Easy |
| 1627 |
带阈值的图连通性 |
[并查集] [数组] [数学] |
Hard |
| 1626 |
无矛盾的最佳球队 |
[数组] [动态规划] [排序] |
Medium |
| 1620 |
网络信号最好的坐标 |
[数组] [枚举] |
Medium |
| 1619 |
删除某些元素后的数组均值 |
[数组] [排序] |
Easy |
| 1618 |
找出适应屏幕的最大字号 🔒 |
[数组] [字符串] [二分查找] [交互] |
Medium |
| 1610 |
可见点的最大数目 |
[几何] [数组] [数学] [排序] [滑动窗口] |
Hard |
| 1608 |
特殊数组的特征值 |
[数组] [二分查找] [排序] |
Easy |
| 1606 |
找到处理最多请求的服务器 |
[贪心] [数组] [有序集合] [堆（优先队列）] |
Hard |
| 1605 |
给定行和列的和求可行矩阵 |
[贪心] [数组] [矩阵] |
Medium |
| 1604 |
警告一小时内使用相同员工卡大于等于三次的人 |
[数组] [哈希表] [字符串] [排序] |
Medium |
| 1601 |
最多可达成的换楼请求数目 |
[位运算] [数组] [回溯] [枚举] |
Hard |
| 1599 |
经营摩天轮的最大利润 |
[数组] [模拟] |
Medium |
| 1598 |
文件夹操作日志搜集器 |
[栈] [数组] [字符串] |
Easy |
| 1595 |
连通两组点的最小成本 |
[位运算] [数组] [动态规划] [状态压缩] [矩阵] |
Hard |
| 1594 |
矩阵的最大非负积 |
[数组] [动态规划] [矩阵] |
Medium |
| 1591 |
奇怪的打印机 II |
[图] [拓扑排序] [数组] [矩阵] |
Hard |
| 1590 |
使数组和能被 P 整除 |
[数组] [哈希表] [前缀和] |
Medium |
| 1589 |
所有排列中的最大和 |
[贪心] [数组] [前缀和] [排序] |
Medium |
| 1588 |
所有奇数长度子数组的和 |
[数组] [数学] [前缀和] |
Easy |
| 1584 |
连接所有点的最小费用 |
[并查集] [数组] [最小生成树] |
Medium |
| 1583 |
统计不开心的朋友 |
[数组] [模拟] |
Medium |
| 1582 |
二进制矩阵中的特殊位置 |
[数组] [矩阵] |
Easy |
| 1580 |
把箱子放进仓库里 II 🔒 |
[贪心] [数组] [排序] |
Medium |
| 1578 |
使绳子变成彩色的最短时间 |
[贪心] [数组] [字符串] [动态规划] |
Medium |
| 1577 |
数的平方等于两数乘积的方法数 |
[数组] [哈希表] [数学] [双指针] |
Medium |
| 1575 |
统计所有可行路径 |
[记忆化搜索] [数组] [动态规划] |
Hard |
| 1574 |
删除最短的子数组使剩余数组有序 |
[栈] [数组] [双指针] [二分查找] [单调栈] |
Medium |
| 1572 |
矩阵对角线元素的和 |
[数组] [矩阵] |
Easy |
| 1570 |
两个稀疏向量的点积 🔒 |
[设计] [数组] [哈希表] [双指针] |
Medium |
| 1569 |
将子数组重新排序得到同一个二叉查找树的方案数 |
[树] [并查集] [二叉搜索树] [记忆化搜索] [数组] [数学] [分治] [动态规划] [二叉树] [组合数学] |
Hard |
| 1568 |
使陆地分离的最少天数 |
[深度优先搜索] [广度优先搜索] [数组] [矩阵] [强连通分量] |
Hard |
| 1567 |
乘积为正数的最长子数组长度 |
[贪心] [数组] [动态规划] |
Medium |
| 1566 |
重复至少 K 次且长度为 M 的模式 |
[数组] [枚举] |
Easy |
| 1564 |
把箱子放进仓库里 I 🔒 |
[贪心] [数组] [排序] |
Medium |
| 1563 |
石子游戏 V |
[数组] [数学] [动态规划] [博弈] |
Hard |
| 1562 |
查找大小为 M 的最新分组 |
[数组] [二分查找] [模拟] |
Medium |
| 1561 |
你可以获得的最大硬币数目 |
[贪心] [数组] [数学] [博弈] [排序] |
Medium |
| 1560 |
圆形赛道上经过次数最多的扇区 |
[数组] [模拟] |
Easy |
| 1559 |
二维网格图中探测环 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 1558 |
得到目标数组的最少函数调用次数 |
[贪心] [数组] |
Medium |
| 1552 |
两球之间的磁力 |
[数组] [二分查找] [排序] |
Medium |
| 1550 |
存在连续三个奇数的数组 |
[数组] |
Easy |
| 1547 |
切棍子的最小成本 |
[数组] [动态规划] |
Hard |
| 1546 |
和为目标值且不重叠的非空子数组的最大数目 |
[贪心] [数组] [哈希表] [前缀和] |
Medium |
| 1539 |
第 k 个缺失的正整数 |
[数组] [二分查找] |
Easy |
| 1538 |
找出隐藏数组中出现次数最多的元素 🔒 |
[数组] [数学] [交互] |
Medium |
| 1537 |
最大得分 |
[贪心] [数组] [双指针] [动态规划] |
Hard |
| 1536 |
排布二进制网格的最少交换次数 |
[贪心] [数组] [矩阵] |
Medium |
| 1535 |
找出数组游戏的赢家 |
[数组] [模拟] |
Medium |
| 1534 |
统计好三元组 |
[数组] [枚举] |
Easy |
| 1533 |
找到最大整数的索引 🔒 |
[数组] [二分查找] [交互] |
Medium |
| 1528 |
重新排列字符串 |
[数组] [字符串] |
Easy |
| 1526 |
形成目标数组的子数组最少增加次数 |
[栈] [贪心] [数组] [动态规划] [单调栈] |
Hard |
| 1524 |
和为奇数的子数组数目 |
[数组] [数学] [动态规划] [前缀和] |
Medium |
| 1521 |
找到最接近目标值的函数值 |
[位运算] [线段树] [数组] [二分查找] |
Hard |
| 1512 |
好数对的数目 |
[数组] [哈希表] [数学] [计数] |
Easy |
| 1509 |
三次操作后最大值与最小值的最小差 |
[贪心] [数组] [排序] |
Medium |
| 1508 |
子数组和排序后的区间和 |
[数组] [双指针] [二分查找] [排序] |
Medium |
| 1504 |
统计全 1 子矩形 |
[栈] [数组] [动态规划] [矩阵] [单调栈] |
Medium |
| 1503 |
所有蚂蚁掉下来前的最后一刻 |
[脑筋急转弯] [数组] [模拟] |
Medium |
| 1502 |
判断能否形成等差数列 |
[数组] [排序] |
Easy |
| 1499 |
满足不等式的最大值 |
[队列] [数组] [滑动窗口] [单调队列] [堆（优先队列）] |
Hard |
| 1498 |
满足条件的子序列数目 |
[数组] [双指针] [二分查找] [排序] |
Medium |
| 1497 |
检查数组对是否可以被 k 整除 |
[数组] [哈希表] [计数] |
Medium |
| 1491 |
去掉最低工资和最高工资后的工资平均值 |
[数组] [排序] |
Easy |
| 1488 |
避免洪水泛滥 |
[贪心] [数组] [哈希表] [二分查找] [堆（优先队列）] |
Medium |
| 1487 |
保证文件名唯一 |
[数组] [哈希表] [字符串] |
Medium |
| 1482 |
制作 m 束花所需的最少天数 |
[数组] [二分查找] |
Medium |
| 1481 |
不同整数的最少数目 |
[贪心] [数组] [哈希表] [计数] [排序] |
Medium |
| 1480 |
一维数组的动态和 |
[数组] [前缀和] |
Easy |
| 1478 |
安排邮筒 |
[数组] [数学] [动态规划] [排序] |
Hard |
| 1477 |
找两个和为目标值且不重叠的子数组 |
[数组] [哈希表] [二分查找] [动态规划] [滑动窗口] |
Medium |
| 1476 |
子矩形查询 |
[设计] [数组] [矩阵] |
Medium |
| 1475 |
商品折扣后的最终价格 |
[栈] [数组] [单调栈] |
Easy |
| 1473 |
粉刷房子 III |
[数组] [动态规划] |
Hard |
| 1472 |
设计浏览器历史记录 |
[栈] [设计] [数组] [链表] [数据流] [双向链表] |
Medium |
| 1471 |
数组中的 k 个最强值 |
[数组] [双指针] [排序] |
Medium |
| 1470 |
重新排列数组 |
[数组] |
Easy |
| 1465 |
切割后面积最大的蛋糕 |
[贪心] [数组] [排序] |
Medium |
| 1464 |
数组中两元素的最大乘积 |
[数组] [排序] [堆（优先队列）] |
Easy |
| 1463 |
摘樱桃 II |
[数组] [动态规划] [矩阵] |
Hard |
| 1460 |
通过翻转子数组使两个数组相等 |
[数组] [哈希表] [排序] |
Easy |
| 1458 |
两个子序列的最大点积 |
[数组] [动态规划] |
Hard |
| 1453 |
圆形靶内的最大飞镖数量 |
[几何] [数组] [数学] |
Hard |
| 1452 |
收藏清单 |
[数组] [哈希表] [字符串] |
Medium |
| 1450 |
在既定时间做作业的学生人数 |
[数组] |
Easy |
| 1449 |
数位成本和为目标值的最大数字 |
[数组] [动态规划] |
Hard |
| 1444 |
切披萨的方案数 |
[记忆化搜索] [数组] [动态规划] [矩阵] |
Hard |
| 1442 |
形成两个异或相等数组的三元组数目 |
[位运算] [数组] [哈希表] [数学] [前缀和] |
Medium |
| 1441 |
用栈操作构建数组 |
[栈] [数组] [模拟] |
Easy |
| 1439 |
有序矩阵中的第 k 个最小数组和 |
[数组] [二分查找] [矩阵] [堆（优先队列）] |
Hard |
| 1438 |
绝对差不超过限制的最长连续子数组 |
[队列] [数组] [有序集合] [滑动窗口] [单调队列] [堆（优先队列）] |
Medium |
| 1437 |
是否所有 1 都至少相隔 k 个元素 |
[数组] |
Easy |
| 1434 |
每个人戴不同帽子的方案数 |
[位运算] [数组] [动态规划] [状态压缩] |
Hard |
| 1431 |
拥有最多糖果的孩子 |
[数组] |
Easy |
| 1429 |
第一个唯一数字 🔒 |
[设计] [队列] [数组] [哈希表] [数据流] |
Medium |
| 1428 |
至少有一个 1 的最左端列 🔒 |
[数组] [二分查找] [交互] [矩阵] |
Medium |
| 1427 |
字符串的左右移 🔒 |
[数组] [数学] [字符串] |
Easy |
| 1426 |
数元素 🔒 |
[数组] [哈希表] |
Easy |
| 1425 |
带限制的子序列和 |
[队列] [数组] [动态规划] [滑动窗口] [单调队列] [堆（优先队列）] |
Hard |
| 1424 |
对角线遍历 II |
[数组] [排序] [堆（优先队列）] |
Medium |
| 1423 |
可获得的最大点数 |
[数组] [前缀和] [滑动窗口] |
Medium |
| 1418 |
点菜展示表 |
[数组] [哈希表] [字符串] [有序集合] [排序] |
Medium |
| 1413 |
逐步求和得到正数的最小值 |
[数组] [前缀和] |
Easy |
| 1409 |
查询带键的排列 |
[树状数组] [数组] [模拟] |
Medium |
| 1406 |
石子游戏 III |
[数组] [数学] [动态规划] [博弈] |
Hard |
| 1403 |
非递增顺序的最小子序列 |
[贪心] [数组] [排序] |
Easy |
| 1402 |
做菜顺序 |
[贪心] [数组] [动态规划] [排序] |
Hard |
| 1395 |
统计作战单位数 |
[树状数组] [数组] [动态规划] |
Medium |
| 1394 |
找出数组中的幸运数 |
[数组] [哈希表] [计数] |
Easy |
| 1391 |
检查网格中是否存在有效路径 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 1390 |
四因数 |
[数组] [数学] |
Medium |
| 1389 |
按既定顺序创建目标数组 |
[数组] [模拟] |
Easy |
| 1388 |
3n 块披萨 |
[贪心] [数组] [动态规划] [堆（优先队列）] |
Hard |
| 1386 |
安排电影院座位 |
[贪心] [位运算] [数组] [哈希表] |
Medium |
| 1385 |
两个数组间的距离值 |
[数组] [双指针] [二分查找] [排序] |
Easy |
| 1383 |
最大的团队表现值 |
[贪心] [数组] [排序] [堆（优先队列）] |
Hard |
| 1381 |
设计一个支持增量操作的栈 |
[栈] [设计] [数组] |
Medium |
| 1380 |
矩阵中的幸运数 |
[数组] [矩阵] |
Easy |
| 1375 |
二进制字符串前缀一致的次数 |
[数组] |
Medium |
| 1368 |
使网格图至少有一条有效路径的最小代价 |
[广度优先搜索] [图] [数组] [矩阵] [最短路] [堆（优先队列）] |
Hard |
| 1366 |
通过投票对团队排名 |
[数组] [哈希表] [字符串] [计数] [排序] |
Medium |
| 1365 |
有多少小于当前数字的数字 |
[数组] [哈希表] [计数] [排序] |
Easy |
| 1363 |
形成三的最大倍数 |
[贪心] [数组] [动态规划] |
Hard |
| 1357 |
每隔 n 个顾客打折 |
[设计] [数组] [哈希表] |
Medium |
| 1356 |
根据数字二进制下 1 的数目排序 |
[位运算] [数组] [计数] [排序] |
Easy |
| 1354 |
多次求和构造目标数组 |
[数组] [堆（优先队列）] |
Hard |
| 1353 |
最多可以参加的会议数目 |
[贪心] [数组] [堆（优先队列）] |
Medium |
| 1352 |
最后 K 个数的乘积 |
[设计] [队列] [数组] [数学] [数据流] |
Medium |
| 1351 |
统计有序矩阵中的负数 |
[数组] [二分查找] [矩阵] |
Easy |
| 1349 |
参加考试的最大学生数 |
[位运算] [数组] [动态规划] [状态压缩] [矩阵] |
Hard |
| 1346 |
检查整数及其两倍数是否存在 |
[数组] [哈希表] [双指针] [二分查找] [排序] |
Easy |
| 1345 |
跳跃游戏 IV |
[广度优先搜索] [数组] [哈希表] |
Hard |
| 1343 |
大小为 K 且平均值大于等于阈值的子数组数目 |
[数组] [滑动窗口] |
Medium |
| 1340 |
跳跃游戏 V |
[数组] [动态规划] [排序] |
Hard |
| 1338 |
数组大小减半 |
[贪心] [数组] [哈希表] [排序] [堆（优先队列）] |
Medium |
| 1337 |
矩阵中战斗力最弱的 K 行 |
[数组] [二分查找] [矩阵] [排序] [堆（优先队列）] |
Easy |
| 1335 |
工作计划的最低难度 |
[数组] [动态规划] |
Hard |
| 1333 |
餐厅过滤器 |
[数组] [排序] |
Medium |
| 1331 |
数组序号转换 |
[数组] [哈希表] [排序] |
Easy |
| 1330 |
翻转子数组得到最大的数组值 |
[贪心] [数组] [数学] |
Hard |
| 1329 |
将矩阵按对角线排序 |
[数组] [矩阵] [排序] |
Medium |
| 1326 |
灌溉花园的最少水龙头数目 |
[贪心] [数组] [动态规划] |
Hard |
| 1324 |
竖直打印单词 |
[数组] [字符串] [模拟] |
Medium |
| 1314 |
矩阵区域和 |
[数组] [矩阵] [前缀和] |
Medium |
| 1313 |
解压缩编码列表 |
[数组] |
Easy |
| 1311 |
获取你好友已观看的视频 |
[广度优先搜索] [数组] [哈希表] [排序] |
Medium |
| 1310 |
子数组异或查询 |
[位运算] [数组] [前缀和] |
Medium |
| 1307 |
口算难题 |
[数组] [数学] [字符串] [回溯] |
Hard |
| 1306 |
跳跃游戏 III |
[深度优先搜索] [广度优先搜索] [数组] |
Medium |
| 1304 |
和为零的N个唯一整数 |
[数组] [数学] |
Easy |
| 1301 |
最大得分的路径数目 |
[数组] [动态规划] [矩阵] |
Hard |
| 1300 |
转变数组后最接近目标值的数组和 |
[数组] [二分查找] [排序] |
Medium |
| 1299 |
将每个元素替换为右侧最大元素 |
[数组] |
Easy |
| 1298 |
你能从盒子里获得的最大糖果数 |
[广度优先搜索] [数组] |
Hard |
| 1296 |
划分数组为连续数字的集合 |
[贪心] [数组] [哈希表] [排序] |
Medium |
| 1295 |
统计位数为偶数的数字 |
[数组] |
Easy |
| 1293 |
网格中的最短路径 |
[广度优先搜索] [数组] [矩阵] |
Hard |
| 1292 |
元素和小于等于阈值的正方形的最大边长 |
[数组] [二分查找] [矩阵] [前缀和] |
Medium |
| 1289 |
下降路径最小和 II |
[数组] [动态规划] [矩阵] |
Hard |
| 1288 |
删除被覆盖区间 |
[数组] [排序] |
Medium |
| 1287 |
有序数组中出现次数超过25%的元素 |
[数组] |
Easy |
| 1284 |
转化为全零矩阵的最少反转次数 |
[位运算] [广度优先搜索] [数组] [矩阵] |
Hard |
| 1283 |
使结果不超过阈值的最小除数 |
[数组] [二分查找] |
Medium |
| 1282 |
用户分组 |
[数组] [哈希表] |
Medium |
| 1277 |
统计全为 1 的正方形子矩阵 |
[数组] [动态规划] [矩阵] |
Medium |
| 1275 |
找出井字棋的获胜者 |
[数组] [哈希表] [矩阵] [模拟] |
Easy |
| 1274 |
矩形内船只的数目 🔒 |
[数组] [分治] [交互] |
Hard |
| 1272 |
删除区间 🔒 |
[数组] |
Medium |
| 1268 |
搜索推荐系统 |
[字典树] [数组] [字符串] |
Medium |
| 1267 |
统计参与通信的服务器 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [计数] [矩阵] |
Medium |
| 1266 |
访问所有点的最小时间 |
[几何] [数组] [数学] |
Easy |
| 1263 |
推箱子 |
[广度优先搜索] [数组] [矩阵] [堆（优先队列）] |
Hard |
| 1262 |
可被三整除的最大和 |
[贪心] [数组] [动态规划] |
Medium |
| 1260 |
二维网格迁移 |
[数组] [矩阵] [模拟] |
Easy |
| 1258 |
近义词句子 🔒 |
[并查集] [数组] [哈希表] [字符串] [回溯] |
Medium |
| 1257 |
最小公共区域 🔒 |
[树] [深度优先搜索] [广度优先搜索] [数组] [哈希表] [字符串] |
Medium |
| 1255 |
得分最高的单词集合 |
[位运算] [数组] [字符串] [动态规划] [回溯] [状态压缩] |
Hard |
| 1254 |
统计封闭岛屿的数目 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 1253 |
重构 2 行二进制矩阵 |
[贪心] [数组] [矩阵] |
Medium |
| 1252 |
奇数值单元格的数目 |
[数组] [数学] [模拟] |
Easy |
| 1250 |
检查「好数组」 |
[数组] [数学] [数论] |
Hard |
| 1248 |
统计「优美子数组」 |
[数组] [哈希表] [数学] [滑动窗口] |
Medium |
| 1246 |
删除回文子数组 🔒 |
[数组] [动态规划] |
Hard |
| 1243 |
数组变换 🔒 |
[数组] [模拟] |
Easy |
| 1239 |
串联字符串的最大长度 |
[位运算] [数组] [字符串] [回溯] |
Medium |
| 1235 |
规划兼职工作 |
[数组] [二分查找] [动态规划] [排序] |
Hard |
| 1233 |
删除子文件夹 |
[字典树] [数组] [字符串] |
Medium |
| 1232 |
缀点成线 |
[几何] [数组] [数学] |
Easy |
| 1231 |
分享巧克力 🔒 |
[数组] [二分查找] |
Hard |
| 1229 |
安排会议日程 🔒 |
[数组] [双指针] [排序] |
Medium |
| 1228 |
等差数列中缺失的数字 🔒 |
[数组] [数学] |
Easy |
| 1224 |
最大相等频率 |
[数组] [哈希表] |
Hard |
| 1223 |
掷骰子模拟 |
[数组] [动态规划] |
Hard |
| 1222 |
可以攻击国王的皇后 |
[数组] [矩阵] [模拟] |
Medium |
| 1219 |
黄金矿工 |
[数组] [回溯] [矩阵] |
Medium |
| 1218 |
最长定差子序列 |
[数组] [哈希表] [动态规划] |
Medium |
| 1217 |
玩筹码 |
[贪心] [数组] [数学] |
Easy |
| 1213 |
三个有序数组的交集 🔒 |
[数组] [哈希表] [二分查找] [计数] |
Easy |
| 1210 |
穿过迷宫的最少移动次数 |
[广度优先搜索] [数组] [矩阵] |
Hard |
| 1207 |
独一无二的出现次数 |
[数组] [哈希表] |
Easy |
| 1200 |
最小绝对差 |
[数组] [排序] |
Easy |
| 1198 |
找出所有行中最小公共元素 🔒 |
[数组] [哈希表] [二分查找] [计数] [矩阵] |
Medium |
| 1196 |
最多可以买到的苹果数量 🔒 |
[贪心] [数组] [排序] |
Easy |
| 1191 |
K 次串联后最大子数组之和 |
[数组] [动态规划] |
Medium |
| 1187 |
使数组严格递增 |
[数组] [二分查找] [动态规划] |
Hard |
| 1186 |
删除一次得到子数组最大和 |
[数组] [动态规划] |
Medium |
| 1184 |
公交站间的距离 |
[数组] |
Easy |
| 1182 |
与目标颜色间的最短距离 🔒 |
[数组] [二分查找] [动态规划] |
Medium |
| 1181 |
前后拼接 🔒 |
[数组] [哈希表] [字符串] [排序] |
Medium |
| 1178 |
猜字谜 |
[位运算] [字典树] [数组] [哈希表] [字符串] |
Hard |
| 1176 |
健身计划评估 🔒 |
[数组] [滑动窗口] |
Easy |
| 1170 |
比较字符串最小字母出现频次 |
[数组] [哈希表] [字符串] [二分查找] [排序] |
Medium |
| 1169 |
查询无效交易 |
[数组] [哈希表] [字符串] [排序] |
Medium |
| 1167 |
连接棒材的最低费用 🔒 |
[贪心] [数组] [堆（优先队列）] |
Medium |
| 1162 |
地图分析 |
[广度优先搜索] [数组] [动态规划] [矩阵] |
Medium |
| 1160 |
拼写单词 |
[数组] [哈希表] [字符串] |
Easy |
| 1157 |
子数组中占绝大多数的元素 |
[设计] [树状数组] [线段树] [数组] [二分查找] |
Hard |
| 1152 |
用户网站访问行为分析 🔒 |
[数组] [哈希表] [排序] |
Medium |
| 1151 |
最少交换次数来组合所有的 1 🔒 |
[数组] [滑动窗口] |
Medium |
| 1150 |
检查一个数是否在数组中占绝大多数 🔒 |
[数组] [二分查找] |
Easy |
| 1146 |
快照数组 |
[设计] [数组] [哈希表] [二分查找] |
Medium |
| 1144 |
递减元素使数组呈锯齿状 |
[贪心] [数组] |
Medium |
| 1140 |
石子游戏 II |
[数组] [数学] [动态规划] [博弈] |
Medium |
| 1139 |
最大的以 1 为边界的正方形 |
[数组] [动态规划] [矩阵] |
Medium |
| 1133 |
最大唯一数 🔒 |
[数组] [哈希表] [排序] |
Easy |
| 1131 |
绝对值表达式的最大值 |
[数组] [数学] |
Medium |
| 1128 |
等价多米诺骨牌对的数量 |
[数组] [哈希表] [计数] |
Easy |
| 1125 |
最小的必要团队 |
[位运算] [数组] [动态规划] [状态压缩] |
Hard |
| 1124 |
表现良好的最长时间段 |
[栈] [数组] [哈希表] [前缀和] [单调栈] |
Medium |
| 1122 |
数组的相对排序 |
[数组] [哈希表] [计数排序] [排序] |
Easy |
| 1121 |
将数组分成几个递增序列 🔒 |
[贪心] [数组] |
Hard |
| 1109 |
航班预订统计 |
[数组] [前缀和] |
Medium |
| 1105 |
填充书架 |
[数组] [动态规划] |
Medium |
| 1102 |
得分最高的路径 🔒 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] [堆（优先队列）] |
Medium |
| 1101 |
彼此熟识的最早时间 🔒 |
[并查集] [数组] |
Medium |
| 1099 |
小于 K 的两数之和 🔒 |
[数组] [双指针] [二分查找] [排序] |
Easy |
| 1095 |
山脉数组中查找目标值 |
[数组] [二分查找] [交互] |
Hard |
| 1094 |
拼车 |
[数组] [前缀和] [排序] [模拟] [堆（优先队列）] |
Medium |
| 1091 |
二进制矩阵中的最短路径 |
[广度优先搜索] [数组] [矩阵] |
Medium |
| 1090 |
受标签影响的最大值 |
[贪心] [数组] [哈希表] [计数] [排序] |
Medium |
| 1089 |
复写零 |
[数组] [双指针] |
Easy |
| 1086 |
前五科的均分 🔒 |
[数组] [哈希表] [排序] |
Easy |
| 1085 |
最小元素各数位之和 🔒 |
[数组] [数学] |
Easy |
| 1074 |
元素和为目标值的子矩阵数量 |
[数组] [哈希表] [矩阵] [前缀和] |
Hard |
| 1073 |
负二进制数相加 |
[数组] [数学] |
Medium |
| 1072 |
按列翻转得到最大值等行数 |
[数组] [哈希表] [矩阵] |
Medium |
| 1066 |
校园自行车分配 II 🔒 |
[位运算] [数组] [动态规划] [回溯] [状态压缩] |
Medium |
| 1065 |
字符串的索引对 🔒 |
[字典树] [数组] [字符串] [排序] |
Easy |
| 1064 |
不动点 🔒 |
[数组] [二分查找] |
Easy |
| 1063 |
有效子数组的数目 🔒 |
[栈] [数组] [单调栈] |
Hard |
| 1060 |
有序数组中的缺失元素 🔒 |
[数组] [二分查找] |
Medium |
| 1058 |
最小化舍入误差以满足目标 🔒 |
[贪心] [数组] [数学] [字符串] |
Medium |
| 1057 |
校园自行车分配 🔒 |
[贪心] [数组] [排序] |
Medium |
| 1054 |
距离相等的条形码 |
[贪心] [数组] [哈希表] [计数] [排序] [堆（优先队列）] |
Medium |
| 1053 |
交换一次的先前排列 |
[贪心] [数组] |
Medium |
| 1052 |
爱生气的书店老板 |
[数组] [滑动窗口] |
Medium |
| 1051 |
高度检查器 |
[数组] [计数排序] [排序] |
Easy |
| 1049 |
最后一块石头的重量 II |
[数组] [动态规划] |
Medium |
| 1048 |
最长字符串链 |
[数组] [哈希表] [双指针] [字符串] [动态规划] |
Medium |
| 1046 |
最后一块石头的重量 |
[数组] [堆（优先队列）] |
Easy |
| 1043 |
分隔数组以得到最大和 |
[数组] [动态规划] |
Medium |
| 1040 |
移动石子直到连续 II |
[数组] [数学] [双指针] [排序] |
Medium |
| 1039 |
多边形三角剖分的最低得分 |
[数组] [动态规划] |
Medium |
| 1036 |
逃离大迷宫 |
[深度优先搜索] [广度优先搜索] [数组] [哈希表] |
Hard |
| 1035 |
不相交的线 |
[数组] [动态规划] |
Medium |
| 1034 |
边界着色 |
[深度优先搜索] [广度优先搜索] [数组] [矩阵] |
Medium |
| 1032 |
字符流 |
[设计] [字典树] [数组] [字符串] [数据流] |
Hard |
| 1031 |
两个非重叠子数组的最大和 |
[数组] [动态规划] [滑动窗口] |
Medium |
| 1030 |
距离顺序排列矩阵单元格 |
[几何] [数组] [数学] [矩阵] [排序] |
Easy |
| 1029 |
两地调度 |
[贪心] [数组] [排序] |
Medium |
| 1027 |
最长等差数列 |
[数组] [哈希表] [二分查找] [动态规划] |
Medium |
| 1024 |
视频拼接 |
[贪心] [数组] [动态规划] |
Medium |
| 1020 |
飞地的数量 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 1019 |
链表中的下一个更大节点 |
[栈] [数组] [链表] [单调栈] |
Medium |
| 1018 |
可被 5 整除的二进制前缀 |
[数组] |
Easy |
| 1014 |
最佳观光组合 |
[数组] [动态规划] |
Medium |
| 1013 |
将数组分成和相等的三个部分 |
[贪心] [数组] |
Easy |
| 1011 |
在 D 天内送达包裹的能力 |
[贪心] [数组] [二分查找] |
Medium |
| 1010 |
总持续时间可被 60 整除的歌曲 |
[数组] [哈希表] [计数] |
Medium |
| 1008 |
前序遍历构造二叉搜索树 |
[栈] [树] [二叉搜索树] [数组] [二叉树] [单调栈] |
Medium |
| 1007 |
行相等的最少多米诺旋转 |
[贪心] [数组] |
Medium |
| 1005 |
K 次取反后最大化的数组和 |
[贪心] [数组] [排序] |
Easy |
| 1004 |
最大连续1的个数 III |
[数组] [二分查找] [前缀和] [滑动窗口] |
Medium |
| 1002 |
查找共用字符 |
[数组] [哈希表] [字符串] |
Easy |
| 1001 |
网格照明 |
[数组] [哈希表] |
Hard |
| 1000 |
合并石头的最低成本 |
[数组] [动态规划] |
Hard |
| 999 |
可以被一步捕获的棋子数 |
[数组] [矩阵] [模拟] |
Easy |
| 997 |
找到小镇的法官 |
[图] [数组] [哈希表] |
Easy |
| 996 |
正方形数组的数目 |
[位运算] [数组] [数学] [动态规划] [回溯] [状态压缩] |
Hard |
| 995 |
K 连续位的最小翻转次数 |
[位运算] [数组] [前缀和] [滑动窗口] |
Hard |
| 994 |
腐烂的橘子 |
[广度优先搜索] [数组] [矩阵] |
Medium |
| 992 |
K 个不同整数的子数组 |
[数组] [哈希表] [计数] [滑动窗口] |
Hard |
| 990 |
等式方程的可满足性 |
[并查集] [图] [数组] [字符串] |
Medium |
| 989 |
数组形式的整数加法 |
[数组] [数学] |
Easy |
| 986 |
区间列表的交集 |
[数组] [双指针] |
Medium |
| 985 |
查询后的偶数和 |
[数组] [模拟] |
Medium |
| 983 |
最低票价 |
[数组] [动态规划] |
Medium |
| 982 |
按位与为零的三元组 |
[位运算] [数组] [哈希表] |
Hard |
| 980 |
不同路径 III |
[位运算] [数组] [回溯] [矩阵] |
Hard |
| 978 |
最长湍流子数组 |
[数组] [动态规划] [滑动窗口] |
Medium |
| 977 |
有序数组的平方 |
[数组] [双指针] [排序] |
Easy |
| 976 |
三角形的最大周长 |
[贪心] [数组] [数学] [排序] |
Easy |
| 975 |
奇偶跳 |
[栈] [数组] [动态规划] [有序集合] [单调栈] |
Hard |
| 974 |
和可被 K 整除的子数组 |
[数组] [哈希表] [前缀和] |
Medium |
| 973 |
最接近原点的 K 个点 |
[几何] [数组] [数学] [分治] [快速选择] [排序] [堆（优先队列）] |
Medium |
| 969 |
煎饼排序 |
[贪心] [数组] [双指针] [排序] |
Medium |
| 966 |
元音拼写检查器 |
[数组] [哈希表] [字符串] |
Medium |
| 963 |
最小面积矩形 II |
[几何] [数组] [数学] |
Medium |
| 962 |
最大宽度坡 |
[栈] [数组] [单调栈] |
Medium |
| 961 |
在长度 2N 的数组中找出重复 N 次的元素 |
[数组] [哈希表] |
Easy |
| 960 |
删列造序 III |
[数组] [字符串] [动态规划] |
Hard |
| 957 |
N 天后的牢房 |
[位运算] [数组] [哈希表] [数学] |
Medium |
| 956 |
最高的广告牌 |
[数组] [动态规划] |
Hard |
| 955 |
删列造序 II |
[贪心] [数组] [字符串] |
Medium |
| 954 |
二倍数对数组 |
[贪心] [数组] [哈希表] [排序] |
Medium |
| 953 |
验证外星语词典 |
[数组] [哈希表] [字符串] |
Easy |
| 952 |
按公因数计算最大组件大小 |
[并查集] [数组] [数学] |
Hard |
| 950 |
按递增顺序显示卡牌 |
[队列] [数组] [排序] [模拟] |
Medium |
| 948 |
令牌放置 |
[贪心] [数组] [双指针] [排序] |
Medium |
| 946 |
验证栈序列 |
[栈] [数组] [模拟] |
Medium |
| 945 |
使数组唯一的最小增量 |
[贪心] [数组] [计数] [排序] |
Medium |
| 944 |
删列造序 |
[数组] [字符串] |
Easy |
| 943 |
最短超级串 |
[位运算] [数组] [字符串] [动态规划] [状态压缩] |
Hard |
| 942 |
增减字符串匹配 |
[贪心] [数组] [数学] [双指针] [字符串] |
Easy |
| 941 |
有效的山脉数组 |
[数组] |
Easy |
| 939 |
最小面积矩形 |
[几何] [数组] [哈希表] [数学] [排序] |
Medium |
| 937 |
重新排列日志文件 |
[数组] [字符串] [排序] |
Easy |
| 934 |
最短的桥 |
[深度优先搜索] [广度优先搜索] [数组] [矩阵] |
Medium |
| 932 |
漂亮数组 |
[数组] [数学] [分治] |
Medium |
| 931 |
下降路径最小和 |
[数组] [动态规划] [矩阵] |
Medium |
| 930 |
和相同的二元子数组 |
[数组] [哈希表] [前缀和] [滑动窗口] |
Medium |
| 929 |
独特的电子邮件地址 |
[数组] [哈希表] [字符串] |
Easy |
| 928 |
尽量减少恶意软件的传播 II |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Hard |
| 927 |
三等分 |
[数组] [数学] |
Hard |
| 924 |
尽量减少恶意软件的传播 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Hard |
| 923 |
三数之和的多种可能 |
[数组] [哈希表] [双指针] [计数] [排序] |
Medium |
| 922 |
按奇偶排序数组 II |
[数组] [双指针] [排序] |
Easy |
| 918 |
环形子数组的最大和 |
[队列] [数组] [分治] [动态规划] [单调队列] |
Medium |
| 916 |
单词子集 |
[数组] [哈希表] [字符串] |
Medium |
| 915 |
分割数组 |
[数组] |
Medium |
| 914 |
卡牌分组 |
[数组] [哈希表] [数学] [计数] [数论] |
Easy |
| 912 |
排序数组 |
[数组] [分治] [桶排序] [计数排序] [基数排序] [排序] [堆（优先队列）] [归并排序] |
Medium |
| 911 |
在线选举 |
[设计] [数组] [哈希表] [二分查找] |
Medium |
| 910 |
最小差值 II |
[贪心] [数组] [数学] [排序] |
Medium |
| 909 |
蛇梯棋 |
[广度优先搜索] [数组] [矩阵] |
Medium |
| 908 |
最小差值 I |
[数组] [数学] |
Easy |
| 907 |
子数组的最小值之和 |
[栈] [数组] [动态规划] [单调栈] |
Medium |
| 905 |
按奇偶排序数组 |
[数组] [双指针] [排序] |
Easy |
| 904 |
水果成篮 |
[数组] [哈希表] [滑动窗口] |
Medium |
| 902 |
最大为 N 的数字组合 |
[数组] [数学] [二分查找] [动态规划] |
Hard |
| 900 |
RLE 迭代器 |
[设计] [数组] [计数] [迭代器] |
Medium |
| 898 |
子数组按位或操作 |
[位运算] [数组] [动态规划] |
Medium |
| 896 |
单调数列 |
[数组] |
Easy |
| 893 |
特殊等价字符串组 |
[数组] [哈希表] [字符串] |
Medium |
| 892 |
三维形体的表面积 |
[几何] [数组] [数学] [矩阵] |
Easy |
| 891 |
子序列宽度之和 |
[数组] [数学] [排序] |
Hard |
| 890 |
查找和替换模式 |
[数组] [哈希表] [字符串] |
Medium |
| 889 |
根据前序和后序遍历构造二叉树 |
[树] [数组] [哈希表] [分治] [二叉树] |
Medium |
| 888 |
公平的糖果交换 |
[数组] [哈希表] [二分查找] [排序] |
Easy |
| 885 |
螺旋矩阵 III |
[数组] [矩阵] [模拟] |
Medium |
| 883 |
三维形体投影面积 |
[几何] [数组] [数学] [矩阵] |
Easy |
| 881 |
救生艇 |
[贪心] [数组] [双指针] [排序] |
Medium |
| 879 |
盈利计划 |
[数组] [动态规划] |
Hard |
| 877 |
石子游戏 |
[数组] [数学] [动态规划] [博弈] |
Medium |
| 875 |
爱吃香蕉的珂珂 |
[数组] [二分查找] |
Medium |
| 874 |
模拟行走机器人 |
[数组] [模拟] |
Medium |
| 873 |
最长的斐波那契子序列的长度 |
[数组] [哈希表] [动态规划] |
Medium |
| 871 |
最低加油次数 |
[贪心] [数组] [动态规划] [堆（优先队列）] |
Hard |
| 870 |
优势洗牌 |
[贪心] [数组] [排序] |
Medium |
| 867 |
转置矩阵 |
[数组] [矩阵] [模拟] |
Easy |
| 862 |
和至少为 K 的最短子数组 |
[队列] [数组] [二分查找] [前缀和] [滑动窗口] [单调队列] [堆（优先队列）] |
Hard |
| 861 |
翻转矩阵后的得分 |
[贪心] [位运算] [数组] [矩阵] |
Medium |
| 860 |
柠檬水找零 |
[贪心] [数组] |
Easy |
| 857 |
雇佣 K 名工人的最低成本 |
[贪心] [数组] [排序] [堆（优先队列）] |
Hard |
| 853 |
车队 |
[栈] [数组] [排序] [单调栈] |
Medium |
| 852 |
山脉数组的峰顶索引 |
[数组] [二分查找] |
Easy |
| 851 |
喧闹和富有 |
[深度优先搜索] [图] [拓扑排序] [数组] |
Medium |
| 850 |
矩形面积 II |
[线段树] [数组] [有序集合] [扫描线] |
Hard |
| 849 |
到最近的人的最大距离 |
[数组] |
Medium |
| 848 |
字母移位 |
[数组] [字符串] |
Medium |
| 846 |
一手顺子 |
[贪心] [数组] [哈希表] [排序] |
Medium |
| 845 |
数组中的最长山脉 |
[数组] [双指针] [动态规划] [枚举] |
Medium |
| 843 |
猜猜这个单词 |
[数组] [数学] [字符串] [博弈] [交互] |
Hard |
| 840 |
矩阵中的幻方 |
[数组] [数学] [矩阵] |
Medium |
| 835 |
图像重叠 |
[数组] [矩阵] |
Medium |
| 833 |
字符串中的查找与替换 |
[数组] [字符串] [排序] |
Medium |
| 832 |
翻转图像 |
[数组] [双指针] [矩阵] [模拟] |
Easy |
| 827 |
最大人工岛 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Hard |
| 826 |
安排工作以达到最大收益 |
[贪心] [数组] [双指针] [二分查找] [排序] |
Medium |
| 825 |
适龄的朋友 |
[数组] [双指针] [二分查找] [排序] |
Medium |
| 823 |
带因子的二叉树 |
[数组] [哈希表] [动态规划] |
Medium |
| 822 |
翻转卡片游戏 |
[数组] [哈希表] |
Medium |
| 821 |
字符的最短距离 |
[数组] [双指针] [字符串] |
Easy |
| 820 |
单词的压缩编码 |
[字典树] [数组] [哈希表] [字符串] |
Medium |
| 815 |
公交路线 |
[广度优先搜索] [数组] [哈希表] |
Hard |
| 813 |
最大平均值和的分组 |
[数组] [动态规划] |
Medium |
| 812 |
最大三角形面积 |
[几何] [数组] [数学] |
Easy |
| 811 |
子域名访问计数 |
[数组] [哈希表] [字符串] [计数] |
Medium |
| 810 |
黑板异或游戏 |
[位运算] [脑筋急转弯] [数组] [数学] [博弈] |
Hard |
| 809 |
情感丰富的文字 |
[数组] [双指针] [字符串] |
Medium |
| 807 |
保持城市天际线 |
[贪心] [数组] [矩阵] |
Medium |
| 806 |
写字符串需要的行数 |
[数组] [字符串] |
Easy |
| 805 |
数组的均值分割 |
[位运算] [数组] [数学] [动态规划] [状态压缩] |
Hard |
| 804 |
唯一摩尔斯密码词 |
[数组] [哈希表] [字符串] |
Easy |
| 803 |
打砖块 |
[并查集] [数组] [矩阵] |
Hard |
| 801 |
使序列递增的最小交换次数 |
[数组] [动态规划] |
Hard |
| 798 |
得分最高的最小轮调 |
[数组] [前缀和] |
Hard |
| 795 |
区间子数组个数 |
[数组] [双指针] |
Medium |
| 794 |
有效的井字游戏 |
[数组] [字符串] |
Medium |
| 789 |
逃脱阻碍者 |
[数组] [数学] |
Medium |
| 786 |
第 K 个最小的素数分数 |
[数组] [二分查找] [堆（优先队列）] |
Hard |
| 782 |
变为棋盘 |
[位运算] [数组] [数学] [矩阵] |
Hard |
| 781 |
森林中的兔子 |
[贪心] [数组] [哈希表] [数学] |
Medium |
| 778 |
水位上升的泳池中游泳 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [二分查找] [矩阵] [堆（优先队列）] |
Hard |
| 775 |
全局倒置与局部倒置 |
[数组] [数学] |
Medium |
| 774 |
最小化去加油站的最大距离 🔒 |
[数组] [二分查找] |
Hard |
| 773 |
滑动谜题 |
[广度优先搜索] [数组] [矩阵] |
Hard |
| 769 |
最多能完成排序的块 |
[栈] [贪心] [数组] [排序] [单调栈] |
Medium |
| 768 |
最多能完成排序的块 II |
[栈] [贪心] [数组] [排序] [单调栈] |
Hard |
| 766 |
托普利茨矩阵 |
[数组] [矩阵] |
Easy |
| 764 |
最大加号标志 |
[数组] [动态规划] |
Medium |
| 760 |
找出变位映射 🔒 |
[数组] [哈希表] |
Easy |
| 759 |
员工空闲时间 🔒 |
[数组] [排序] [堆（优先队列）] |
Hard |
| 758 |
字符串中的加粗单词 🔒 |
[字典树] [数组] [哈希表] [字符串] [字符串匹配] |
Medium |
| 757 |
设置交集大小至少为2 |
[贪心] [数组] [排序] |
Hard |
| 755 |
倒水 🔒 |
[数组] [模拟] |
Medium |
| 752 |
打开转盘锁 |
[广度优先搜索] [数组] [哈希表] [字符串] |
Medium |
| 750 |
角矩形的数量 🔒 |
[数组] [数学] [动态规划] [矩阵] |
Medium |
| 749 |
隔离病毒 |
[深度优先搜索] [广度优先搜索] [数组] [矩阵] [模拟] |
Hard |
| 748 |
最短补全词 |
[数组] [哈希表] [字符串] |
Easy |
| 747 |
至少是其他数字两倍的最大数 |
[数组] [排序] |
Easy |
| 746 |
使用最小花费爬楼梯 |
[数组] [动态规划] |
Easy |
| 744 |
寻找比目标字母大的最小字母 |
[数组] [二分查找] |
Easy |
| 741 |
摘樱桃 |
[数组] [动态规划] [矩阵] |
Hard |
| 740 |
删除并获得点数 |
[数组] [哈希表] [动态规划] |
Medium |
| 739 |
每日温度 |
[栈] [数组] [单调栈] |
Medium |
| 737 |
句子相似性 II 🔒 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [哈希表] [字符串] |
Medium |
| 735 |
行星碰撞 |
[栈] [数组] |
Medium |
| 734 |
句子相似性 🔒 |
[数组] [哈希表] [字符串] |
Easy |
| 733 |
图像渲染 |
[深度优先搜索] [广度优先搜索] [数组] [矩阵] |
Easy |
| 724 |
寻找数组的中心下标 |
[数组] [前缀和] |
Easy |
| 723 |
粉碎糖果 🔒 |
[数组] [双指针] [矩阵] [模拟] |
Medium |
| 722 |
删除注释 |
[数组] [字符串] |
Medium |
| 721 |
账户合并 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [字符串] |
Medium |
| 720 |
词典中最长的单词 |
[字典树] [数组] [哈希表] [字符串] [排序] |
Easy |
| 719 |
找出第 k 小的距离对 |
[数组] [双指针] [二分查找] [排序] |
Hard |
| 718 |
最长重复子数组 |
[数组] [二分查找] [动态规划] [滑动窗口] [哈希函数] [滚动哈希] |
Medium |
| 717 |
1比特与2比特字符 |
[数组] |
Easy |
| 714 |
买卖股票的最佳时机含手续费 |
[贪心] [数组] [动态规划] |
Medium |
| 713 |
乘积小于K的子数组 |
[数组] [滑动窗口] |
Medium |
| 706 |
设计哈希映射 |
[设计] [数组] [哈希表] [链表] [哈希函数] |
Easy |
| 705 |
设计哈希集合 |
[设计] [数组] [哈希表] [链表] [哈希函数] |
Easy |
| 704 |
二分查找 |
[数组] [二分查找] |
Easy |
| 702 |
搜索长度未知的有序数组 🔒 |
[数组] [二分查找] [交互] |
Medium |
| 699 |
掉落的方块 |
[线段树] [数组] [有序集合] |
Hard |
| 698 |
划分为k个相等的子集 |
[位运算] [记忆化搜索] [数组] [动态规划] [回溯] [状态压缩] |
Medium |
| 697 |
数组的度 |
[数组] [哈希表] |
Easy |
| 695 |
岛屿的最大面积 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 689 |
三个无重叠子数组的最大和 |
[数组] [动态规划] |
Hard |
| 683 |
K 个关闭的灯泡 🔒 |
[树状数组] [数组] [有序集合] [滑动窗口] |
Hard |
| 682 |
棒球比赛 |
[栈] [数组] [模拟] |
Easy |
| 679 |
24 点游戏 |
[数组] [数学] [回溯] |
Hard |
| 675 |
为高尔夫比赛砍树 |
[广度优先搜索] [数组] [矩阵] [堆（优先队列）] |
Hard |
| 674 |
最长连续递增序列 |
[数组] |
Easy |
| 673 |
最长递增子序列的个数 |
[树状数组] [线段树] [数组] [动态规划] |
Medium |
| 667 |
优美的排列 II |
[数组] [数学] |
Medium |
| 666 |
路径总和 IV 🔒 |
[树] [深度优先搜索] [数组] [二叉树] |
Medium |
| 665 |
非递减数列 |
[数组] |
Medium |
| 661 |
图片平滑器 |
[数组] [矩阵] |
Easy |
| 659 |
分割数组为连续子序列 |
[贪心] [数组] [哈希表] [堆（优先队列）] |
Medium |
| 658 |
找到 K 个最接近的元素 |
[数组] [双指针] [二分查找] [排序] [堆（优先队列）] |
Medium |
| 656 |
金币路径 🔒 |
[数组] [动态规划] |
Hard |
| 654 |
最大二叉树 |
[栈] [树] [数组] [分治] [二叉树] [单调栈] |
Medium |
| 648 |
单词替换 |
[字典树] [数组] [哈希表] [字符串] |
Medium |
| 646 |
最长数对链 |
[贪心] [数组] [动态规划] [排序] |
Medium |
| 645 |
错误的集合 |
[位运算] [数组] [哈希表] [排序] |
Easy |
| 644 |
子数组最大平均数 II 🔒 |
[数组] [二分查找] |
Hard |
| 643 |
子数组最大平均数 I |
[数组] [滑动窗口] |
Easy |
| 641 |
设计循环双端队列 |
[设计] [队列] [数组] [链表] |
Medium |
| 638 |
大礼包 |
[位运算] [记忆化搜索] [数组] [动态规划] [回溯] [状态压缩] |
Medium |
| 636 |
函数的独占时间 |
[栈] [数组] |
Medium |
| 632 |
最小区间 |
[贪心] [数组] [哈希表] [排序] [滑动窗口] [堆（优先队列）] |
Hard |
| 630 |
课程表 III |
[贪心] [数组] [堆（优先队列）] |
Hard |
| 628 |
三个数的最大乘积 |
[数组] [数学] [排序] |
Easy |
| 624 |
数组列表中的最大距离 🔒 |
[贪心] [数组] |
Medium |
| 622 |
设计循环队列 |
[设计] [队列] [数组] [链表] |
Medium |
| 621 |
任务调度器 |
[贪心] [数组] [哈希表] [计数] [排序] [堆（优先队列）] |
Medium |
| 616 |
给字符串添加加粗标签 🔒 |
[字典树] [数组] [哈希表] [字符串] [字符串匹配] |
Medium |
| 611 |
有效三角形的个数 |
[贪心] [数组] [双指针] [二分查找] [排序] |
Medium |
| 609 |
在系统中查找重复文件 |
[数组] [哈希表] [字符串] |
Medium |
| 605 |
种花问题 |
[贪心] [数组] |
Easy |
| 604 |
迭代压缩字符串 🔒 |
[设计] [数组] [哈希表] [字符串] [迭代器] |
Easy |
| 599 |
两个列表的最小索引总和 |
[数组] [哈希表] [字符串] |
Easy |
| 598 |
范围求和 II |
[数组] [数学] |
Easy |
| 594 |
最长和谐子序列 |
[数组] [哈希表] [排序] |
Easy |
| 587 |
安装栅栏 |
[几何] [数组] [数学] |
Hard |
| 582 |
杀掉进程 🔒 |
[树] [深度优先搜索] [广度优先搜索] [数组] [哈希表] |
Medium |
| 581 |
最短无序连续子数组 |
[栈] [贪心] [数组] [双指针] [排序] [单调栈] |
Medium |
| 575 |
分糖果 |
[数组] [哈希表] |
Easy |
| 573 |
松鼠模拟 🔒 |
[数组] [数学] |
Medium |
| 568 |
最大休假天数 🔒 |
[数组] [动态规划] [矩阵] |
Hard |
| 566 |
重塑矩阵 |
[数组] [矩阵] [模拟] |
Easy |
| 565 |
数组嵌套 |
[深度优先搜索] [数组] |
Medium |
| 562 |
矩阵中最长的连续1线段 🔒 |
[数组] [动态规划] [矩阵] |
Medium |
| 561 |
数组拆分 I |
[贪心] [数组] [计数排序] [排序] |
Easy |
| 560 |
和为 K 的子数组 |
[数组] [哈希表] [前缀和] |
Medium |
| 555 |
分割连接字符串 🔒 |
[贪心] [数组] [字符串] |
Medium |
| 554 |
砖墙 |
[数组] [哈希表] |
Medium |
| 553 |
最优除法 |
[数组] [数学] [动态规划] |
Medium |
| 548 |
将数组分割成和相等的子数组 🔒 |
[数组] [前缀和] |
Hard |
| 546 |
移除盒子 |
[记忆化搜索] [数组] [动态规划] |
Hard |
| 542 |
01 矩阵 |
[广度优先搜索] [数组] [动态规划] [矩阵] |
Medium |
| 540 |
有序数组中的单一元素 |
[数组] [二分查找] |
Medium |
| 539 |
最小时间差 |
[数组] [数学] [字符串] [排序] |
Medium |
| 533 |
孤独像素 II 🔒 |
[数组] [哈希表] [矩阵] |
Medium |
| 532 |
数组中的 k-diff 数对 |
[数组] [哈希表] [双指针] [二分查找] [排序] |
Medium |
| 531 |
孤独像素 I 🔒 |
[数组] [哈希表] [矩阵] |
Medium |
| 529 |
扫雷游戏 |
[深度优先搜索] [广度优先搜索] [数组] [矩阵] |
Medium |
| 527 |
单词缩写 🔒 |
[贪心] [字典树] [数组] [字符串] [排序] |
Hard |
| 526 |
优美的排列 |
[位运算] [数组] [动态规划] [回溯] [状态压缩] |
Medium |
| 525 |
连续数组 |
[数组] [哈希表] [前缀和] |
Medium |
| 524 |
通过删除字母匹配到字典里最长单词 |
[数组] [双指针] [字符串] [排序] |
Medium |
| 523 |
连续的子数组和 |
[数组] [哈希表] [数学] [前缀和] |
Medium |
| 522 |
最长特殊序列 II |
[数组] [哈希表] [双指针] [字符串] [排序] |
Medium |
| 518 |
零钱兑换 II |
[数组] [动态规划] |
Medium |
| 517 |
超级洗衣机 |
[贪心] [数组] |
Hard |
| 506 |
相对名次 |
[数组] [排序] [堆（优先队列）] |
Easy |
| 503 |
下一个更大元素 II |
[栈] [数组] [单调栈] |
Medium |
| 502 |
IPO |
[贪心] [数组] [排序] [堆（优先队列）] |
Hard |
| 500 |
键盘行 |
[数组] [哈希表] [字符串] |
Easy |
| 498 |
对角线遍历 |
[数组] [矩阵] [模拟] |
Medium |
| 496 |
下一个更大元素 I |
[栈] [数组] [哈希表] [单调栈] |
Easy |
| 495 |
提莫攻击 |
[数组] [模拟] |
Easy |
| 494 |
目标和 |
[数组] [动态规划] [回溯] |
Medium |
| 493 |
翻转对 |
[树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] |
Hard |
| 491 |
递增子序列 |
[位运算] [数组] [哈希表] [回溯] |
Medium |
| 487 |
最大连续1的个数 II 🔒 |
[数组] [动态规划] [滑动窗口] |
Medium |
| 486 |
预测赢家 |
[递归] [数组] [数学] [动态规划] [博弈] |
Medium |
| 485 |
最大连续 1 的个数 |
[数组] |
Easy |
| 484 |
寻找排列 🔒 |
[栈] [贪心] [数组] |
Medium |
| 480 |
滑动窗口中位数 |
[数组] [哈希表] [滑动窗口] [堆（优先队列）] |
Hard |
| 477 |
汉明距离总和 |
[位运算] [数组] [数学] |
Medium |
| 475 |
供暖器 |
[数组] [双指针] [二分查找] [排序] |
Medium |
| 474 |
一和零 |
[数组] [字符串] [动态规划] |
Medium |
| 473 |
火柴拼正方形 |
[位运算] [数组] [动态规划] [回溯] [状态压缩] |
Medium |
| 472 |
连接词 |
[深度优先搜索] [字典树] [数组] [字符串] [动态规划] |
Hard |
| 465 |
最优账单平衡 🔒 |
[数组] [回溯] |
Hard |
| 463 |
岛屿的周长 |
[深度优先搜索] [广度优先搜索] [数组] [矩阵] |
Easy |
| 462 |
最少移动次数使数组元素相等 II |
[数组] [数学] [排序] |
Medium |
| 457 |
环形数组是否存在循环 |
[数组] [哈希表] [双指针] |
Medium |
| 456 |
132 模式 |
[栈] [数组] [二分查找] [有序集合] [单调栈] |
Medium |
| 455 |
分发饼干 |
[贪心] [数组] [排序] |
Easy |
| 454 |
四数相加 II |
[数组] [哈希表] |
Medium |
| 453 |
最小操作次数使数组元素相等 |
[数组] [数学] |
Easy |
| 452 |
用最少数量的箭引爆气球 |
[贪心] [数组] [排序] |
Medium |
| 448 |
找到所有数组中消失的数字 |
[数组] [哈希表] |
Easy |
| 447 |
回旋镖的数量 |
[数组] [哈希表] [数学] |
Medium |
| 446 |
等差数列划分 II - 子序列 |
[数组] [动态规划] |
Hard |
| 444 |
序列重建 🔒 |
[图] [拓扑排序] [数组] |
Medium |
| 442 |
数组中重复的数据 |
[数组] [哈希表] |
Medium |
| 436 |
寻找右区间 |
[数组] [二分查找] [排序] |
Medium |
| 435 |
无重叠区间 |
[贪心] [数组] [动态规划] [排序] |
Medium |
| 427 |
建立四叉树 |
[树] [数组] [分治] [矩阵] |
Medium |
| 425 |
单词方块 🔒 |
[字典树] [数组] [字符串] [回溯] |
Hard |
| 422 |
有效的单词方块 🔒 |
[数组] [矩阵] |
Easy |
| 421 |
数组中两个数的最大异或值 |
[位运算] [字典树] [数组] [哈希表] |
Medium |
| 419 |
甲板上的战舰 |
[深度优先搜索] [数组] [矩阵] |
Medium |
| 417 |
太平洋大西洋水流问题 |
[深度优先搜索] [广度优先搜索] [数组] [矩阵] |
Medium |
| 416 |
分割等和子集 |
[数组] [动态规划] |
Medium |
| 414 |
第三大的数 |
[数组] [排序] |
Easy |
| 413 |
等差数列划分 |
[数组] [动态规划] |
Medium |
| 410 |
分割数组的最大值 |
[贪心] [数组] [二分查找] [动态规划] |
Hard |
| 407 |
接雨水 II |
[广度优先搜索] [数组] [矩阵] [堆（优先队列）] |
Hard |
| 406 |
根据身高重建队列 |
[贪心] [数组] [排序] |
Medium |
| 403 |
青蛙过河 |
[数组] [动态规划] |
Hard |
| 399 |
除法求值 |
[深度优先搜索] [广度优先搜索] [并查集] [图] [数组] [最短路] |
Medium |
| 393 |
UTF-8 编码验证 |
[位运算] [数组] |
Medium |
| 391 |
完美矩形 |
[数组] [扫描线] |
Hard |
| 384 |
打乱数组 |
[数组] [数学] [随机化] |
Medium |
| 381 |
O(1) 时间插入、删除和获取随机元素 - 允许重复 |
[设计] [数组] [哈希表] [数学] [随机化] |
Hard |
| 380 |
O(1) 时间插入、删除和获取随机元素 |
[设计] [数组] [哈希表] [数学] [随机化] |
Medium |
| 379 |
电话目录管理系统 🔒 |
[设计] [队列] [数组] [哈希表] [链表] |
Medium |
| 378 |
有序矩阵中第 K 小的元素 |
[数组] [二分查找] [矩阵] [排序] [堆（优先队列）] |
Medium |
| 377 |
组合总和 Ⅳ |
[数组] [动态规划] |
Medium |
| 376 |
摆动序列 |
[贪心] [数组] [动态规划] |
Medium |
| 373 |
查找和最小的 K 对数字 |
[数组] [堆（优先队列）] |
Medium |
| 370 |
区间加法 🔒 |
[数组] [前缀和] |
Medium |
| 368 |
最大整除子集 |
[数组] [数学] [动态规划] [排序] |
Medium |
| 363 |
矩形区域不超过 K 的最大数值和 |
[数组] [二分查找] [动态规划] [矩阵] [有序集合] |
Hard |
| 362 |
敲击计数器 🔒 |
[设计] [队列] [数组] [哈希表] [二分查找] |
Medium |
| 361 |
轰炸敌人 🔒 |
[数组] [动态规划] [矩阵] |
Medium |
| 360 |
有序转化数组 🔒 |
[数组] [数学] [双指针] [排序] |
Medium |
| 356 |
直线镜像 🔒 |
[数组] [哈希表] [数学] |
Medium |
| 354 |
俄罗斯套娃信封问题 |
[数组] [二分查找] [动态规划] [排序] |
Hard |
| 353 |
贪吃蛇 🔒 |
[设计] [队列] [数组] [矩阵] |
Medium |
| 350 |
两个数组的交集 II |
[数组] [哈希表] [双指针] [二分查找] [排序] |
Easy |
| 349 |
两个数组的交集 |
[数组] [哈希表] [双指针] [二分查找] [排序] |
Easy |
| 348 |
设计井字棋 🔒 |
[设计] [数组] [哈希表] [矩阵] |
Medium |
| 347 |
前 K 个高频元素 |
[数组] [哈希表] [分治] [桶排序] [计数] [快速选择] [排序] [堆（优先队列）] |
Medium |
| 346 |
数据流中的移动平均值 🔒 |
[设计] [队列] [数组] [数据流] |
Easy |
| 336 |
回文对 |
[字典树] [数组] [哈希表] [字符串] |
Hard |
| 335 |
路径交叉 |
[几何] [数组] [数学] |
Hard |
| 334 |
递增的三元子序列 |
[贪心] [数组] |
Medium |
| 330 |
按要求补齐数组 |
[贪心] [数组] |
Hard |
| 327 |
区间和的个数 |
[树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] |
Hard |
| 325 |
和等于 k 的最长子数组长度 🔒 |
[数组] [哈希表] |
Medium |
| 324 |
摆动排序 II |
[数组] [分治] [快速选择] [排序] |
Medium |
| 322 |
零钱兑换 |
[广度优先搜索] [数组] [动态规划] |
Medium |
| 318 |
最大单词长度乘积 |
[位运算] [数组] [字符串] |
Medium |
| 317 |
离建筑物最近的距离 🔒 |
[广度优先搜索] [数组] [矩阵] |
Hard |
| 315 |
计算右侧小于当前元素的个数 |
[树状数组] [线段树] [数组] [二分查找] [分治] [有序集合] [归并排序] |
Hard |
| 313 |
超级丑数 |
[数组] [哈希表] [数学] [动态规划] [堆（优先队列）] |
Medium |
| 312 |
戳气球 |
[数组] [动态规划] |
Hard |
| 311 |
稀疏矩阵的乘法 🔒 |
[数组] [哈希表] [矩阵] |
Medium |
| 309 |
最佳买卖股票时机含冷冻期 |
[数组] [动态规划] |
Medium |
| 308 |
二维区域和检索 - 可变 🔒 |
[设计] [树状数组] [线段树] [数组] [矩阵] |
Hard |
| 307 |
区域和检索 - 数组可修改 |
[设计] [树状数组] [线段树] [数组] |
Medium |
| 305 |
岛屿数量 II 🔒 |
[并查集] [数组] |
Hard |
| 304 |
二维区域和检索 - 矩阵不可变 |
[设计] [数组] [矩阵] [前缀和] |
Medium |
| 303 |
区域和检索 - 数组不可变 |
[设计] [数组] [前缀和] |
Easy |
| 302 |
包含全部黑色像素的最小矩形 🔒 |
[深度优先搜索] [广度优先搜索] [数组] [二分查找] [矩阵] |
Hard |
| 300 |
最长递增子序列 |
[数组] [二分查找] [动态规划] |
Medium |
| 296 |
最佳的碰头地点 🔒 |
[数组] [数学] [矩阵] [排序] |
Hard |
| 289 |
生命游戏 |
[数组] [矩阵] [模拟] |
Medium |
| 288 |
单词的唯一缩写 🔒 |
[设计] [数组] [哈希表] [字符串] |
Medium |
| 287 |
寻找重复数 |
[位运算] [数组] [双指针] [二分查找] |
Medium |
| 286 |
墙与门 🔒 |
[广度优先搜索] [数组] [矩阵] |
Medium |
| 284 |
顶端迭代器 |
[设计] [数组] [迭代器] |
Medium |
| 283 |
移动零 |
[数组] [双指针] |
Easy |
| 281 |
锯齿迭代器 🔒 |
[设计] [队列] [数组] [迭代器] |
Medium |
| 280 |
摆动排序 🔒 |
[贪心] [数组] [排序] |
Medium |
| 275 |
H 指数 II |
[数组] [二分查找] |
Medium |
| 274 |
H 指数 |
[数组] [计数排序] [排序] |
Medium |
| 271 |
字符串的编码与解码 🔒 |
[设计] [数组] [字符串] |
Medium |
| 269 |
火星词典 🔒 |
[深度优先搜索] [广度优先搜索] [图] [拓扑排序] [数组] [字符串] |
Hard |
| 268 |
丢失的数字 |
[位运算] [数组] [哈希表] [数学] [排序] |
Easy |
| 265 |
粉刷房子 II 🔒 |
[数组] [动态规划] |
Hard |
| 260 |
只出现一次的数字 III |
[位运算] [数组] |
Medium |
| 259 |
较小的三数之和 🔒 |
[数组] [双指针] [二分查找] [排序] |
Medium |
| 256 |
粉刷房子 🔒 |
[数组] [动态规划] |
Medium |
| 254 |
因子的组合 🔒 |
[数组] [回溯] |
Medium |
| 253 |
会议室 II 🔒 |
[贪心] [数组] [双指针] [排序] [堆（优先队列）] |
Medium |
| 252 |
会议室 🔒 |
[数组] [排序] |
Easy |
| 251 |
展开二维向量 🔒 |
[设计] [数组] [双指针] [迭代器] |
Medium |
| 249 |
移位字符串分组 🔒 |
[数组] [哈希表] [字符串] |
Medium |
| 248 |
中心对称数 III 🔒 |
[递归] [数组] [字符串] |
Hard |
| 247 |
中心对称数 II 🔒 |
[递归] [数组] [字符串] |
Medium |
| 245 |
最短单词距离 III 🔒 |
[数组] [字符串] |
Medium |
| 244 |
最短单词距离 II 🔒 |
[设计] [数组] [哈希表] [双指针] [字符串] |
Medium |
| 243 |
最短单词距离 🔒 |
[数组] [字符串] |
Easy |
| 240 |
搜索二维矩阵 II |
[数组] [二分查找] [分治] [矩阵] |
Medium |
| 239 |
滑动窗口最大值 |
[队列] [数组] [滑动窗口] [单调队列] [堆（优先队列）] |
Hard |
| 238 |
除自身以外数组的乘积 |
[数组] [前缀和] |
Medium |
| 229 |
求众数 II |
[数组] [哈希表] [计数] [排序] |
Medium |
| 228 |
汇总区间 |
[数组] |
Easy |
| 221 |
最大正方形 |
[数组] [动态规划] [矩阵] |
Medium |
| 220 |
存在重复元素 III |
[数组] [桶排序] [有序集合] [排序] [滑动窗口] |
Medium |
| 219 |
存在重复元素 II |
[数组] [哈希表] [滑动窗口] |
Easy |
| 218 |
天际线问题 |
[树状数组] [线段树] [数组] [分治] [有序集合] [扫描线] [堆（优先队列）] |
Hard |
| 217 |
存在重复元素 |
[数组] [哈希表] [排序] |
Easy |
| 216 |
组合总和 III |
[数组] [回溯] |
Medium |
| 215 |
数组中的第K个最大元素 |
[数组] [分治] [快速选择] [排序] [堆（优先队列）] |
Medium |
| 213 |
打家劫舍 II |
[数组] [动态规划] |
Medium |
| 212 |
单词搜索 II |
[字典树] [数组] [字符串] [回溯] [矩阵] |
Hard |
| 209 |
长度最小的子数组 |
[数组] [二分查找] [前缀和] [滑动窗口] |
Medium |
| 204 |
计数质数 |
[数组] [数学] [枚举] [数论] |
Medium |
| 200 |
岛屿数量 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 198 |
打家劫舍 |
[数组] [动态规划] |
Medium |
| 189 |
轮转数组 |
[数组] [数学] [双指针] |
Medium |
| 188 |
买卖股票的最佳时机 IV |
[数组] [动态规划] |
Hard |
| 174 |
地下城游戏 |
[数组] [动态规划] [矩阵] |
Hard |
| 170 |
两数之和 III - 数据结构设计 🔒 |
[设计] [数组] [哈希表] [双指针] [数据流] |
Easy |
| 169 |
多数元素 |
[数组] [哈希表] [分治] [计数] [排序] |
Easy |
| 167 |
两数之和 II - 输入有序数组 |
[数组] [双指针] [二分查找] |
Medium |
| 164 |
最大间距 |
[数组] [桶排序] [基数排序] [排序] |
Hard |
| 163 |
缺失的区间 🔒 |
[数组] |
Easy |
| 162 |
寻找峰值 |
[数组] [二分查找] |
Medium |
| 154 |
寻找旋转排序数组中的最小值 II |
[数组] [二分查找] |
Hard |
| 153 |
寻找旋转排序数组中的最小值 |
[数组] [二分查找] |
Medium |
| 152 |
乘积最大子数组 |
[数组] [动态规划] |
Medium |
| 150 |
逆波兰表达式求值 |
[栈] [数组] [数学] |
Medium |
| 149 |
直线上最多的点数 |
[几何] [数组] [哈希表] [数学] |
Hard |
| 137 |
只出现一次的数字 II |
[位运算] [数组] |
Medium |
| 136 |
只出现一次的数字 |
[位运算] [数组] |
Easy |
| 135 |
分发糖果 |
[贪心] [数组] |
Hard |
| 134 |
加油站 |
[贪心] [数组] |
Medium |
| 130 |
被围绕的区域 |
[深度优先搜索] [广度优先搜索] [并查集] [数组] [矩阵] |
Medium |
| 128 |
最长连续序列 |
[并查集] [数组] [哈希表] |
Medium |
| 123 |
买卖股票的最佳时机 III |
[数组] [动态规划] |
Hard |
| 122 |
买卖股票的最佳时机 II |
[贪心] [数组] [动态规划] |
Medium |
| 121 |
买卖股票的最佳时机 |
[数组] [动态规划] |
Easy |
| 120 |
三角形最小路径和 |
[数组] [动态规划] |
Medium |
| 119 |
杨辉三角 II |
[数组] [动态规划] |
Easy |
| 118 |
杨辉三角 |
[数组] [动态规划] |
Easy |
| 108 |
将有序数组转换为二叉搜索树 |
[树] [二叉搜索树] [数组] [分治] [二叉树] |
Easy |
| 106 |
从中序与后序遍历序列构造二叉树 |
[树] [数组] [哈希表] [分治] [二叉树] |
Medium |
| 105 |
从前序与中序遍历序列构造二叉树 |
[树] [数组] [哈希表] [分治] [二叉树] |
Medium |
| 90 |
子集 II |
[位运算] [数组] [回溯] |
Medium |
| 88 |
合并两个有序数组 |
[数组] [双指针] [排序] |
Easy |
| 85 |
最大矩形 |
[栈] [数组] [动态规划] [矩阵] [单调栈] |
Hard |
| 84 |
柱状图中最大的矩形 |
[栈] [数组] [单调栈] |
Hard |
| 81 |
搜索旋转排序数组 II |
[数组] [二分查找] |
Medium |
| 80 |
删除有序数组中的重复项 II |
[数组] [双指针] |
Medium |
| 79 |
单词搜索 |
[数组] [回溯] [矩阵] |
Medium |
| 78 |
子集 |
[位运算] [数组] [回溯] |
Medium |
| 77 |
组合 |
[数组] [回溯] |
Medium |
| 75 |
颜色分类 |
[数组] [双指针] [排序] |
Medium |
| 74 |
搜索二维矩阵 |
[数组] [二分查找] [矩阵] |
Medium |
| 73 |
矩阵置零 |
[数组] [哈希表] [矩阵] |
Medium |
| 66 |
加一 |
[数组] [数学] |
Easy |
| 64 |
最小路径和 |
[数组] [动态规划] [矩阵] |
Medium |
| 63 |
不同路径 II |
[数组] [动态规划] [矩阵] |
Medium |
| 59 |
螺旋矩阵 II |
[数组] [矩阵] [模拟] |
Medium |
| 57 |
插入区间 |
[数组] |
Medium |
| 56 |
合并区间 |
[数组] [排序] |
Medium |
| 55 |
跳跃游戏 |
[贪心] [数组] [动态规划] |
Medium |
| 54 |
螺旋矩阵 |
[数组] [矩阵] [模拟] |
Medium |
| 53 |
最大子数组和 |
[数组] [分治] [动态规划] |
Easy |
| 51 |
N 皇后 |
[数组] [回溯] |
Hard |
| 48 |
旋转图像 |
[数组] [数学] [矩阵] |
Medium |
| 47 |
全排列 II |
[数组] [回溯] |
Medium |
| 46 |
全排列 |
[数组] [回溯] |
Medium |
| 45 |
跳跃游戏 II |
[贪心] [数组] [动态规划] |
Medium |
| 42 |
接雨水 |
[栈] [数组] [双指针] [动态规划] [单调栈] |
Hard |
| 41 |
缺失的第一个正数 |
[数组] [哈希表] |
Hard |
| 40 |
组合总和 II |
[数组] [回溯] |
Medium |
| 39 |
组合总和 |
[数组] [回溯] |
Medium |
| 37 |
解数独 |
[数组] [回溯] [矩阵] |
Hard |
| 36 |
有效的数独 |
[数组] [哈希表] [矩阵] |
Medium |
| 35 |
搜索插入位置 |
[数组] [二分查找] |
Easy |
| 34 |
在排序数组中查找元素的第一个和最后一个位置 |
[数组] [二分查找] |
Medium |
| 33 |
搜索旋转排序数组 |
[数组] [二分查找] |
Medium |
| 31 |
下一个排列 |
[数组] [双指针] |
Medium |
| 27 |
移除元素 |
[数组] [双指针] |
Easy |
| 26 |
删除有序数组中的重复项 |
[数组] [双指针] |
Easy |
| 18 |
四数之和 |
[数组] [双指针] [排序] |
Medium |
| 16 |
最接近的三数之和 |
[数组] [双指针] [排序] |
Medium |
| 15 |
三数之和 |
[数组] [双指针] [排序] |
Medium |
| 11 |
盛最多水的容器 |
[贪心] [数组] [双指针] |
Medium |
| 4 |
寻找两个正序数组的中位数 |
[数组] [二分查找] [分治] |
Hard |
| 1 |
两数之和 |
[数组] [哈希表] |
Easy |