README.md

# LeetCode

[English Version](/solution/README_EN.md)

## 题解

以下所有题目均来源 [LeetCode 中国官网](https://leetcode-cn.com/problemset/all)，题解由 [doocs/leetcode 贡献者](https://github.com/doocs/leetcode/graphs/contributors) 提供，正在完善中，欢迎贡献你的题解！

快速搜索题号、题解、标签等，请善用 <kbd>Control</kbd>+<kbd>F</kbd>（或者 <kbd>Command</kbd>+<kbd>F</kbd>）。


|  题号  |  题解  |  标签  |  难度  | 备注 |
| --- | --- | --- | --- | --- |
|  [0001](https://leetcode-cn.com/problems/two-sum)  |  [两数之和](/solution/0000-0099/0001.Two%20Sum/README.md)  |  `数组`,`哈希表`  |  简单  |    |
|  [0002](https://leetcode-cn.com/problems/add-two-numbers)  |  [两数相加](/solution/0000-0099/0002.Add%20Two%20Numbers/README.md)  |  `递归`,`链表`,`数学`  |  中等  |    |
|  [0003](https://leetcode-cn.com/problems/longest-substring-without-repeating-characters)  |  [无重复字符的最长子串](/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README.md)  |  `哈希表`,`双指针`,`字符串`  |  中等  |    |
|  [0004](https://leetcode-cn.com/problems/median-of-two-sorted-arrays)  |  [寻找两个正序数组的中位数](/solution/0000-0099/0004.Median%20of%20Two%20Sorted%20Arrays/README.md)  |  `数组`,`二分查找`,`分治算法`  |  困难  |    |
|  [0005](https://leetcode-cn.com/problems/longest-palindromic-substring)  |  [最长回文子串](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README.md)  |  `字符串`,`动态规划`  |  中等  |    |
|  [0006](https://leetcode-cn.com/problems/zigzag-conversion)  |  [Z 字形变换](/solution/0000-0099/0006.ZigZag%20Conversion/README.md)  |  `字符串`  |  中等  |    |
|  [0007](https://leetcode-cn.com/problems/reverse-integer)  |  [整数反转](/solution/0000-0099/0007.Reverse%20Integer/README.md)  |  `数学`  |  简单  |    |
|  [0008](https://leetcode-cn.com/problems/string-to-integer-atoi)  |  [字符串转换整数 (atoi)](/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README.md)  |  `数学`,`字符串`  |  中等  |    |
|  [0009](https://leetcode-cn.com/problems/palindrome-number)  |  [回文数](/solution/0000-0099/0009.Palindrome%20Number/README.md)  |  `数学`  |  简单  |    |
|  [0010](https://leetcode-cn.com/problems/regular-expression-matching)  |  [正则表达式匹配](/solution/0000-0099/0010.Regular%20Expression%20Matching/README.md)  |  `字符串`,`动态规划`,`回溯算法`  |  困难  |    |
|  [0011](https://leetcode-cn.com/problems/container-with-most-water)  |  [盛最多水的容器](/solution/0000-0099/0011.Container%20With%20Most%20Water/README.md)  |  `数组`,`双指针`  |  中等  |    |
|  [0012](https://leetcode-cn.com/problems/integer-to-roman)  |  [整数转罗马数字](/solution/0000-0099/0012.Integer%20to%20Roman/README.md)  |  `数学`,`字符串`  |  中等  |    |
|  [0013](https://leetcode-cn.com/problems/roman-to-integer)  |  [罗马数字转整数](/solution/0000-0099/0013.Roman%20to%20Integer/README.md)  |  `数学`,`字符串`  |  简单  |    |
|  [0014](https://leetcode-cn.com/problems/longest-common-prefix)  |  [最长公共前缀](/solution/0000-0099/0014.Longest%20Common%20Prefix/README.md)  |  `字符串`  |  简单  |    |
|  [0015](https://leetcode-cn.com/problems/3sum)  |  [三数之和](/solution/0000-0099/0015.3Sum/README.md)  |  `数组`,`双指针`  |  中等  |    |
|  [0016](https://leetcode-cn.com/problems/3sum-closest)  |  [最接近的三数之和](/solution/0000-0099/0016.3Sum%20Closest/README.md)  |  `数组`,`双指针`  |  中等  |    |
|  [0017](https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number)  |  [电话号码的字母组合](/solution/0000-0099/0017.Letter%20Combinations%20of%20a%20Phone%20Number/README.md)  |  `深度优先搜索`,`递归`,`字符串`,`回溯算法`  |  中等  |    |
|  [0018](https://leetcode-cn.com/problems/4sum)  |  [四数之和](/solution/0000-0099/0018.4Sum/README.md)  |  `数组`,`哈希表`,`双指针`  |  中等  |    |
|  [0019](https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list)  |  [删除链表的倒数第 N 个结点](/solution/0000-0099/0019.Remove%20Nth%20Node%20From%20End%20of%20List/README.md)  |  `链表`,`双指针`  |  中等  |    |
|  [0020](https://leetcode-cn.com/problems/valid-parentheses)  |  [有效的括号](/solution/0000-0099/0020.Valid%20Parentheses/README.md)  |  `栈`,`字符串`  |  简单  |    |
|  [0021](https://leetcode-cn.com/problems/merge-two-sorted-lists)  |  [合并两个有序链表](/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/README.md)  |  `递归`,`链表`  |  简单  |    |
|  [0022](https://leetcode-cn.com/problems/generate-parentheses)  |  [括号生成](/solution/0000-0099/0022.Generate%20Parentheses/README.md)  |  `字符串`,`回溯算法`  |  中等  |    |
|  [0023](https://leetcode-cn.com/problems/merge-k-sorted-lists)  |  [合并K个升序链表](/solution/0000-0099/0023.Merge%20k%20Sorted%20Lists/README.md)  |  `堆`,`链表`,`分治算法`  |  困难  |    |
|  [0024](https://leetcode-cn.com/problems/swap-nodes-in-pairs)  |  [两两交换链表中的节点](/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/README.md)  |  `递归`,`链表`  |  中等  |    |
|  [0025](https://leetcode-cn.com/problems/reverse-nodes-in-k-group)  |  [K 个一组翻转链表](/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/README.md)  |  `链表`  |  困难  |    |
|  [0026](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array)  |  [删除有序数组中的重复项](/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README.md)  |  `数组`,`双指针`  |  简单  |    |
|  [0027](https://leetcode-cn.com/problems/remove-element)  |  [移除元素](/solution/0000-0099/0027.Remove%20Element/README.md)  |  `数组`,`双指针`  |  简单  |    |
|  [0028](https://leetcode-cn.com/problems/implement-strstr)  |  [实现 strStr()](/solution/0000-0099/0028.Implement%20strStr%28%29/README.md)  |  `双指针`,`字符串`  |  简单  |    |
|  [0029](https://leetcode-cn.com/problems/divide-two-integers)  |  [两数相除](/solution/0000-0099/0029.Divide%20Two%20Integers/README.md)  |  `数学`,`二分查找`  |  中等  |    |
|  [0030](https://leetcode-cn.com/problems/substring-with-concatenation-of-all-words)  |  [串联所有单词的子串](/solution/0000-0099/0030.Substring%20with%20Concatenation%20of%20All%20Words/README.md)  |  `哈希表`,`双指针`,`字符串`  |  困难  |    |
|  [0031](https://leetcode-cn.com/problems/next-permutation)  |  [下一个排列](/solution/0000-0099/0031.Next%20Permutation/README.md)  |  `数组`  |  中等  |    |
|  [0032](https://leetcode-cn.com/problems/longest-valid-parentheses)  |  [最长有效括号](/solution/0000-0099/0032.Longest%20Valid%20Parentheses/README.md)  |  `字符串`,`动态规划`  |  困难  |    |
|  [0033](https://leetcode-cn.com/problems/search-in-rotated-sorted-array)  |  [搜索旋转排序数组](/solution/0000-0099/0033.Search%20in%20Rotated%20Sorted%20Array/README.md)  |  `数组`,`二分查找`  |  中等  |    |
|  [0034](https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array)  |  [在排序数组中查找元素的第一个和最后一个位置](/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README.md)  |  `数组`,`二分查找`  |  中等  |    |
|  [0035](https://leetcode-cn.com/problems/search-insert-position)  |  [搜索插入位置](/solution/0000-0099/0035.Search%20Insert%20Position/README.md)  |  `数组`,`二分查找`  |  简单  |    |
|  [0036](https://leetcode-cn.com/problems/valid-sudoku)  |  [有效的数独](/solution/0000-0099/0036.Valid%20Sudoku/README.md)  |  `哈希表`  |  中等  |    |
|  [0037](https://leetcode-cn.com/problems/sudoku-solver)  |  [解数独](/solution/0000-0099/0037.Sudoku%20Solver/README.md)  |  `哈希表`,`回溯算法`  |  困难  |    |
|  [0038](https://leetcode-cn.com/problems/count-and-say)  |  [外观数列](/solution/0000-0099/0038.Count%20and%20Say/README.md)  |  `字符串`  |  中等  |    |
|  [0039](https://leetcode-cn.com/problems/combination-sum)  |  [组合总和](/solution/0000-0099/0039.Combination%20Sum/README.md)  |  `数组`,`回溯算法`  |  中等  |    |
|  [0040](https://leetcode-cn.com/problems/combination-sum-ii)  |  [组合总和 II](/solution/0000-0099/0040.Combination%20Sum%20II/README.md)  |  `数组`,`回溯算法`  |  中等  |    |
|  [0041](https://leetcode-cn.com/problems/first-missing-positive)  |  [缺失的第一个正数](/solution/0000-0099/0041.First%20Missing%20Positive/README.md)  |  `数组`  |  困难  |    |
|  [0042](https://leetcode-cn.com/problems/trapping-rain-water)  |  [接雨水](/solution/0000-0099/0042.Trapping%20Rain%20Water/README.md)  |  `栈`,`数组`,`双指针`,`动态规划`  |  困难  |    |
|  [0043](https://leetcode-cn.com/problems/multiply-strings)  |  [字符串相乘](/solution/0000-0099/0043.Multiply%20Strings/README.md)  |  `数学`,`字符串`  |  中等  |    |
|  [0044](https://leetcode-cn.com/problems/wildcard-matching)  |  [通配符匹配](/solution/0000-0099/0044.Wildcard%20Matching/README.md)  |  `贪心算法`,`字符串`,`动态规划`,`回溯算法`  |  困难  |    |
|  [0045](https://leetcode-cn.com/problems/jump-game-ii)  |  [跳跃游戏 II](/solution/0000-0099/0045.Jump%20Game%20II/README.md)  |  `贪心算法`,`数组`  |  中等  |    |
|  [0046](https://leetcode-cn.com/problems/permutations)  |  [全排列](/solution/0000-0099/0046.Permutations/README.md)  |  `回溯算法`  |  中等  |    |
|  [0047](https://leetcode-cn.com/problems/permutations-ii)  |  [全排列 II](/solution/0000-0099/0047.Permutations%20II/README.md)  |  `回溯算法`  |  中等  |    |
|  [0048](https://leetcode-cn.com/problems/rotate-image)  |  [旋转图像](/solution/0000-0099/0048.Rotate%20Image/README.md)  |  `数组`  |  中等  |    |
|  [0049](https://leetcode-cn.com/problems/group-anagrams)  |  [字母异位词分组](/solution/0000-0099/0049.Group%20Anagrams/README.md)  |  `哈希表`,`字符串`  |  中等  |    |
|  [0050](https://leetcode-cn.com/problems/powx-n)  |  [Pow(x, n)](/solution/0000-0099/0050.Pow%28x%2C%20n%29/README.md)  |  `数学`,`二分查找`  |  中等  |    |
|  [0051](https://leetcode-cn.com/problems/n-queens)  |  [N 皇后](/solution/0000-0099/0051.N-Queens/README.md)  |  `回溯算法`  |  困难  |    |
|  [0052](https://leetcode-cn.com/problems/n-queens-ii)  |  [N皇后 II](/solution/0000-0099/0052.N-Queens%20II/README.md)  |  `回溯算法`  |  困难  |    |
|  [0053](https://leetcode-cn.com/problems/maximum-subarray)  |  [最大子序和](/solution/0000-0099/0053.Maximum%20Subarray/README.md)  |  `数组`,`分治算法`,`动态规划`  |  简单  |    |
|  [0054](https://leetcode-cn.com/problems/spiral-matrix)  |  [螺旋矩阵](/solution/0000-0099/0054.Spiral%20Matrix/README.md)  |  `数组`  |  中等  |    |
|  [0055](https://leetcode-cn.com/problems/jump-game)  |  [跳跃游戏](/solution/0000-0099/0055.Jump%20Game/README.md)  |  `贪心算法`,`数组`  |  中等  |    |
|  [0056](https://leetcode-cn.com/problems/merge-intervals)  |  [合并区间](/solution/0000-0099/0056.Merge%20Intervals/README.md)  |  `排序`,`数组`  |  中等  |    |
|  [0057](https://leetcode-cn.com/problems/insert-interval)  |  [插入区间](/solution/0000-0099/0057.Insert%20Interval/README.md)  |  `排序`,`数组`  |  中等  |    |
|  [0058](https://leetcode-cn.com/problems/length-of-last-word)  |  [最后一个单词的长度](/solution/0000-0099/0058.Length%20of%20Last%20Word/README.md)  |  `字符串`  |  简单  |    |
|  [0059](https://leetcode-cn.com/problems/spiral-matrix-ii)  |  [螺旋矩阵 II](/solution/0000-0099/0059.Spiral%20Matrix%20II/README.md)  |  `数组`  |  中等  |    |
|  [0060](https://leetcode-cn.com/problems/permutation-sequence)  |  [排列序列](/solution/0000-0099/0060.Permutation%20Sequence/README.md)  |  `数学`,`回溯算法`  |  困难  |    |
|  [0061](https://leetcode-cn.com/problems/rotate-list)  |  [旋转链表](/solution/0000-0099/0061.Rotate%20List/README.md)  |  `链表`,`双指针`  |  中等  |    |
|  [0062](https://leetcode-cn.com/problems/unique-paths)  |  [不同路径](/solution/0000-0099/0062.Unique%20Paths/README.md)  |  `数组`,`动态规划`  |  中等  |    |
|  [0063](https://leetcode-cn.com/problems/unique-paths-ii)  |  [不同路径 II](/solution/0000-0099/0063.Unique%20Paths%20II/README.md)  |  `数组`,`动态规划`  |  中等  |    |
|  [0064](https://leetcode-cn.com/problems/minimum-path-sum)  |  [最小路径和](/solution/0000-0099/0064.Minimum%20Path%20Sum/README.md)  |  `数组`,`动态规划`  |  中等  |    |
|  [0065](https://leetcode-cn.com/problems/valid-number)  |  [有效数字](/solution/0000-0099/0065.Valid%20Number/README.md)  |  `数学`,`字符串`  |  困难  |    |
|  [0066](https://leetcode-cn.com/problems/plus-one)  |  [加一](/solution/0000-0099/0066.Plus%20One/README.md)  |  `数组`  |  简单  |    |
|  [0067](https://leetcode-cn.com/problems/add-binary)  |  [二进制求和](/solution/0000-0099/0067.Add%20Binary/README.md)  |  `数学`,`字符串`  |  简单  |    |
|  [0068](https://leetcode-cn.com/problems/text-justification)  |  [文本左右对齐](/solution/0000-0099/0068.Text%20Justification/README.md)  |  `字符串`  |  困难  |    |
|  [0069](https://leetcode-cn.com/problems/sqrtx)  |  [x 的平方根](/solution/0000-0099/0069.Sqrt%28x%29/README.md)  |  `数学`,`二分查找`  |  简单  |    |
|  [0070](https://leetcode-cn.com/problems/climbing-stairs)  |  [爬楼梯](/solution/0000-0099/0070.Climbing%20Stairs/README.md)  |  `动态规划`  |  简单  |    |
|  [0071](https://leetcode-cn.com/problems/simplify-path)  |  [简化路径](/solution/0000-0099/0071.Simplify%20Path/README.md)  |  `栈`,`字符串`  |  中等  |    |
|  [0072](https://leetcode-cn.com/problems/edit-distance)  |  [编辑距离](/solution/0000-0099/0072.Edit%20Distance/README.md)  |  `字符串`,`动态规划`  |  困难  |    |
|  [0073](https://leetcode-cn.com/problems/set-matrix-zeroes)  |  [矩阵置零](/solution/0000-0099/0073.Set%20Matrix%20Zeroes/README.md)  |  `数组`  |  中等  |    |
|  [0074](https://leetcode-cn.com/problems/search-a-2d-matrix)  |  [搜索二维矩阵](/solution/0000-0099/0074.Search%20a%202D%20Matrix/README.md)  |  `数组`,`二分查找`  |  中等  |    |
|  [0075](https://leetcode-cn.com/problems/sort-colors)  |  [颜色分类](/solution/0000-0099/0075.Sort%20Colors/README.md)  |  `排序`,`数组`,`双指针`  |  中等  |    |
|  [0076](https://leetcode-cn.com/problems/minimum-window-substring)  |  [最小覆盖子串](/solution/0000-0099/0076.Minimum%20Window%20Substring/README.md)  |  `哈希表`,`双指针`,`字符串`  |  困难  |    |
|  [0077](https://leetcode-cn.com/problems/combinations)  |  [组合](/solution/0000-0099/0077.Combinations/README.md)  |  `回溯算法`  |  中等  |    |
|  [0078](https://leetcode-cn.com/problems/subsets)  |  [子集](/solution/0000-0099/0078.Subsets/README.md)  |  `位运算`,`数组`,`回溯算法`  |  中等  |    |
|  [0079](https://leetcode-cn.com/problems/word-search)  |  [单词搜索](/solution/0000-0099/0079.Word%20Search/README.md)  |  `数组`,`回溯算法`  |  中等  |    |
|  [0080](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array-ii)  |  [删除有序数组中的重复项 II](/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README.md)  |  `数组`,`双指针`  |  中等  |    |
|  [0081](https://leetcode-cn.com/problems/search-in-rotated-sorted-array-ii)  |  [搜索旋转排序数组 II](/solution/0000-0099/0081.Search%20in%20Rotated%20Sorted%20Array%20II/README.md)  |  `数组`,`二分查找`  |  中等  |    |
|  [0082](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-ii)  |  [删除排序链表中的重复元素 II](/solution/0000-0099/0082.Remove%20Duplicates%20from%20Sorted%20List%20II/README.md)  |  `链表`  |  中等  |    |
|  [0083](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list)  |  [删除排序链表中的重复元素](/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/README.md)  |  `链表`  |  简单  |    |
|  [0084](https://leetcode-cn.com/problems/largest-rectangle-in-histogram)  |  [柱状图中最大的矩形](/solution/0000-0099/0084.Largest%20Rectangle%20in%20Histogram/README.md)  |  `栈`,`数组`  |  困难  |    |
|  [0085](https://leetcode-cn.com/problems/maximal-rectangle)  |  [最大矩形](/solution/0000-0099/0085.Maximal%20Rectangle/README.md)  |  `栈`,`数组`,`哈希表`,`动态规划`  |  困难  |    |
|  [0086](https://leetcode-cn.com/problems/partition-list)  |  [分隔链表](/solution/0000-0099/0086.Partition%20List/README.md)  |  `链表`,`双指针`  |  中等  |    |
|  [0087](https://leetcode-cn.com/problems/scramble-string)  |  [扰乱字符串](/solution/0000-0099/0087.Scramble%20String/README.md)  |  `字符串`,`动态规划`  |  困难  |    |
|  [0088](https://leetcode-cn.com/problems/merge-sorted-array)  |  [合并两个有序数组](/solution/0000-0099/0088.Merge%20Sorted%20Array/README.md)  |  `数组`,`双指针`  |  简单  |    |
|  [0089](https://leetcode-cn.com/problems/gray-code)  |  [格雷编码](/solution/0000-0099/0089.Gray%20Code/README.md)  |  `回溯算法`  |  中等  |    |
|  [0090](https://leetcode-cn.com/problems/subsets-ii)  |  [子集 II](/solution/0000-0099/0090.Subsets%20II/README.md)  |  `数组`,`回溯算法`  |  中等  |    |
|  [0091](https://leetcode-cn.com/problems/decode-ways)  |  [解码方法](/solution/0000-0099/0091.Decode%20Ways/README.md)  |  `字符串`,`动态规划`  |  中等  |    |
|  [0092](https://leetcode-cn.com/problems/reverse-linked-list-ii)  |  [反转链表 II](/solution/0000-0099/0092.Reverse%20Linked%20List%20II/README.md)  |  `链表`  |  中等  |    |
|  [0093](https://leetcode-cn.com/problems/restore-ip-addresses)  |  [复原 IP 地址](/solution/0000-0099/0093.Restore%20IP%20Addresses/README.md)  |  `字符串`,`回溯算法`  |  中等  |    |
|  [0094](https://leetcode-cn.com/problems/binary-tree-inorder-traversal)  |  [二叉树的中序遍历](/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/README.md)  |  `栈`,`树`,`哈希表`  |  简单  |    |
|  [0095](https://leetcode-cn.com/problems/unique-binary-search-trees-ii)  |  [不同的二叉搜索树 II](/solution/0000-0099/0095.Unique%20Binary%20Search%20Trees%20II/README.md)  |  `树`,`动态规划`  |  中等  |    |
|  [0096](https://leetcode-cn.com/problems/unique-binary-search-trees)  |  [不同的二叉搜索树](/solution/0000-0099/0096.Unique%20Binary%20Search%20Trees/README.md)  |  `树`,`动态规划`  |  中等  |    |
|  [0097](https://leetcode-cn.com/problems/interleaving-string)  |  [交错字符串](/solution/0000-0099/0097.Interleaving%20String/README.md)  |  `字符串`,`动态规划`  |  中等  |    |
|  [0098](https://leetcode-cn.com/problems/validate-binary-search-tree)  |  [验证二叉搜索树](/solution/0000-0099/0098.Validate%20Binary%20Search%20Tree/README.md)  |  `树`,`深度优先搜索`,`递归`  |  中等  |    |
|  [0099](https://leetcode-cn.com/problems/recover-binary-search-tree)  |  [恢复二叉搜索树](/solution/0000-0099/0099.Recover%20Binary%20Search%20Tree/README.md)  |  `树`,`深度优先搜索`  |  中等  |    |
|  [0100](https://leetcode-cn.com/problems/same-tree)  |  [相同的树](/solution/0100-0199/0100.Same%20Tree/README.md)  |  `树`,`深度优先搜索`  |  简单  |    |
|  [0101](https://leetcode-cn.com/problems/symmetric-tree)  |  [对称二叉树](/solution/0100-0199/0101.Symmetric%20Tree/README.md)  |  `树`,`深度优先搜索`,`广度优先搜索`  |  简单  |    |
|  [0102](https://leetcode-cn.com/problems/binary-tree-level-order-traversal)  |  [二叉树的层序遍历](/solution/0100-0199/0102.Binary%20Tree%20Level%20Order%20Traversal/README.md)  |  `树`,`广度优先搜索`  |  中等  |    |
|  [0103](https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal)  |  [二叉树的锯齿形层序遍历](/solution/0100-0199/0103.Binary%20Tree%20Zigzag%20Level%20Order%20Traversal/README.md)  |  `栈`,`树`,`广度优先搜索`  |  中等  |    |
|  [0104](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree)  |  [二叉树的最大深度](/solution/0100-0199/0104.Maximum%20Depth%20of%20Binary%20Tree/README.md)  |  `树`,`深度优先搜索`,`递归`  |  简单  |    |
|  [0105](https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal)  |  [从前序与中序遍历序列构造二叉树](/solution/0100-0199/0105.Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/README.md)  |  `树`,`深度优先搜索`,`数组`  |  中等  |    |
|  [0106](https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal)  |  [从中序与后序遍历序列构造二叉树](/solution/0100-0199/0106.Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/README.md)  |  `树`,`深度优先搜索`,`数组`  |  中等  |    |
|  [0107](https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii)  |  [二叉树的层序遍历 II](/solution/0100-0199/0107.Binary%20Tree%20Level%20Order%20Traversal%20II/README.md)  |  `树`,`广度优先搜索`  |  中等  |    |
|  [0108](https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree)  |  [将有序数组转换为二叉搜索树](/solution/0100-0199/0108.Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree/README.md)  |  `树`,`深度优先搜索`  |  简单  |    |
|  [0109](https://leetcode-cn.com/problems/convert-sorted-list-to-binary-search-tree)  |  [有序链表转换二叉搜索树](/solution/0100-0199/0109.Convert%20Sorted%20List%20to%20Binary%20Search%20Tree/README.md)  |  `深度优先搜索`,`链表`  |  中等  |    |
|  [0110](https://leetcode-cn.com/problems/balanced-binary-tree)  |  [平衡二叉树](/solution/0100-0199/0110.Balanced%20Binary%20Tree/README.md)  |  `树`,`深度优先搜索`,`递归`  |  简单  |    |
|  [0111](https://leetcode-cn.com/problems/minimum-depth-of-binary-tree)  |  [二叉树的最小深度](/solution/0100-0199/0111.Minimum%20Depth%20of%20Binary%20Tree/README.md)  |  `树`,`深度优先搜索`,`广度优先搜索`  |  简单  |    |
|  [0112](https://leetcode-cn.com/problems/path-sum)  |  [路径总和](/solution/0100-0199/0112.Path%20Sum/README.md)  |  `树`,`深度优先搜索`  |  简单  |    |
|  [0113](https://leetcode-cn.com/problems/path-sum-ii)  |  [路径总和 II](/solution/0100-0199/0113.Path%20Sum%20II/README.md)  |  `树`,`深度优先搜索`  |  中等  |    |
|  [0114](https://leetcode-cn.com/problems/flatten-binary-tree-to-linked-list)  |  [二叉树展开为链表](/solution/0100-0199/0114.Flatten%20Binary%20Tree%20to%20Linked%20List/README.md)  |  `树`,`深度优先搜索`  |  中等  |    |
|  [0115](https://leetcode-cn.com/problems/distinct-subsequences)  |  [不同的子序列](/solution/0100-0199/0115.Distinct%20Subsequences/README.md)  |  `字符串`,`动态规划`  |  困难  |    |
|  [0116](https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node)  |  [填充每个节点的下一个右侧节点指针](/solution/0100-0199/0116.Populating%20Next%20Right%20Pointers%20in%20Each%20Node/README.md)  |  `树`,`深度优先搜索`,`广度优先搜索`  |  中等  |    |
|  [0117](https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node-ii)  |  [填充每个节点的下一个右侧节点指针 II](/solution/0100-0199/0117.Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II/README.md)  |  `树`,`深度优先搜索`  |  中等  |    |
|  [0118](https://leetcode-cn.com/problems/pascals-triangle)  |  [杨辉三角](/solution/0100-0199/0118.Pascal%27s%20Triangle/README.md)  |  `数组`  |  简单  |    |
|  [0119](https://leetcode-cn.com/problems/pascals-triangle-ii)  |  [杨辉三角 II](/solution/0100-0199/0119.Pascal%27s%20Triangle%20II/README.md)  |  `数组`  |  简单  |    |
|  [0120](https://leetcode-cn.com/problems/triangle)  |  [三角形最小路径和](/solution/0100-0199/0120.Triangle/README.md)  |  `数组`,`动态规划`  |  中等  |    |
|  [0121](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock)  |  [买卖股票的最佳时机](/solution/0100-0199/0121.Best%20Time%20to%20Buy%20and%20Sell%20Stock/README.md)  |  `数组`,`动态规划`  |  简单  |    |
|  [0122](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii)  |  [买卖股票的最佳时机 II](/solution/0100-0199/0122.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II/README.md)  |  `贪心算法`,`数组`  |  简单  |    |
|  [0123](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii)  |  [买卖股票的最佳时机 III](/solution/0100-0199/0123.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III/README.md)  |  `数组`,`动态规划`  |  困难  |    |
|  [0124](https://leetcode-cn.com/problems/binary-tree-maximum-path-sum)  |  [二叉树中的最大路径和](/solution/0100-0199/0124.Binary%20Tree%20Maximum%20Path%20Sum/README.md)  |  `树`,`深度优先搜索`,`递归`  |  困难  |    |
|  [0125](https://leetcode-cn.com/problems/valid-palindrome)  |  [验证回文串](/solution/0100-0199/0125.Valid%20Palindrome/README.md)  |  `双指针`,`字符串`  |  简单  |    |
|  [0126](https://leetcode-cn.com/problems/word-ladder-ii)  |  [单词接龙 II](/solution/0100-0199/0126.Word%20Ladder%20II/README.md)  |  `广度优先搜索`,`数组`,`字符串`,`回溯算法`  |  困难  |    |
|  [0127](https://leetcode-cn.com/problems/word-ladder)  |  [单词接龙](/solution/0100-0199/0127.Word%20Ladder/README.md)  |  `广度优先搜索`  |  困难  |    |
|  [0128](https://leetcode-cn.com/problems/longest-consecutive-sequence)  |  [最长连续序列](/solution/0100-0199/0128.Longest%20Consecutive%20Sequence/README.md)  |  `并查集`,`数组`  |  中等  |    |
|  [0129](https://leetcode-cn.com/problems/sum-root-to-leaf-numbers)  |  [求根节点到叶节点数字之和](/solution/0100-0199/0129.Sum%20Root%20to%20Leaf%20Numbers/README.md)  |  `树`,`深度优先搜索`  |  中等  |    |
|  [0130](https://leetcode-cn.com/problems/surrounded-regions)  |  [被围绕的区域](/solution/0100-0199/0130.Surrounded%20Regions/README.md)  |  `深度优先搜索`,`广度优先搜索`,`并查集`  |  中等  |    |
|  [0131](https://leetcode-cn.com/problems/palindrome-partitioning)  |  [分割回文串](/solution/0100-0199/0131.Palindrome%20Partitioning/README.md)  |  `深度优先搜索`,`动态规划`,`回溯算法`  |  中等  |    |
|  [0132](https://leetcode-cn.com/problems/palindrome-partitioning-ii)  |  [分割回文串 II](/solution/0100-0199/0132.Palindrome%20Partitioning%20II/README.md)  |  `动态规划`  |  困难  |    |
|  [0133](https://leetcode-cn.com/problems/clone-graph)  |  [克隆图](/solution/0100-0199/0133.Clone%20Graph/README.md)  |  `深度优先搜索`,`广度优先搜索`,`图`  |  中等  |    |
|  [0134](https://leetcode-cn.com/problems/gas-station)  |  [加油站](/solution/0100-0199/0134.Gas%20Station/README.md)  |  `贪心算法`  |  中等  |    |
|  [0135](https://leetcode-cn.com/problems/candy)  |  [分发糖果](/solution/0100-0199/0135.Candy/README.md)  |  `贪心算法`  |  困难  |    |
|  [0136](https://leetcode-cn.com/problems/single-number)  |  [只出现一次的数字](/solution/0100-0199/0136.Single%20Number/README.md)  |  `位运算`,`哈希表`  |  简单  |    |
|  [0137](https://leetcode-cn.com/problems/single-number-ii)  |  [只出现一次的数字 II](/solution/0100-0199/0137.Single%20Number%20II/README.md)  |  `位运算`  |  中等  |    |
|  [0138](https://leetcode-cn.com/problems/copy-list-with-random-pointer)  |  [复制带随机指针的链表](/solution/0100-0199/0138.Copy%20List%20with%20Random%20Pointer/README.md)  |  `哈希表`,`链表`  |  中等  |    |
|  [0139](https://leetcode-cn.com/problems/word-break)  |  [单词拆分](/solution/0100-0199/0139.Word%20Break/README.md)  |  `动态规划`  |  中等  |    |
|  [0140](https://leetcode-cn.com/problems/word-break-ii)  |  [单词拆分 II](/solution/0100-0199/0140.Word%20Break%20II/README.md)  |  `动态规划`,`回溯算法`  |  困难  |    |
|  [0141](https://leetcode-cn.com/problems/linked-list-cycle)  |  [环形链表](/solution/0100-0199/0141.Linked%20List%20Cycle/README.md)  |  `链表`,`双指针`  |  简单  |    |
|  [0142](https://leetcode-cn.com/problems/linked-list-cycle-ii)  |  [环形链表 II](/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README.md)  |  `链表`,`双指针`  |  中等  |    |
|  [0143](https://leetcode-cn.com/problems/reorder-list)  |  [重排链表](/solution/0100-0199/0143.Reorder%20List/README.md)  |  `链表`  |  中等  |    |
|  [0144](https://leetcode-cn.com/problems/binary-tree-preorder-traversal)  |  [二叉树的前序遍历](/solution/0100-0199/0144.Binary%20Tree%20Preorder%20Traversal/README.md)  |  `栈`,`树`  |  简单  |    |
|  [0145](https://leetcode-cn.com/problems/binary-tree-postorder-traversal)  |  [二叉树的后序遍历](/solution/0100-0199/0145.Binary%20Tree%20Postorder%20Traversal/README.md)  |  `栈`,`树`  |  简单  |    |
|  [0146](https://leetcode-cn.com/problems/lru-cache)  |  [LRU 缓存机制](/solution/0100-0199/0146.LRU%20Cache/README.md)  |  `设计`  |  中等  |    |
|  [0147](https://leetcode-cn.com/problems/insertion-sort-list)  |  [对链表进行插入排序](/solution/0100-0199/0147.Insertion%20Sort%20List/README.md)  |  `排序`,`链表`  |  中等  |    |
|  [0148](https://leetcode-cn.com/problems/sort-list)  |  [排序链表](/solution/0100-0199/0148.Sort%20List/README.md)  |  `排序`,`链表`  |  中等  |    |
|  [0149](https://leetcode-cn.com/problems/max-points-on-a-line)  |  [直线上最多的点数](/solution/0100-0199/0149.Max%20Points%20on%20a%20Line/README.md)  |  `哈希表`,`数学`  |  困难  |    |
|  [0150](https://leetcode-cn.com/problems/evaluate-reverse-polish-notation)  |  [逆波兰表达式求值](/solution/0100-0199/0150.Evaluate%20Reverse%20Polish%20Notation/README.md)  |  `栈`  |  中等  |    |
|  [0151](https://leetcode-cn.com/problems/reverse-words-in-a-string)  |  [翻转字符串里的单词](/solution/0100-0199/0151.Reverse%20Words%20in%20a%20String/README.md)  |  `字符串`  |  中等  |    |
|  [0152](https://leetcode-cn.com/problems/maximum-product-subarray)  |  [乘积最大子数组](/solution/0100-0199/0152.Maximum%20Product%20Subarray/README.md)  |  `数组`,`动态规划`  |  中等  |    |
|  [0153](https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array)  |  [寻找旋转排序数组中的最小值](/solution/0100-0199/0153.Find%20Minimum%20in%20Rotated%20Sorted%20Array/README.md)  |  `数组`,`二分查找`  |  中等  |    |
|  [0154](https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array-ii)  |  [寻找旋转排序数组中的最小值 II](/solution/0100-0199/0154.Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II/README.md)  |  `数组`,`二分查找`  |  困难  |    |
|  [0155](https://leetcode-cn.com/problems/min-stack)  |  [最小栈](/solution/0100-0199/0155.Min%20Stack/README.md)  |  `栈`,`设计`  |  简单  |    |
|  [0156](https://leetcode-cn.com/problems/binary-tree-upside-down)  |  [上下翻转二叉树](/solution/0100-0199/0156.Binary%20Tree%20Upside%20Down/README.md)  |  `树`  |  中等  |  🔒  |
|  [0157](https://leetcode-cn.com/problems/read-n-characters-given-read4)  |  [用 Read4 读取 N 个字符](/solution/0100-0199/0157.Read%20N%20Characters%20Given%20Read4/README.md)  |  `字符串`  |  简单  |  🔒  |
|  [0158](https://leetcode-cn.com/problems/read-n-characters-given-read4-ii-call-multiple-times)  |  [用 Read4 读取 N 个字符 II](/solution/0100-0199/0158.Read%20N%20Characters%20Given%20Read4%20II%20-%20Call%20multiple%20times/README.md)  |  `字符串`  |  困难  |  🔒  |
|  [0159](https://leetcode-cn.com/problems/longest-substring-with-at-most-two-distinct-characters)  |  [至多包含两个不同字符的最长子串](/solution/0100-0199/0159.Longest%20Substring%20with%20At%20Most%20Two%20Distinct%20Characters/README.md)  |  `哈希表`,`双指针`,`字符串`  |  中等  |  🔒  |
|  [0160](https://leetcode-cn.com/problems/intersection-of-two-linked-lists)  |  [相交链表](/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/README.md)  |  `链表`  |  简单  |    |
|  [0161](https://leetcode-cn.com/problems/one-edit-distance)  |  [相隔为 1 的编辑距离](/solution/0100-0199/0161.One%20Edit%20Distance/README.md)  |  `字符串`  |  中等  |  🔒  |
|  [0162](https://leetcode-cn.com/problems/find-peak-element)  |  [寻找峰值](/solution/0100-0199/0162.Find%20Peak%20Element/README.md)  |  `数组`,`二分查找`  |  中等  |    |
|  [0163](https://leetcode-cn.com/problems/missing-ranges)  |  [缺失的区间](/solution/0100-0199/0163.Missing%20Ranges/README.md)  |  `数组`  |  简单  |  🔒  |
|  [0164](https://leetcode-cn.com/problems/maximum-gap)  |  [最大间距](/solution/0100-0199/0164.Maximum%20Gap/README.md)  |  `排序`  |  困难  |    |
|  [0165](https://leetcode-cn.com/problems/compare-version-numbers)  |  [比较版本号](/solution/0100-0199/0165.Compare%20Version%20Numbers/README.md)  |  `字符串`  |  中等  |    |
|  [0166](https://leetcode-cn.com/problems/fraction-to-recurring-decimal)  |  [分数到小数](/solution/0100-0199/0166.Fraction%20to%20Recurring%20Decimal/README.md)  |  `哈希表`,`数学`  |  中等  |    |
|  [0167](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted)  |  [两数之和 II - 输入有序数组](/solution/0100-0199/0167.Two%20Sum%20II%20-%20Input%20array%20is%20sorted/README.md)  |  `数组`,`双指针`,`二分查找`  |  简单  |    |
|  [0168](https://leetcode-cn.com/problems/excel-sheet-column-title)  |  [Excel表列名称](/solution/0100-0199/0168.Excel%20Sheet%20Column%20Title/README.md)  |  `数学`  |  简单  |    |
|  [0169](https://leetcode-cn.com/problems/majority-element)  |  [多数元素](/solution/0100-0199/0169.Majority%20Element/README.md)  |  `位运算`,`数组`,`分治算法`  |  简单  |    |
|  [0170](https://leetcode-cn.com/problems/two-sum-iii-data-structure-design)  |  [两数之和 III - 数据结构设计](/solution/0100-0199/0170.Two%20Sum%20III%20-%20Data%20structure%20design/README.md)  |  `设计`,`哈希表`  |  简单  |  🔒  |
|  [0171](https://leetcode-cn.com/problems/excel-sheet-column-number)  |  [Excel表列序号](/solution/0100-0199/0171.Excel%20Sheet%20Column%20Number/README.md)  |  `数学`  |  简单  |    |
|  [0172](https://leetcode-cn.com/problems/factorial-trailing-zeroes)  |  [阶乘后的零](/solution/0100-0199/0172.Factorial%20Trailing%20Zeroes/README.md)  |  `数学`  |  简单  |    |
|  [0173](https://leetcode-cn.com/problems/binary-search-tree-iterator)  |  [二叉搜索树迭代器](/solution/0100-0199/0173.Binary%20Search%20Tree%20Iterator/README.md)  |  `栈`,`树`,`设计`  |  中等  |    |
|  [0174](https://leetcode-cn.com/problems/dungeon-game)  |  [地下城游戏](/solution/0100-0199/0174.Dungeon%20Game/README.md)  |  `二分查找`,`动态规划`  |  困难  |    |
|  [0175](https://leetcode-cn.com/problems/combine-two-tables)  |  [组合两个表](/solution/0100-0199/0175.Combine%20Two%20Tables/README.md)  |    |  简单  |    |
|  [0176](https://leetcode-cn.com/problems/second-highest-salary)  |  [第二高的薪水](/solution/0100-0199/0176.Second%20Highest%20Salary/README.md)  |    |  简单  |    |
|  [0177](https://leetcode-cn.com/problems/nth-highest-salary)  |  [第N高的薪水](/solution/0100-0199/0177.Nth%20Highest%20Salary/README.md)  |    |  中等  |    |
|  [0178](https://leetcode-cn.com/problems/rank-scores)  |  [分数排名](/solution/0100-0199/0178.Rank%20Scores/README.md)  |    |  中等  |    |
|  [0179](https://leetcode-cn.com/problems/largest-number)  |  [最大数](/solution/0100-0199/0179.Largest%20Number/README.md)  |  `排序`  |  中等  |    |
|  [0180](https://leetcode-cn.com/problems/consecutive-numbers)  |  [连续出现的数字](/solution/0100-0199/0180.Consecutive%20Numbers/README.md)  |    |  中等  |    |
|  [0181](https://leetcode-cn.com/problems/employees-earning-more-than-their-managers)  |  [超过经理收入的员工](/solution/0100-0199/0181.Employees%20Earning%20More%20Than%20Their%20Managers/README.md)  |    |  简单  |    |
|  [0182](https://leetcode-cn.com/problems/duplicate-emails)  |  [查找重复的电子邮箱](/solution/0100-0199/0182.Duplicate%20Emails/README.md)  |    |  简单  |    |
|  [0183](https://leetcode-cn.com/problems/customers-who-never-order)  |  [从不订购的客户](/solution/0100-0199/0183.Customers%20Who%20Never%20Order/README.md)  |    |  简单  |    |
|  [0184](https://leetcode-cn.com/problems/department-highest-salary)  |  [部门工资最高的员工](/solution/0100-0199/0184.Department%20Highest%20Salary/README.md)  |    |  中等  |    |
|  [0185](https://leetcode-cn.com/problems/department-top-three-salaries)  |  [部门工资前三高的所有员工](/solution/0100-0199/0185.Department%20Top%20Three%20Salaries/README.md)  |    |  困难  |    |
|  [0186](https://leetcode-cn.com/problems/reverse-words-in-a-string-ii)  |  [翻转字符串里的单词 II](/solution/0100-0199/0186.Reverse%20Words%20in%20a%20String%20II/README.md)  |  `字符串`  |  中等  |  🔒  |
|  [0187](https://leetcode-cn.com/problems/repeated-dna-sequences)  |  [重复的DNA序列](/solution/0100-0199/0187.Repeated%20DNA%20Sequences/README.md)  |  `位运算`,`哈希表`  |  中等  |    |
|  [0188](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv)  |  [买卖股票的最佳时机 IV](/solution/0100-0199/0188.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20IV/README.md)  |  `动态规划`  |  困难  |    |
|  [0189](https://leetcode-cn.com/problems/rotate-array)  |  [旋转数组](/solution/0100-0199/0189.Rotate%20Array/README.md)  |  `数组`  |  中等  |    |
|  [0190](https://leetcode-cn.com/problems/reverse-bits)  |  [颠倒二进制位](/solution/0100-0199/0190.Reverse%20Bits/README.md)  |  `位运算`  |  简单  |    |
|  [0191](https://leetcode-cn.com/problems/number-of-1-bits)  |  [位1的个数](/solution/0100-0199/0191.Number%20of%201%20Bits/README.md)  |  `位运算`  |  简单  |    |
|  [0192](https://leetcode-cn.com/problems/word-frequency)  |  [统计词频](/solution/0100-0199/0192.Word%20Frequency/README.md)  |    |  中等  |    |
|  [0193](https://leetcode-cn.com/problems/valid-phone-numbers)  |  [有效电话号码](/solution/0100-0199/0193.Valid%20Phone%20Numbers/README.md)  |    |  简单  |    |
|  [0194](https://leetcode-cn.com/problems/transpose-file)  |  [转置文件](/solution/0100-0199/0194.Transpose%20File/README.md)  |    |  中等  |    |
|  [0195](https://leetcode-cn.com/problems/tenth-line)  |  [第十行](/solution/0100-0199/0195.Tenth%20Line/README.md)  |    |  简单  |    |
|  [0196](https://leetcode-cn.com/problems/delete-duplicate-emails)  |  [删除重复的电子邮箱](/solution/0100-0199/0196.Delete%20Duplicate%20Emails/README.md)  |    |  简单  |    |
|  [0197](https://leetcode-cn.com/problems/rising-temperature)  |  [上升的温度](/solution/0100-0199/0197.Rising%20Temperature/README.md)  |    |  简单  |    |
|  [0198](https://leetcode-cn.com/problems/house-robber)  |  [打家劫舍](/solution/0100-0199/0198.House%20Robber/README.md)  |  `动态规划`  |  中等  |    |
|  [0199](https://leetcode-cn.com/problems/binary-tree-right-side-view)  |  [二叉树的右视图](/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/README.md)  |  `树`,`深度优先搜索`,`广度优先搜索`,`递归`,`队列`  |  中等  |    |
|  [0200](https://leetcode-cn.com/problems/number-of-islands)  |  [岛屿数量](/solution/0200-0299/0200.Number%20of%20Islands/README.md)  |  `深度优先搜索`,`广度优先搜索`,`并查集`  |  中等  |    |
|  [0201](https://leetcode-cn.com/problems/bitwise-and-of-numbers-range)  |  [数字范围按位与](/solution/0200-0299/0201.Bitwise%20AND%20of%20Numbers%20Range/README.md)  |  `位运算`  |  中等  |    |
|  [0202](https://leetcode-cn.com/problems/happy-number)  |  [快乐数](/solution/0200-0299/0202.Happy%20Number/README.md)  |  `哈希表`,`数学`  |  简单  |    |
|  [0203](https://leetcode-cn.com/problems/remove-linked-list-elements)  |  [移除链表元素](/solution/0200-0299/0203.Remove%20Linked%20List%20Elements/README.md)  |  `链表`  |  简单  |    |
|  [0204](https://leetcode-cn.com/problems/count-primes)  |  [计数质数](/solution/0200-0299/0204.Count%20Primes/README.md)  |  `哈希表`,`数学`  |  简单  |    |
|  [0205](https://leetcode-cn.com/problems/isomorphic-strings)  |  [同构字符串](/solution/0200-0299/0205.Isomorphic%20Strings/README.md)  |  `哈希表`  |  简单  |    |
|  [0206](https://leetcode-cn.com/problems/reverse-linked-list)  |  [反转链表](/solution/0200-0299/0206.Reverse%20Linked%20List/README.md)  |  `链表`  |  简单  |    |
|  [0207](https://leetcode-cn.com/problems/course-schedule)  |  [课程表](/solution/0200-0299/0207.Course%20Schedule/README.md)  |  `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序`  |  中等  |    |
|  [0208](https://leetcode-cn.com/problems/implement-trie-prefix-tree)  |  [实现 Trie (前缀树)](/solution/0200-0299/0208.Implement%20Trie%20%28Prefix%20Tree%29/README.md)  |  `设计`,`字典树`  |  中等  |    |
|  [0209](https://leetcode-cn.com/problems/minimum-size-subarray-sum)  |  [长度最小的子数组](/solution/0200-0299/0209.Minimum%20Size%20Subarray%20Sum/README.md)  |  `数组`,`双指针`,`二分查找`  |  中等  |    |
|  [0210](https://leetcode-cn.com/problems/course-schedule-ii)  |  [课程表 II](/solution/0200-0299/0210.Course%20Schedule%20II/README.md)  |  `深度优先搜索`,`广度优先搜索`,`图`,`拓扑排序`  |  中等  |    |
|  [0211](https://leetcode-cn.com/problems/design-add-and-search-words-data-structure)  |  [添加与搜索单词 - 数据结构设计](/solution/0200-0299/0211.Design%20Add%20and%20Search%20Words%20Data%20Structure/README.md)  |  `深度优先搜索`,`设计`,`字典树`,`回溯算法`  |  中等  |    |
|  [0212](https://leetcode-cn.com/problems/word-search-ii)  |  [单词搜索 II](/solution/0200-0299/0212.Word%20Search%20II/README.md)  |  `字典树`,`回溯算法`  |  困难  |    |
|  [0213](https://leetcode-cn.com/problems/house-robber-ii)  |  [打家劫舍 II](/solution/0200-0299/0213.House%20Robber%20II/README.md)  |  `动态规划`  |  中等  |    |
|  [0214](https://leetcode-cn.com/problems/shortest-palindrome)  |  [最短回文串](/solution/0200-0299/0214.Shortest%20Palindrome/README.md)  |  `字符串`  |  困难  |    |
|  [0215](https://leetcode-cn.com/problems/kth-largest-element-in-an-array)  |  [数组中的第K个最大元素](/solution/0200-0299/0215.Kth%20Largest%20Element%20in%20an%20Array/README.md)  |  `堆`,`分治算法`  |  中等  |    |
|  [0216](https://leetcode-cn.com/problems/combination-sum-iii)  |  [组合总和 III](/solution/0200-0299/0216.Combination%20Sum%20III/README.md)  |  `数组`,`回溯算法`  |  中等  |    |
|  [0217](https://leetcode-cn.com/problems/contains-duplicate)  |  [存在重复元素](/solution/0200-0299/0217.Contains%20Duplicate/README.md)  |  `数组`,`哈希表`  |  简单  |    |
|  [0218](https://leetcode-cn.com/problems/the-skyline-problem)  |  [天际线问题](/solution/0200-0299/0218.The%20Skyline%20Problem/README.md)  |  `堆`,`树状数组`,`线段树`,`分治算法`  |  困难  |    |
|  [0219](https://leetcode-cn.com/problems/contains-duplicate-ii)  |  [存在重复元素 II](/solution/0200-0299/0219.Contains%20Duplicate%20II/README.md)  |  `数组`,`哈希表`  |  简单  |    |
|  [0220](https://leetcode-cn.com/problems/contains-duplicate-iii)  |  [存在重复元素 III](/solution/0200-0299/0220.Contains%20Duplicate%20III/README.md)  |  `排序`  |  中等  |    |
|  [0221](https://leetcode-cn.com/problems/maximal-square)  |  [最大正方形](/solution/0200-0299/0221.Maximal%20Square/README.md)  |  `动态规划`  |  中等  |    |
|  [0222](https://leetcode-cn.com/problems/count-complete-tree-nodes)  |  [完全二叉树的节点个数](/solution/0200-0299/0222.Count%20Complete%20Tree%20Nodes/README.md)  |  `树`,`二分查找`  |  中等  |    |
|  [0223](https://leetcode-cn.com/problems/rectangle-area)  |  [矩形面积](/solution/0200-0299/0223.Rectangle%20Area/README.md)  |  `数学`  |  中等  |    |
|  [0224](https://leetcode-cn.com/problems/basic-calculator)  |  [基本计算器](/solution/0200-0299/0224.Basic%20Calculator/README.md)  |  `栈`,`数学`  |  困难  |    |
|  [0225](https://leetcode-cn.com/problems/implement-stack-using-queues)  |  [用队列实现栈](/solution/0200-0299/0225.Implement%20Stack%20using%20Queues/README.md)  |  `栈`,`设计`  |  简单  |    |
|  [0226](https://leetcode-cn.com/problems/invert-binary-tree)  |  [翻转二叉树](/solution/0200-0299/0226.Invert%20Binary%20Tree/README.md)  |  `树`  |  简单  |    |
|  [0227](https://leetcode-cn.com/problems/basic-calculator-ii)  |  [基本计算器 II](/solution/0200-0299/0227.Basic%20Calculator%20II/README.md)  |  `栈`,`字符串`  |  中等  |    |
|  [0228](https://leetcode-cn.com/problems/summary-ranges)  |  [汇总区间](/solution/0200-0299/0228.Summary%20Ranges/README.md)  |  `数组`  |  简单  |    |
|  [0229](https://leetcode-cn.com/problems/majority-element-ii)  |  [求众数 II](/solution/0200-0299/0229.Majority%20Element%20II/README.md)  |  `数组`  |  中等  |    |
|  [0230](https://leetcode-cn.com/problems/kth-smallest-element-in-a-bst)  |  [二叉搜索树中第K小的元素](/solution/0200-0299/0230.Kth%20Smallest%20Element%20in%20a%20BST/README.md)  |  `树`,`二分查找`  |  中等  |    |
|  [0231](https://leetcode-cn.com/problems/power-of-two)  |  [2 的幂](/solution/0200-0299/0231.Power%20of%20Two/README.md)  |  `位运算`,`数学`  |  简单  |    |
|  [0232](https://leetcode-cn.com/problems/implement-queue-using-stacks)  |  [用栈实现队列](/solution/0200-0299/0232.Implement%20Queue%20using%20Stacks/README.md)  |  `栈`,`设计`  |  简单  |    |
|  [0233](https://leetcode-cn.com/problems/number-of-digit-one)  |  [数字 1 的个数](/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md)  |  `数学`  |  困难  |    |
|  [0234](https://leetcode-cn.com/problems/palindrome-linked-list)  |  [回文链表](/solution/0200-0299/0234.Palindrome%20Linked%20List/README.md)  |  `链表`,`双指针`  |  简单  |    |
|  [0235](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-search-tree)  |  [二叉搜索树的最近公共祖先](/solution/0200-0299/0235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/README.md)  |  `树`  |  简单  |    |
|  [0236](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree)  |  [二叉树的最近公共祖先](/solution/0200-0299/0236.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/README.md)  |  `树`  |  中等  |    |
|  [0237](https://leetcode-cn.com/problems/delete-node-in-a-linked-list)  |  [删除链表中的节点](/solution/0200-0299/0237.Delete%20Node%20in%20a%20Linked%20List/README.md)  |  `链表`  |  简单  |    |
|  [0238](https://leetcode-cn.com/problems/product-of-array-except-self)  |  [除自身以外数组的乘积](/solution/0200-0299/0238.Product%20of%20Array%20Except%20Self/README.md)  |  `数组`  |  中等  |    |
|  [0239](https://leetcode-cn.com/problems/sliding-window-maximum)  |  [滑动窗口最大值](/solution/0200-0299/0239.Sliding%20Window%20Maximum/README.md)  |  `堆`  |  困难  |    |
|  [0240](https://leetcode-cn.com/problems/search-a-2d-matrix-ii)  |  [搜索二维矩阵 II](/solution/0200-0299/0240.Search%20a%202D%20Matrix%20II/README.md)  |  `二分查找`,`分治算法`  |  中等  |    |
|  [0241](https://leetcode-cn.com/problems/different-ways-to-add-parentheses)  |  [为运算表达式设计优先级](/solution/0200-0299/0241.Different%20Ways%20to%20Add%20Parentheses/README.md)  |  `分治算法`  |  中等  |    |
|  [0242](https://leetcode-cn.com/problems/valid-anagram)  |  [有效的字母异位词](/solution/0200-0299/0242.Valid%20Anagram/README.md)  |  `排序`,`哈希表`  |  简单  |    |
|  [0243](https://leetcode-cn.com/problems/shortest-word-distance)  |  [最短单词距离](/solution/0200-0299/0243.Shortest%20Word%20Distance/README.md)  |  `数组`  |  简单  |  🔒  |
|  [0244](https://leetcode-cn.com/problems/shortest-word-distance-ii)  |  [最短单词距离 II](/solution/0200-0299/0244.Shortest%20Word%20Distance%20II/README.md)  |  `设计`,`哈希表`  |  中等  |  🔒  |
|  [0245](https://leetcode-cn.com/problems/shortest-word-distance-iii)  |  [最短单词距离 III](/solution/0200-0299/0245.Shortest%20Word%20Distance%20III/README.md)  |  `数组`  |  中等  |  🔒  |
|  [0246](https://leetcode-cn.com/problems/strobogrammatic-number)  |  [中心对称数](/solution/0200-0299/0246.Strobogrammatic%20Number/README.md)  |  `哈希表`,`数学`  |  简单  |  🔒  |
|  [0247](https://leetcode-cn.com/problems/strobogrammatic-number-ii)  |  [中心对称数 II](/solution/0200-0299/0247.Strobogrammatic%20Number%20II/README.md)  |  `递归`,`数学`  |  中等  |  🔒  |
|  [0248](https://leetcode-cn.com/problems/strobogrammatic-number-iii)  |  [中心对称数 III](/solution/0200-0299/0248.Strobogrammatic%20Number%20III/README.md)  |  `递归`,`数学`  |  困难  |  🔒  |
|  [0249](https://leetcode-cn.com/problems/group-shifted-strings)  |  [移位字符串分组](/solution/0200-0299/0249.Group%20Shifted%20Strings/README.md)  |  `哈希表`,`字符串`  |  中等  |  🔒  |
|  [0250](https://leetcode-cn.com/problems/count-univalue-subtrees)  |  [统计同值子树](/solution/0200-0299/0250.Count%20Univalue%20Subtrees/README.md)  |  `树`  |  中等  |  🔒  |
|  [0251](https://leetcode-cn.com/problems/flatten-2d-vector)  |  [展开二维向量](/solution/0200-0299/0251.Flatten%202D%20Vector/README.md)  |  `设计`  |  中等  |  🔒  |
|  [0252](https://leetcode-cn.com/problems/meeting-rooms)  |  [会议室](/solution/0200-0299/0252.Meeting%20Rooms/README.md)  |  `排序`  |  简单  |  🔒  |
|  [0253](https://leetcode-cn.com/problems/meeting-rooms-ii)  |  [会议室 II](/solution/0200-0299/0253.Meeting%20Rooms%20II/README.md)  |  `堆`,`贪心算法`,`排序`  |  中等  |  🔒  |
|  [0254](https://leetcode-cn.com/problems/factor-combinations)  |  [因子的组合](/solution/0200-0299/0254.Factor%20Combinations/README.md)  |  `回溯算法`  |  中等  |  🔒  |
|  [0255](https://leetcode-cn.com/problems/verify-preorder-sequence-in-binary-search-tree)  |  [验证前序遍历序列二叉搜索树](/solution/0200-0299/0255.Verify%20Preorder%20Sequence%20in%20Binary%20Search%20Tree/README.md)  |  `栈`,`树`  |  中等  |  🔒  |
|  [0256](https://leetcode-cn.com/problems/paint-house)  |  [粉刷房子](/solution/0200-0299/0256.Paint%20House/README.md)  |  `动态规划`  |  中等  |  🔒  |
|  [0257](https://leetcode-cn.com/problems/binary-tree-paths)  |  [二叉树的所有路径](/solution/0200-0299/0257.Binary%20Tree%20Paths/README.md)  |  `树`,`深度优先搜索`  |  简单  |    |
|  [0258](https://leetcode-cn.com/problems/add-digits)  |  [各位相加](/solution/0200-0299/0258.Add%20Digits/README.md)  |  `数学`  |  简单  |    |
|  [0259](https://leetcode-cn.com/problems/3sum-smaller)  |  [较小的三数之和](/solution/0200-0299/0259.3Sum%20Smaller/README.md)  |  `数组`,`双指针`  |  中等  |  🔒  |
|  [0260](https://leetcode-cn.com/problems/single-number-iii)  |  [只出现一次的数字 III](/solution/0200-0299/0260.Single%20Number%20III/README.md)  |  `位运算`  |  中等  |    |
|  [0261](https://leetcode-cn.com/problems/graph-valid-tree)  |  [以图判树](/solution/0200-0299/0261.Graph%20Valid%20Tree/README.md)  |  `深度优先搜索`,`广度优先搜索`,`并查集`,`图`  |  中等  |  🔒  |
|  [0262](https://leetcode-cn.com/problems/trips-and-users)  |  [行程和用户](/solution/0200-0299/0262.Trips%20and%20Users/README.md)  |    |  困难  |    |
|  [0263](https://leetcode-cn.com/problems/ugly-number)  |  [丑数](/solution/0200-0299/0263.Ugly%20Number/README.md)  |  `数学`  |  简单  |    |
|  [0264](https://leetcode-cn.com/problems/ugly-number-ii)  |  [丑数 II](/solution/0200-0299/0264.Ugly%20Number%20II/README.md)  |  `堆`,`数学`,`动态规划`  |  中等  |    |
|  [0265](https://leetcode-cn.com/problems/paint-house-ii)  |  [粉刷房子 II](/solution/0200-0299/0265.Paint%20House%20II/README.md)  |  `动态规划`  |  困难  |  🔒  |
|  [0266](https://leetcode-cn.com/problems/palindrome-permutation)  |  [回文排列](/solution/0200-0299/0266.Palindrome%20Permutation/README.md)  |  `哈希表`  |  简单  |  🔒  |
|  [0267](https://leetcode-cn.com/problems/palindrome-permutation-ii)  |  [回文排列 II](/solution/0200-0299/0267.Palindrome%20Permutation%20II/README.md)  |  `回溯算法`  |  中等  |  🔒  |
|  [0268](https://leetcode-cn.com/problems/missing-number)  |  [丢失的数字](/solution/0200-0299/0268.Missing%20Number/README.md)  |  `位运算`,`数组`,`数学`  |  简单  |    |
|  [0269](https://leetcode-cn.com/problems/alien-dictionary)  |  [火星词典](/solution/0200-0299/0269.Alien%20Dictionary/README.md)  |  `图`,`拓扑排序`  |  困难  |  🔒  |
|  [0270](https://leetcode-cn.com/problems/closest-binary-search-tree-value)  |  [最接近的二叉搜索树值](/solution/0200-0299/0270.Closest%20Binary%20Search%20Tree%20Value/README.md)  |  `树`,`二分查找`  |  简单  |  🔒  |
|  [0271](https://leetcode-cn.com/problems/encode-and-decode-strings)  |  [字符串的编码与解码](/solution/0200-0299/0271.Encode%20and%20Decode%20Strings/README.md)  |  `字符串`  |  中等  |  🔒  |
|  [0272](https://leetcode-cn.com/problems/closest-binary-search-tree-value-ii)  |  [最接近的二叉搜索树值 II](/solution/0200-0299/0272.Closest%20Binary%20Search%20Tree%20Value%20II/README.md)  |  `栈`,`树`  |  困难  |  🔒  |
|  [0273](https://leetcode-cn.com/problems/integer-to-english-words)  |  [整数转换英文表示](/solution/0200-0299/0273.Integer%20to%20English%20Words/README.md)  |  `数学`,`字符串`  |  困难  |    |
|  [0274](https://leetcode-cn.com/problems/h-index)  |  [H 指数](/solution/0200-0299/0274.H-Index/README.md)  |  `排序`,`哈希表`  |  中等  |    |
|  [0275](https://leetcode-cn.com/problems/h-index-ii)  |  [H 指数 II](/solution/0200-0299/0275.H-Index%20II/README.md)  |  `二分查找`  |  中等  |    |
|  [0276](https://leetcode-cn.com/problems/paint-fence)  |  [栅栏涂色](/solution/0200-0299/0276.Paint%20Fence/README.md)  |  `动态规划`  |  中等  |  🔒  |
|  [0277](https://leetcode-cn.com/problems/find-the-celebrity)  |  [搜寻名人](/solution/0200-0299/0277.Find%20the%20Celebrity/README.md)  |  `数组`  |  中等  |  🔒  |
|  [0278](https://leetcode-cn.com/problems/first-bad-version)  |  [第一个错误的版本](/solution/0200-0299/0278.First%20Bad%20Version/README.md)  |  `二分查找`  |  简单  |    |
|  [0279](https://leetcode-cn.com/problems/perfect-squares)  |  [完全平方数](/solution/0200-0299/0279.Perfect%20Squares/README.md)  |  `广度优先搜索`,`数学`,`动态规划`  |  中等  |    |
|  [0280](https://leetcode-cn.com/problems/wiggle-sort)  |  [摆动排序](/solution/0200-0299/0280.Wiggle%20Sort/README.md)  |  `排序`,`数组`  |  中等  |  🔒  |
|  [0281](https://leetcode-cn.com/problems/zigzag-iterator)  |  [锯齿迭代器](/solution/0200-0299/0281.Zigzag%20Iterator/README.md)  |  `设计`  |  中等  |  🔒  |
|  [0282](https://leetcode-cn.com/problems/expression-add-operators)  |  [给表达式添加运算符](/solution/0200-0299/0282.Expression%20Add%20Operators/README.md)  |  `分治算法`  |  困难  |    |
|  [0283](https://leetcode-cn.com/problems/move-zeroes)  |  [移动零](/solution/0200-0299/0283.Move%20Zeroes/README.md)  |  `数组`,`双指针`  |  简单  |    |
|  [0284](https://leetcode-cn.com/problems/peeking-iterator)  |  [顶端迭代器](/solution/0200-0299/0284.Peeking%20Iterator/README.md)  |  `设计`  |  中等  |    |
|  [0285](https://leetcode-cn.com/problems/inorder-successor-in-bst)  |  [二叉搜索树中的中序后继](/solution/0200-0299/0285.Inorder%20Successor%20in%20BST/README.md)  |  `树`  |  中等  |  🔒  |
|  [0286](https://leetcode-cn.com/problems/walls-and-gates)  |  [墙与门](/solution/0200-0299/0286.Walls%20and%20Gates/README.md)  |  `广度优先搜索`  |  中等  |  🔒  |
|  [0287](https://leetcode-cn.com/problems/find-the-duplicate-number)  |  [寻找重复数](/solution/0200-0299/0287.Find%20the%20Duplicate%20Number/README.md)  |  `数组`,`双指针`,`二分查找`  |  中等  |    |
|  [0288](https://leetcode-cn.com/problems/unique-word-abbreviation)  |  [单词的唯一缩写](/solution/0200-0299/0288.Unique%20Word%20Abbreviation/README.md)  |  `设计`,`哈希表`  |  中等  |  🔒  |
|  [0289](https://leetcode-cn.com/problems/game-of-life)  |  [生命游戏](/solution/0200-0299/0289.Game%20of%20Life/README.md)  |  `数组`  |  中等  |    |
|  [0290](https://leetcode-cn.com/problems/word-pattern)  |  [单词规律](/solution/0200-0299/0290.Word%20Pattern/README.md)  |  `哈希表`  |  简单  |    |
|  [0291](https://leetcode-cn.com/problems/word-pattern-ii)  |  [单词规律 II](/solution/0200-0299/0291.Word%20Pattern%20II/README.md)  |  `回溯算法`  |  中等  |  🔒  |
|  [0292](https://leetcode-cn.com/problems/nim-game)  |  [Nim 游戏](/solution/0200-0299/0292.Nim%20Game/README.md)  |  `脑筋急转弯`,`极小化极大`  |  简单  |    |
|  [0293](https://leetcode-cn.com/problems/flip-game)  |  [翻转游戏](/solution/0200-0299/0293.Flip%20Game/README.md)  |  `字符串`  |  简单  |  🔒  |
|  [0294](https://leetcode-cn.com/problems/flip-game-ii)  |  [翻转游戏 II](/solution/0200-0299/0294.Flip%20Game%20II/README.md)  |  `极小化极大`,`回溯算法`  |  中等  |  🔒  |
|  [0295](https://leetcode-cn.com/problems/find-median-from-data-stream)  |  [数据流的中位数](/solution/0200-0299/0295.Find%20Median%20from%20Data%20Stream/README.md)  |  `堆`,`设计`  |  困难  |    |
|  [0296](https://leetcode-cn.com/problems/best-meeting-point)  |  [最佳的碰头地点](/solution/0200-0299/0296.Best%20Meeting%20Point/README.md)  |  `排序`,`数学`  |  困难  |  🔒  |
|  [0297](https://leetcode-cn.com/problems/serialize-and-deserialize-binary-tree)  |  [二叉树的序列化与反序列化](/solution/0200-0299/0297.Serialize%20and%20Deserialize%20Binary%20Tree/README.md)  |  `树`,`设计`  |  困难  |    |
|  [0298](https://leetcode-cn.com/problems/binary-tree-longest-consecutive-sequence)  |  [二叉树最长连续序列](/solution/0200-0299/0298.Binary%20Tree%20Longest%20Consecutive%20Sequence/README.md)  |  `树`  |  中等  |  🔒  |
|  [0299](https://leetcode-cn.com/problems/bulls-and-cows)  |  [猜数字游戏](/solution/0200-0299/0299.Bulls%20and%20Cows/README.md)  |  `哈希表`  |  中等  |    |
|  [0300](https://leetcode-cn.com/problems/longest-increasing-subsequence)  |  [最长递增子序列](/solution/0300-0399/0300.Longest%20Increasing%20Subsequence/README.md)  |  `二分查找`,`动态规划`  |  中等  |    |
|  [0301](https://leetcode-cn.com/problems/remove-invalid-parentheses)  |  [删除无效的括号](/solution/0300-0399/0301.Remove%20Invalid%20Parentheses/README.md)  |  `深度优先搜索`,`广度优先搜索`  |  困难  |    |
|  [0302](https://leetcode-cn.com/problems/smallest-rectangle-enclosing-black-pixels)  |  [包含全部黑色像素的最小矩形](/solution/0300-0399/0302.Smallest%20Rectangle%20Enclosing%20Black%20Pixels/README.md)  |  `二分查找`  |  困难  |  🔒  |
|  [0303](https://leetcode-cn.com/problems/range-sum-query-immutable)  |  [区域和检索 - 数组不可变](/solution/0300-0399/0303.Range%20Sum%20Query%20-%20Immutable/README.md)  |  `动态规划`  |  简单  |    |
|  [0304](https://leetcode-cn.com/problems/range-sum-query-2d-immutable)  |  [二维区域和检索 - 矩阵不可变](/solution/0300-0399/0304.Range%20Sum%20Query%202D%20-%20Immutable/README.md)  |  `动态规划`  |  中等  |    |
|  [0305](https://leetcode-cn.com/problems/number-of-islands-ii)  |  [岛屿数量 II](/solution/0300-0399/0305.Number%20of%20Islands%20II/README.md)  |  `并查集`  |  困难  |  🔒  |
|  [0306](https://leetcode-cn.com/problems/additive-number)  |  [累加数](/solution/0300-0399/0306.Additive%20Number/README.md)  |  `回溯算法`  |  中等  |    |
|  [0307](https://leetcode-cn.com/problems/range-sum-query-mutable)  |  [区域和检索 - 数组可修改](/solution/0300-0399/0307.Range%20Sum%20Query%20-%20Mutable/README.md)  |  `树状数组`,`线段树`  |  中等  |    |
|  [0308](https://leetcode-cn.com/problems/range-sum-query-2d-mutable)  |  [二维区域和检索 - 可变](/solution/0300-0399/0308.Range%20Sum%20Query%202D%20-%20Mutable/README.md)  |  `树状数组`,`线段树`  |  困难  |  🔒  |
|  [0309](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown)  |  [最佳买卖股票时机含冷冻期](/solution/0300-0399/0309.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown/README.md)  |  `动态规划`  |  中等  |    |
|  [0310](https://leetcode-cn.com/problems/minimum-height-trees)  |  [最小高度树](/solution/0300-0399/0310.Minimum%20Height%20Trees/README.md)  |  `广度优先搜索`,`图`  |  中等  |    |
|  [0311](https://leetcode-cn.com/problems/sparse-matrix-multiplication)  |  [稀疏矩阵的乘法](/solution/0300-0399/0311.Sparse%20Matrix%20Multiplication/README.md)  |  `哈希表`  |  中等  |  🔒  |
|  [0312](https://leetcode-cn.com/problems/burst-balloons)  |  [戳气球](/solution/0300-0399/0312.Burst%20Balloons/README.md)  |  `分治算法`,`动态规划`  |  困难  |    |
|  [0313](https://leetcode-cn.com/problems/super-ugly-number)  |  [超级丑数](/solution/0300-0399/0313.Super%20Ugly%20Number/README.md)  |  `堆`,`数学`  |  中等  |    |
|  [0314](https://leetcode-cn.com/problems/binary-tree-vertical-order-traversal)  |  [二叉树的垂直遍历](/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/README.md)  |  `深度优先搜索`,`广度优先搜索`  |  中等  |  🔒  |
|  [0315](https://leetcode-cn.com/problems/count-of-smaller-numbers-after-self)  |  [计算右侧小于当前元素的个数](/solution/0300-0399/0315.Count%20of%20Smaller%20Numbers%20After%20Self/README.md)  |  `排序`,`树状数组`,`线段树`,`二分查找`,`分治算法`  |  困难  |    |
|  [0316](https://leetcode-cn.com/problems/remove-duplicate-letters)  |  [去除重复字母](/solution/0300-0399/0316.Remove%20Duplicate%20Letters/README.md)  |  `栈`,`贪心算法`,`字符串`  |  中等  |    |
|  [0317](https://leetcode-cn.com/problems/shortest-distance-from-all-buildings)  |  [离建筑物最近的距离](/solution/0300-0399/0317.Shortest%20Distance%20from%20All%20Buildings/README.md)  |  `广度优先搜索`  |  困难  |  🔒  |
|  [0318](https://leetcode-cn.com/problems/maximum-product-of-word-lengths)  |  [最大单词长度乘积](/solution/0300-0399/0318.Maximum%20Product%20of%20Word%20Lengths/README.md)  |  `位运算`  |  中等  |    |
|  [0319](https://leetcode-cn.com/problems/bulb-switcher)  |  [灯泡开关](/solution/0300-0399/0319.Bulb%20Switcher/README.md)  |  `脑筋急转弯`,`数学`  |  中等  |    |
|  [0320](https://leetcode-cn.com/problems/generalized-abbreviation)  |  [列举单词的全部缩写](/solution/0300-0399/0320.Generalized%20Abbreviation/README.md)  |  `位运算`,`回溯算法`  |  中等  |  🔒  |
|  [0321](https://leetcode-cn.com/problems/create-maximum-number)  |  [拼接最大数](/solution/0300-0399/0321.Create%20Maximum%20Number/README.md)  |  `贪心算法`,`动态规划`  |  困难  |    |
|  [0322](https://leetcode-cn.com/problems/coin-change)  |  [零钱兑换](/solution/0300-0399/0322.Coin%20Change/README.md)  |  `动态规划`  |  中等  |    |
|  [0323](https://leetcode-cn.com/problems/number-of-connected-components-in-an-undirected-graph)  |  [无向图中连通分量的数目](/solution/0300-0399/0323.Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph/README.md)  |  `深度优先搜索`,`广度优先搜索`,`并查集`,`图`  |  中等  |  🔒  |
|  [0324](https://leetcode-cn.com/problems/wiggle-sort-ii)  |  [摆动排序 II](/solution/0300-0399/0324.Wiggle%20Sort%20II/README.md)  |  `排序`  |  中等  |    |
|  [0325](https://leetcode-cn.com/problems/maximum-size-subarray-sum-equals-k)  |  [和等于 k 的最长子数组长度](/solution/0300-0399/0325.Maximum%20Size%20Subarray%20Sum%20Equals%20k/README.md)  |  `哈希表`  |  中等  |  🔒  |
|  [0326](https://leetcode-cn.com/problems/power-of-three)  |  [3的幂](/solution/0300-0399/0326.Power%20of%20Three/README.md)  |  `数学`  |  简单  |    |
|  [0327](https://leetcode-cn.com/problems/count-of-range-sum)  |  [区间和的个数](/solution/0300-0399/0327.Count%20of%20Range%20Sum/README.md)  |  `排序`,`树状数组`,`线段树`,`二分查找`,`分治算法`  |  困难  |    |
|  [0328](https://leetcode-cn.com/problems/odd-even-linked-list)  |  [奇偶链表](/solution/0300-0399/0328.Odd%20Even%20Linked%20List/README.md)  |  `链表`  |  中等  |    |
|  [0329](https://leetcode-cn.com/problems/longest-increasing-path-in-a-matrix)  |  [矩阵中的最长递增路径](/solution/0300-0399/0329.Longest%20Increasing%20Path%20in%20a%20Matrix/README.md)  |  `深度优先搜索`,`拓扑排序`,`记忆化`  |  困难  |    |
|  [0330](https://leetcode-cn.com/problems/patching-array)  |  [按要求补齐数组](/solution/0300-0399/0330.Patching%20Array/README.md)  |  `贪心算法`  |  困难  |    |
|  [0331](https://leetcode-cn.com/problems/verify-preorder-serialization-of-a-binary-tree)  |  [验证二叉树的前序序列化](/solution/0300-0399/0331.Verify%20Preorder%20Serialization%20of%20a%20Binary%20Tree/README.md)  |  `栈`  |  中等  |    |
|  [0332](https://leetcode-cn.com/problems/reconstruct-itinerary)  |  [重新安排行程](/solution/0300-0399/0332.Reconstruct%20Itinerary/README.md)  |  `深度优先搜索`,`图`  |  中等  |    |
|  [0333](https://leetcode-cn.com/problems/largest-bst-subtree)  |  [最大 BST 子树](/solution/0300-0399/0333.Largest%20BST%20Subtree/README.md)  |  `树`  |  中等  |  🔒  |
|  [0334](https://leetcode-cn.com/problems/increasing-triplet-subsequence)  |  [递增的三元子序列](/solution/0300-0399/0334.Increasing%20Triplet%20Subsequence/README.md)  |    |  中等  |    |
|  [0335](https://leetcode-cn.com/problems/self-crossing)  |  [路径交叉](/solution/0300-0399/0335.Self%20Crossing/README.md)  |  `数学`  |  困难  |    |
|  [0336](https://leetcode-cn.com/problems/palindrome-pairs)  |  [回文对](/solution/0300-0399/0336.Palindrome%20Pairs/README.md)  |  `字典树`,`哈希表`,`字符串`  |  困难  |    |
|  [0337](https://leetcode-cn.com/problems/house-robber-iii)  |  [打家劫舍 III](/solution/0300-0399/0337.House%20Robber%20III/README.md)  |  `树`,`深度优先搜索`,`动态规划`  |  中等  |    |
|  [0338](https://leetcode-cn.com/problems/counting-bits)  |  [比特位计数](/solution/0300-0399/0338.Counting%20Bits/README.md)  |  `位运算`,`动态规划`  |  简单  |    |
|  [0339](https://leetcode-cn.com/problems/nested-list-weight-sum)  |  [嵌套列表权重和](/solution/0300-0399/0339.Nested%20List%20Weight%20Sum/README.md)  |  `深度优先搜索`,`广度优先搜索`  |  中等  |  🔒  |
|  [0340](https://leetcode-cn.com/problems/longest-substring-with-at-most-k-distinct-characters)  |  [至多包含 K 个不同字符的最长子串](/solution/0300-0399/0340.Longest%20Substring%20with%20At%20Most%20K%20Distinct%20Characters/README.md)  |  `哈希表`,`双指针`,`字符串`  |  中等  |  🔒  |
|  [0341](https://leetcode-cn.com/problems/flatten-nested-list-iterator)  |  [扁平化嵌套列表迭代器](/solution/0300-0399/0341.Flatten%20Nested%20List%20Iterator/README.md)  |  `栈`,`设计`  |  中等  |    |
|  [0342](https://leetcode-cn.com/problems/power-of-four)  |  [4的幂](/solution/0300-0399/0342.Power%20of%20Four/README.md)  |  `位运算`  |  简单  |    |
|  [0343](https://leetcode-cn.com/problems/integer-break)  |  [整数拆分](/solution/0300-0399/0343.Integer%20Break/README.md)  |  `数学`,`动态规划`  |  中等  |    |
|  [0344](https://leetcode-cn.com/problems/reverse-string)  |  [反转字符串](/solution/0300-0399/0344.Reverse%20String/README.md)  |  `双指针`,`字符串`  |  简单  |    |
|  [0345](https://leetcode-cn.com/problems/reverse-vowels-of-a-string)  |  [反转字符串中的元音字母](/solution/0300-0399/0345.Reverse%20Vowels%20of%20a%20String/README.md)  |  `双指针`,`字符串`  |  简单  |    |
|  [0346](https://leetcode-cn.com/problems/moving-average-from-data-stream)  |  [数据流中的移动平均值](/solution/0300-0399/0346.Moving%20Average%20from%20Data%20Stream/README.md)  |  `设计`,`队列`  |  简单  |  🔒  |
|  [0347](https://leetcode-cn.com/problems/top-k-frequent-elements)  |  [前 K 个高频元素](/solution/0300-0399/0347.Top%20K%20Frequent%20Elements/README.md)  |  `堆`,`哈希表`  |  中等  |    |
|  [0348](https://leetcode-cn.com/problems/design-tic-tac-toe)  |  [设计井字棋](/solution/0300-0399/0348.Design%20Tic-Tac-Toe/README.md)  |  `设计`  |  中等  |  🔒  |
|  [0349](https://leetcode-cn.com/problems/intersection-of-two-arrays)  |  [两个数组的交集](/solution/0300-0399/0349.Intersection%20of%20Two%20Arrays/README.md)  |  `排序`,`哈希表`,`双指针`,`二分查找`  |  简单  |    |
|  [0350](https://leetcode-cn.com/problems/intersection-of-two-arrays-ii)  |  [两个数组的交集 II](/solution/0300-0399/0350.Intersection%20of%20Two%20Arrays%20II/README.md)  |  `排序`,`哈希表`,`双指针`,`二分查找`  |  简单  |    |
|  [0351](https://leetcode-cn.com/problems/android-unlock-patterns)  |  [安卓系统手势解锁](/solution/0300-0399/0351.Android%20Unlock%20Patterns/README.md)  |  `动态规划`,`回溯算法`  |  中等  |  🔒  |
|  [0352](https://leetcode-cn.com/problems/data-stream-as-disjoint-intervals)  |  [将数据流变为多个不相交区间](/solution/0300-0399/0352.Data%20Stream%20as%20Disjoint%20Intervals/README.md)  |  `二分查找`  |  困难  |    |
|  [0353](https://leetcode-cn.com/problems/design-snake-game)  |  [贪吃蛇](/solution/0300-0399/0353.Design%20Snake%20Game/README.md)  |  `设计`,`队列`  |  中等  |  🔒  |
|  [0354](https://leetcode-cn.com/problems/russian-doll-envelopes)  |  [俄罗斯套娃信封问题](/solution/0300-0399/0354.Russian%20Doll%20Envelopes/README.md)  |  `二分查找`,`动态规划`  |  困难  |    |
|  [0355](https://leetcode-cn.com/problems/design-twitter)  |  [设计推特](/solution/0300-0399/0355.Design%20Twitter/README.md)  |  `堆`,`设计`,`哈希表`  |  中等  |    |
|  [0356](https://leetcode-cn.com/problems/line-reflection)  |  [直线镜像](/solution/0300-0399/0356.Line%20Reflection/README.md)  |  `哈希表`,`数学`  |  中等  |  🔒  |
|  [0357](https://leetcode-cn.com/problems/count-numbers-with-unique-digits)  |  [计算各个位数不同的数字个数](/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md)  |  `数学`,`动态规划`,`回溯算法`  |  中等  |    |
|  [0358](https://leetcode-cn.com/problems/rearrange-string-k-distance-apart)  |  [K 距离间隔重排字符串](/solution/0300-0399/0358.Rearrange%20String%20k%20Distance%20Apart/README.md)  |  `堆`,`贪心算法`,`哈希表`  |  困难  |  🔒  |
|  [0359](https://leetcode-cn.com/problems/logger-rate-limiter)  |  [日志速率限制器](/solution/0300-0399/0359.Logger%20Rate%20Limiter/README.md)  |  `设计`,`哈希表`  |  简单  |  🔒  |
|  [0360](https://leetcode-cn.com/problems/sort-transformed-array)  |  [有序转化数组](/solution/0300-0399/0360.Sort%20Transformed%20Array/README.md)  |  `排序`,`数学`,`双指针`  |  中等  |  🔒  |
|  [0361](https://leetcode-cn.com/problems/bomb-enemy)  |  [轰炸敌人](/solution/0300-0399/0361.Bomb%20Enemy/README.md)  |  `动态规划`  |  中等  |  🔒  |
|  [0362](https://leetcode-cn.com/problems/design-hit-counter)  |  [敲击计数器](/solution/0300-0399/0362.Design%20Hit%20Counter/README.md)  |  `设计`  |  中等  |  🔒  |
|  [0363](https://leetcode-cn.com/problems/max-sum-of-rectangle-no-larger-than-k)  |  [矩形区域不超过 K 的最大数值和](/solution/0300-0399/0363.Max%20Sum%20of%20Rectangle%20No%20Larger%20Than%20K/README.md)  |  `队列`,`二分查找`,`动态规划`  |  困难  |    |
|  [0364](https://leetcode-cn.com/problems/nested-list-weight-sum-ii)  |  [加权嵌套序列和 II](/solution/0300-0399/0364.Nested%20List%20Weight%20Sum%20II/README.md)  |  `深度优先搜索`  |  中等  |  🔒  |
|  [0365](https://leetcode-cn.com/problems/water-and-jug-problem)  |  [水壶问题](/solution/0300-0399/0365.Water%20and%20Jug%20Problem/README.md)  |  `数学`  |  中等  |    |
|  [0366](https://leetcode-cn.com/problems/find-leaves-of-binary-tree)  |  [寻找二叉树的叶子节点](/solution/0300-0399/0366.Find%20Leaves%20of%20Binary%20Tree/README.md)  |  `树`,`深度优先搜索`  |  中等  |  🔒  |
|  [0367](https://leetcode-cn.com/problems/valid-perfect-square)  |  [有效的完全平方数](/solution/0300-0399/0367.Valid%20Perfect%20Square/README.md)  |  `数学`,`二分查找`  |  简单  |    |
|  [0368](https://leetcode-cn.com/problems/largest-divisible-subset)  |  [最大整除子集](/solution/0300-0399/0368.Largest%20Divisible%20Subset/README.md)  |  `数学`,`动态规划`  |  中等  |    |
|  [0369](https://leetcode-cn.com/problems/plus-one-linked-list)  |  [给单链表加一](/solution/0300-0399/0369.Plus%20One%20Linked%20List/README.md)  |  `递归`,`链表`  |  中等  |  🔒  |
|  [0370](https://leetcode-cn.com/problems/range-addition)  |  [区间加法](/solution/0300-0399/0370.Range%20Addition/README.md)  |  `数组`  |  中等  |  🔒  |
|  [0371](https://leetcode-cn.com/problems/sum-of-two-integers)  |  [两整数之和](/solution/0300-0399/0371.Sum%20of%20Two%20Integers/README.md)  |  `位运算`  |  中等  |    |
|  [0372](https://leetcode-cn.com/problems/super-pow)  |  [超级次方](/solution/0300-0399/0372.Super%20Pow/README.md)  |  `数学`  |  中等  |    |
|  [0373](https://leetcode-cn.com/problems/find-k-pairs-with-smallest-sums)  |  [查找和最小的K对数字](/solution/0300-0399/0373.Find%20K%20Pairs%20with%20Smallest%20Sums/README.md)  |  `堆`  |  中等  |    |
|  [0374](https://leetcode-cn.com/problems/guess-number-higher-or-lower)  |  [猜数字大小](/solution/0300-0399/0374.Guess%20Number%20Higher%20or%20Lower/README.md)  |  `二分查找`  |  简单  |    |
|  [0375](https://leetcode-cn.com/problems/guess-number-higher-or-lower-ii)  |  [猜数字大小 II](/solution/0300-0399/0375.Guess%20Number%20Higher%20or%20Lower%20II/README.md)  |  `极小化极大`,`动态规划`  |  中等  |    |
|  [0376](https://leetcode-cn.com/problems/wiggle-subsequence)  |  [摆动序列](/solution/0300-0399/0376.Wiggle%20Subsequence/README.md)  |  `贪心算法`,`动态规划`  |  中等  |    |
|  [0377](https://leetcode-cn.com/problems/combination-sum-iv)  |  [组合总和 Ⅳ](/solution/0300-0399/0377.Combination%20Sum%20IV/README.md)  |  `动态规划`  |  中等  |    |
|  [0378](https://leetcode-cn.com/problems/kth-smallest-element-in-a-sorted-matrix)  |  [有序矩阵中第 K 小的元素](/solution/0300-0399/0378.Kth%20Smallest%20Element%20in%20a%20Sorted%20Matrix/README.md)  |  `堆`,`二分查找`  |  中等  |    |
|  [0379](https://leetcode-cn.com/problems/design-phone-directory)  |  [电话目录管理系统](/solution/0300-0399/0379.Design%20Phone%20Directory/README.md)  |  `设计`,`链表`  |  中等  |  🔒  |
|  [0380](https://leetcode-cn.com/problems/insert-delete-getrandom-o1)  |  [O(1) 时间插入、删除和获取随机元素](/solution/0300-0399/0380.Insert%20Delete%20GetRandom%20O%281%29/README.md)  |  `设计`,`数组`,`哈希表`  |  中等  |    |
|  [0381](https://leetcode-cn.com/problems/insert-delete-getrandom-o1-duplicates-allowed)  |  [O(1) 时间插入、删除和获取随机元素 - 允许重复](/solution/0300-0399/0381.Insert%20Delete%20GetRandom%20O%281%29%20-%20Duplicates%20allowed/README.md)  |  `设计`,`数组`,`哈希表`  |  困难  |    |
|  [0382](https://leetcode-cn.com/problems/linked-list-random-node)  |  [链表随机节点](/solution/0300-0399/0382.Linked%20List%20Random%20Node/README.md)  |  `蓄水池抽样`  |  中等  |    |
|  [0383](https://leetcode-cn.com/problems/ransom-note)  |  [赎金信](/solution/0300-0399/0383.Ransom%20Note/README.md)  |  `字符串`  |  简单  |    |
|  [0384](https://leetcode-cn.com/problems/shuffle-an-array)  |  [打乱数组](/solution/0300-0399/0384.Shuffle%20an%20Array/README.md)  |    |  中等  |    |
|  [0385](https://leetcode-cn.com/problems/mini-parser)  |  [迷你语法分析器](/solution/0300-0399/0385.Mini%20Parser/README.md)  |  `栈`,`字符串`  |  中等  |    |
|  [0386](https://leetcode-cn.com/problems/lexicographical-numbers)  |  [字典序排数](/solution/0300-0399/0386.Lexicographical%20Numbers/README.md)  |    |  中等  |    |
|  [0387](https://leetcode-cn.com/problems/first-unique-character-in-a-string)  |  [字符串中的第一个唯一字符](/solution/0300-0399/0387.First%20Unique%20Character%20in%20a%20String/README.md)  |  `哈希表`,`字符串`  |  简单  |    |
|  [0388](https://leetcode-cn.com/problems/longest-absolute-file-path)  |  [文件的最长绝对路径](/solution/0300-0399/0388.Longest%20Absolute%20File%20Path/README.md)  |    |  中等  |    |
|  [0389](https://leetcode-cn.com/problems/find-the-difference)  |  [找不同](/solution/0300-0399/0389.Find%20the%20Difference/README.md)  |  `位运算`,`哈希表`  |  简单  |    |
|  [0390](https://leetcode-cn.com/problems/elimination-game)  |  [消除游戏](/solution/0300-0399/0390.Elimination%20Game/README.md)  |    |  中等  |    |
|  [0391](https://leetcode-cn.com/problems/perfect-rectangle)  |  [完美矩形](/solution/0300-0399/0391.Perfect%20Rectangle/README.md)  |    |  困难  |    |
|  [0392](https://leetcode-cn.com/problems/is-subsequence)  |  [判断子序列](/solution/0300-0399/0392.Is%20Subsequence/README.md)  |  `贪心算法`,`二分查找`,`动态规划`  |  简单  |    |
|  [0393](https://leetcode-cn.com/problems/utf-8-validation)  |  [UTF-8 编码验证](/solution/0300-0399/0393.UTF-8%20Validation/README.md)  |  `位运算`  |  中等  |    |
|  [0394](https://leetcode-cn.com/problems/decode-string)  |  [字符串解码](/solution/0300-0399/0394.Decode%20String/README.md)  |  `栈`,`深度优先搜索`  |  中等  |    |
|  [0395](https://leetcode-cn.com/problems/longest-substring-with-at-least-k-repeating-characters)  |  [至少有 K 个重复字符的最长子串](/solution/0300-0399/0395.Longest%20Substring%20with%20At%20Least%20K%20Repeating%20Characters/README.md)  |  `递归`,`分治算法`  |  中等  |    |
|  [0396](https://leetcode-cn.com/problems/rotate-function)  |  [旋转函数](/solution/0300-0399/0396.Rotate%20Function/README.md)  |  `数学`  |  中等  |    |
|  [0397](https://leetcode-cn.com/problems/integer-replacement)  |  [整数替换](/solution/0300-0399/0397.Integer%20Replacement/README.md)  |  `位运算`,`数学`  |  中等  |    |
|  [0398](https://leetcode-cn.com/problems/random-pick-index)  |  [随机数索引](/solution/0300-0399/0398.Random%20Pick%20Index/README.md)  |  `蓄水池抽样`  |  中等  |    |
|  [0399](https://leetcode-cn.com/problems/evaluate-division)  |  [除法求值](/solution/0300-0399/0399.Evaluate%20Division/README.md)  |  `并查集`,`图`  |  中等  |    |
|  [0400](https://leetcode-cn.com/problems/nth-digit)  |  [第 N 位数字](/solution/0400-0499/0400.Nth%20Digit/README.md)  |  `数学`  |  中等  |    |
|  [0401](https://leetcode-cn.com/problems/binary-watch)  |  [二进制手表](/solution/0400-0499/0401.Binary%20Watch/README.md)  |  `位运算`,`回溯算法`  |  简单  |    |
|  [0402](https://leetcode-cn.com/problems/remove-k-digits)  |  [移掉K位数字](/solution/0400-0499/0402.Remove%20K%20Digits/README.md)  |  `栈`,`贪心算法`  |  中等  |    |
|  [0403](https://leetcode-cn.com/problems/frog-jump)  |  [青蛙过河](/solution/0400-0499/0403.Frog%20Jump/README.md)  |  `动态规划`  |  困难  |    |
|  [0404](https://leetcode-cn.com/problems/sum-of-left-leaves)  |  [左叶子之和](/solution/0400-0499/0404.Sum%20of%20Left%20Leaves/README.md)  |  `树`  |  简单  |    |
|  [0405](https://leetcode-cn.com/problems/convert-a-number-to-hexadecimal)  |  [数字转换为十六进制数](/solution/0400-0499/0405.Convert%20a%20Number%20to%20Hexadecimal/README.md)  |  `位运算`  |  简单  |    |
|  [0406](https://leetcode-cn.com/problems/queue-reconstruction-by-height)  |  [根据身高重建队列](/solution/0400-0499/0406.Queue%20Reconstruction%20by%20Height/README.md)  |  `贪心算法`  |  中等  |    |
|  [0407](https://leetcode-cn.com/problems/trapping-rain-water-ii)  |  [接雨水 II](/solution/0400-0499/0407.Trapping%20Rain%20Water%20II/README.md)  |  `堆`,`广度优先搜索`  |  困难  |    |
|  [0408](https://leetcode-cn.com/problems/valid-word-abbreviation)  |  [有效单词缩写](/solution/0400-0499/0408.Valid%20Word%20Abbreviation/README.md)  |  `字符串`  |  简单  |  🔒  |
|  [0409](https://leetcode-cn.com/problems/longest-palindrome)  |  [最长回文串](/solution/0400-0499/0409.Longest%20Palindrome/README.md)  |  `哈希表`  |  简单  |    |
|  [0410](https://leetcode-cn.com/problems/split-array-largest-sum)  |  [分割数组的最大值](/solution/0400-0499/0410.Split%20Array%20Largest%20Sum/README.md)  |  `二分查找`,`动态规划`  |  困难  |    |
|  [0411](https://leetcode-cn.com/problems/minimum-unique-word-abbreviation)  |  [最短独占单词缩写](/solution/0400-0499/0411.Minimum%20Unique%20Word%20Abbreviation/README.md)  |  `位运算`,`回溯算法`  |  困难  |  🔒  |
|  [0412](https://leetcode-cn.com/problems/fizz-buzz)  |  [Fizz Buzz](/solution/0400-0499/0412.Fizz%20Buzz/README.md)  |    |  简单  |    |
|  [0413](https://leetcode-cn.com/problems/arithmetic-slices)  |  [等差数列划分](/solution/0400-0499/0413.Arithmetic%20Slices/README.md)  |  `数学`,`动态规划`  |  中等  |    |
|  [0414](https://leetcode-cn.com/problems/third-maximum-number)  |  [第三大的数](/solution/0400-0499/0414.Third%20Maximum%20Number/README.md)  |  `数组`  |  简单  |    |
|  [0415](https://leetcode-cn.com/problems/add-strings)  |  [字符串相加](/solution/0400-0499/0415.Add%20Strings/README.md)  |  `字符串`  |  简单  |    |
|  [0416](https://leetcode-cn.com/problems/partition-equal-subset-sum)  |  [分割等和子集](/solution/0400-0499/0416.Partition%20Equal%20Subset%20Sum/README.md)  |  `动态规划`  |  中等  |    |
|  [0417](https://leetcode-cn.com/problems/pacific-atlantic-water-flow)  |  [太平洋大西洋水流问题](/solution/0400-0499/0417.Pacific%20Atlantic%20Water%20Flow/README.md)  |  `深度优先搜索`,`广度优先搜索`  |  中等  |    |
|  [0418](https://leetcode-cn.com/problems/sentence-screen-fitting)  |  [屏幕可显示句子的数量](/solution/0400-0499/0418.Sentence%20Screen%20Fitting/README.md)  |  `动态规划`  |  中等  |  🔒  |
|  [0419](https://leetcode-cn.com/problems/battleships-in-a-board)  |  [甲板上的战舰](/solution/0400-0499/0419.Battleships%20in%20a%20Board/README.md)  |    |  中等  |    |
|  [0420](https://leetcode-cn.com/problems/strong-password-checker)  |  [强密码检验器](/solution/0400-0499/0420.Strong%20Password%20Checker/README.md)  |    |  困难  |    |
|  [0421](https://leetcode-cn.com/problems/maximum-xor-of-two-numbers-in-an-array)  |  [数组中两个数的最大异或值](/solution/0400-0499/0421.Maximum%20XOR%20of%20Two%20Numbers%20in%20an%20Array/README.md)  |  `位运算`,`字典树`  |  中等  |    |
|  [0422](https://leetcode-cn.com/problems/valid-word-square)  |  [有效的单词方块](/solution/0400-0499/0422.Valid%20Word%20Square/README.md)  |    |  简单  |  🔒  |
|  [0423](https://leetcode-cn.com/problems/reconstruct-original-digits-from-english)  |  [从英文中重建数字](/solution/0400-0499/0423.Reconstruct%20Original%20Digits%20from%20English/README.md)  |  `数学`  |  中等  |    |
|  [0424](https://leetcode-cn.com/problems/longest-repeating-character-replacement)  |  [替换后的最长重复字符](/solution/0400-0499/0424.Longest%20Repeating%20Character%20Replacement/README.md)  |  `双指针`  |  中等  |    |
|  [0425](https://leetcode-cn.com/problems/word-squares)  |  [单词方块](/solution/0400-0499/0425.Word%20Squares/README.md)  |  `字典树`,`回溯算法`  |  困难  |  🔒  |
|  [0426](https://leetcode-cn.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list)  |  [将二叉搜索树转化为排序的双向链表](/solution/0400-0499/0426.Convert%20Binary%20Search%20Tree%20to%20Sorted%20Doubly%20Linked%20List/README.md)  |  `树`,`链表`,`分治算法`  |  中等  |  🔒  |
|  [0427](https://leetcode-cn.com/problems/construct-quad-tree)  |  [建立四叉树](/solution/0400-0499/0427.Construct%20Quad%20Tree/README.md)  |    |  中等  |    |
|  [0428](https://leetcode-cn.com/problems/serialize-and-deserialize-n-ary-tree)  |  [序列化和反序列化 N 叉树](/solution/0400-0499/0428.Serialize%20and%20Deserialize%20N-ary%20Tree/README.md)  |  `树`  |  困难  |  🔒  |
|  [0429](https://leetcode-cn.com/problems/n-ary-tree-level-order-traversal)  |  [N 叉树的层序遍历](/solution/0400-0499/0429.N-ary%20Tree%20Level%20Order%20Traversal/README.md)  |  `树`,`广度优先搜索`  |  中等  |    |
|  [0430](https://leetcode-cn.com/problems/flatten-a-multilevel-doubly-linked-list)  |  [扁平化多级双向链表](/solution/0400-0499/0430.Flatten%20a%20Multilevel%20Doubly%20Linked%20List/README.md)  |  `深度优先搜索`,`链表`  |  中等  |    |
|  [0431](https://leetcode-cn.com/problems/encode-n-ary-tree-to-binary-tree)  |  [将 N 叉树编码为二叉树](/solution/0400-0499/0431.Encode%20N-ary%20Tree%20to%20Binary%20Tree/README.md)  |  `树`  |  困难  |  🔒  |
|  [0432](https://leetcode-cn.com/problems/all-oone-data-structure)  |  [全 O(1) 的数据结构](/solution/0400-0499/0432.All%20O%60one%20Data%20Structure/README.md)  |  `设计`  |  困难  |    |
|  [0433](https://leetcode-cn.com/problems/minimum-genetic-mutation)  |  [最小基因变化](/solution/0400-0499/0433.Minimum%20Genetic%20Mutation/README.md)  |    |  中等  |    |
|  [0434](https://leetcode-cn.com/problems/number-of-segments-in-a-string)  |  [字符串中的单词数](/solution/0400-0499/0434.Number%20of%20Segments%20in%20a%20String/README.md)  |  `字符串`  |  简单  |    |
|  [0435](https://leetcode-cn.com/problems/non-overlapping-intervals)  |  [无重叠区间](/solution/0400-0499/0435.Non-overlapping%20Intervals/README.md)  |  `贪心算法`  |  中等  |    |
|  [0436](https://leetcode-cn.com/problems/find-right-interval)  |  [寻找右区间](/solution/0400-0499/0436.Find%20Right%20Interval/README.md)  |  `二分查找`  |  中等  |    |
|  [0437](https://leetcode-cn.com/problems/path-sum-iii)  |  [路径总和 III](/solution/0400-0499/0437.Path%20Sum%20III/README.md)  |  `树`  |  中等  |    |
|  [0438](https://leetcode-cn.com/problems/find-all-anagrams-in-a-string)  |  [找到字符串中所有字母异位词](/solution/0400-0499/0438.Find%20All%20Anagrams%20in%20a%20String/README.md)  |  `哈希表`  |  中等  |    |
|  [0439](https://leetcode-cn.com/problems/ternary-expression-parser)  |  [三元表达式解析器](/solution/0400-0499/0439.Ternary%20Expression%20Parser/README.md)  |  `栈`,`深度优先搜索`  |  中等  |  🔒  |
|  [0440](https://leetcode-cn.com/problems/k-th-smallest-in-lexicographical-order)  |  [字典序的第K小数字](/solution/0400-0499/0440.K-th%20Smallest%20in%20Lexicographical%20Order/README.md)  |    |  困难  |    |
|  [0441](https://leetcode-cn.com/problems/arranging-coins)  |  [排列硬币](/solution/0400-0499/0441.Arranging%20Coins/README.md)  |  `数学`,`二分查找`  |  简单  |    |
|  [0442](https://leetcode-cn.com/problems/find-all-duplicates-in-an-array)  |  [数组中重复的数据](/solution/0400-0499/0442.Find%20All%20Duplicates%20in%20an%20Array/README.md)  |  `数组`  |  中等  |    |
|  [0443](https://leetcode-cn.com/problems/string-compression)  |  [压缩字符串](/solution/0400-0499/0443.String%20Compression/README.md)  |  `字符串`  |  中等  |    |
|  [0444](https://leetcode-cn.com/problems/sequence-reconstruction)  |  [序列重建](/solution/0400-0499/0444.Sequence%20Reconstruction/README.md)  |  `图`,`拓扑排序`  |  中等  |  🔒  |
|  [0445](https://leetcode-cn.com/problems/add-two-numbers-ii)  |  [两数相加 II](/solution/0400-0499/0445.Add%20Two%20Numbers%20II/README.md)  |  `链表`  |  中等  |    |
|  [0446](https://leetcode-cn.com/problems/arithmetic-slices-ii-subsequence)  |  [等差数列划分 II - 子序列](/solution/0400-0499/0446.Arithmetic%20Slices%20II%20-%20Subsequence/README.md)  |  `动态规划`  |  困难  |    |
|  [0447](https://leetcode-cn.com/problems/number-of-boomerangs)  |  [回旋镖的数量](/solution/0400-0499/0447.Number%20of%20Boomerangs/README.md)  |  `哈希表`,`数学`  |  中等  |    |
|  [0448](https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array)  |  [找到所有数组中消失的数字](/solution/0400-0499/0448.Find%20All%20Numbers%20Disappeared%20in%20an%20Array/README.md)  |  `数组`  |  简单  |    |
|  [0449](https://leetcode-cn.com/problems/serialize-and-deserialize-bst)  |  [序列化和反序列化二叉搜索树](/solution/0400-0499/0449.Serialize%20and%20Deserialize%20BST/README.md)  |  `树`  |  中等  |    |
|  [0450](https://leetcode-cn.com/problems/delete-node-in-a-bst)  |  [删除二叉搜索树中的节点](/solution/0400-0499/0450.Delete%20Node%20in%20a%20BST/README.md)  |  `树`  |  中等  |    |
|  [0451](https://leetcode-cn.com/problems/sort-characters-by-frequency)  |  [根据字符出现频率排序](/solution/0400-0499/0451.Sort%20Characters%20By%20Frequency/README.md)  |  `堆`,`哈希表`  |  中等  |    |
|  [0452](https://leetcode-cn.com/problems/minimum-number-of-arrows-to-burst-balloons)  |  [用最少数量的箭引爆气球](/solution/0400-0499/0452.Minimum%20Number%20of%20Arrows%20to%20Burst%20Balloons/README.md)  |  `贪心算法`,`排序`  |  中等  |    |
|  [0453](https://leetcode-cn.com/problems/minimum-moves-to-equal-array-elements)  |  [最小操作次数使数组元素相等](/solution/0400-0499/0453.Minimum%20Moves%20to%20Equal%20Array%20Elements/README.md)  |  `数学`  |  简单  |    |
|  [0454](https://leetcode-cn.com/problems/4sum-ii)  |  [四数相加 II](/solution/0400-0499/0454.4Sum%20II/README.md)  |  `哈希表`,`二分查找`  |  中等  |    |
|  [0455](https://leetcode-cn.com/problems/assign-cookies)  |  [分发饼干](/solution/0400-0499/0455.Assign%20Cookies/README.md)  |  `贪心算法`  |  简单  |    |
|  [0456](https://leetcode-cn.com/problems/132-pattern)  |  [132 模式](/solution/0400-0499/0456.132%20Pattern/README.md)  |  `栈`  |  中等  |    |
|  [0457](https://leetcode-cn.com/problems/circular-array-loop)  |  [环形数组是否存在循环](/solution/0400-0499/0457.Circular%20Array%20Loop/README.md)  |  `数组`,`双指针`  |  中等  |    |
|  [0458](https://leetcode-cn.com/problems/poor-pigs)  |  [可怜的小猪](/solution/0400-0499/0458.Poor%20Pigs/README.md)  |  `数学`  |  困难  |    |
|  [0459](https://leetcode-cn.com/problems/repeated-substring-pattern)  |  [重复的子字符串](/solution/0400-0499/0459.Repeated%20Substring%20Pattern/README.md)  |  `字符串`  |  简单  |    |
|  [0460](https://leetcode-cn.com/problems/lfu-cache)  |  [LFU 缓存](/solution/0400-0499/0460.LFU%20Cache/README.md)  |  `设计`  |  困难  |    |
|  [0461](https://leetcode-cn.com/problems/hamming-distance)  |  [汉明距离](/solution/0400-0499/0461.Hamming%20Distance/README.md)  |  `位运算`  |  简单  |    |
|  [0462](https://leetcode-cn.com/problems/minimum-moves-to-equal-array-elements-ii)  |  [最少移动次数使数组元素相等 II](/solution/0400-0499/0462.Minimum%20Moves%20to%20Equal%20Array%20Elements%20II/README.md)  |  `数学`  |  中等  |    |
|  [0463](https://leetcode-cn.com/problems/island-perimeter)  |  [岛屿的周长](/solution/0400-0499/0463.Island%20Perimeter/README.md)  |  `哈希表`  |  简单  |    |
|  [0464](https://leetcode-cn.com/problems/can-i-win)  |  [我能赢吗](/solution/0400-0499/0464.Can%20I%20Win/README.md)  |  `极小化极大`,`动态规划`  |  中等  |    |
|  [0465](https://leetcode-cn.com/problems/optimal-account-balancing)  |  [最优账单平衡](/solution/0400-0499/0465.Optimal%20Account%20Balancing/README.md)  |    |  困难  |  🔒  |
|  [0466](https://leetcode-cn.com/problems/count-the-repetitions)  |  [统计重复个数](/solution/0400-0499/0466.Count%20The%20Repetitions/README.md)  |  `动态规划`  |  困难  |    |
|  [0467](https://leetcode-cn.com/problems/unique-substrings-in-wraparound-string)  |  [环绕字符串中唯一的子字符串](/solution/0400-0499/0467.Unique%20Substrings%20in%20Wraparound%20String/README.md)  |  `动态规划`  |  中等  |    |
|  [0468](https://leetcode-cn.com/problems/validate-ip-address)  |  [验证IP地址](/solution/0400-0499/0468.Validate%20IP%20Address/README.md)  |  `字符串`  |  中等  |    |
|  [0469](https://leetcode-cn.com/problems/convex-polygon)  |  [凸多边形](/solution/0400-0499/0469.Convex%20Polygon/README.md)  |  `数学`  |  中等  |  🔒  |
|  [0470](https://leetcode-cn.com/problems/implement-rand10-using-rand7)  |  [用 Rand7() 实现 Rand10()](/solution/0400-0499/0470.Implement%20Rand10%28%29%20Using%20Rand7%28%29/README.md)  |    |  中等  |    |
|  [0471](https://leetcode-cn.com/problems/encode-string-with-shortest-length)  |  [编码最短长度的字符串](/solution/0400-0499/0471.Encode%20String%20with%20Shortest%20Length/README.md)  |  `动态规划`  |  困难  |  🔒  |
|  [0472](https://leetcode-cn.com/problems/concatenated-words)  |  [连接词](/solution/0400-0499/0472.Concatenated%20Words/README.md)  |  `深度优先搜索`,`字典树`,`动态规划`  |  困难  |    |
|  [0473](https://leetcode-cn.com/problems/matchsticks-to-square)  |  [火柴拼正方形](/solution/0400-0499/0473.Matchsticks%20to%20Square/README.md)  |  `深度优先搜索`  |  中等  |    |
|  [0474](https://leetcode-cn.com/problems/ones-and-zeroes)  |  [一和零](/solution/0400-0499/0474.Ones%20and%20Zeroes/README.md)  |  `动态规划`  |  中等  |    |
|  [0475](https://leetcode-cn.com/problems/heaters)  |  [供暖器](/solution/0400-0499/0475.Heaters/README.md)  |  `二分查找`  |  中等  |    |
|  [0476](https://leetcode-cn.com/problems/number-complement)  |  [数字的补数](/solution/0400-0499/0476.Number%20Complement/README.md)  |  `位运算`  |  简单  |    |
|  [0477](https://leetcode-cn.com/problems/total-hamming-distance)  |  [汉明距离总和](/solution/0400-0499/0477.Total%20Hamming%20Distance/README.md)  |  `位运算`  |  中等  |    |
|  [0478](https://leetcode-cn.com/problems/generate-random-point-in-a-circle)  |  [在圆内随机生成点](/solution/0400-0499/0478.Generate%20Random%20Point%20in%20a%20Circle/README.md)  |  `数学`  |  中等  |    |
|  [0479](https://leetcode-cn.com/problems/largest-palindrome-product)  |  [最大回文数乘积](/solution/0400-0499/0479.Largest%20Palindrome%20Product/README.md)  |    |  困难  |    |
|  [0480](https://leetcode-cn.com/problems/sliding-window-median)  |  [滑动窗口中位数](/solution/0400-0499/0480.Sliding%20Window%20Median/README.md)  |    |  困难  |    |
|  [0481](https://leetcode-cn.com/problems/magical-string)  |  [神奇字符串](/solution/0400-0499/0481.Magical%20String/README.md)  |    |  中等  |    |
|  [0482](https://leetcode-cn.com/problems/license-key-formatting)  |  [密钥格式化](/solution/0400-0499/0482.License%20Key%20Formatting/README.md)  |    |  简单  |    |
|  [0483](https://leetcode-cn.com/problems/smallest-good-base)  |  [最小好进制](/solution/0400-0499/0483.Smallest%20Good%20Base/README.md)  |  `数学`,`二分查找`  |  困难  |    |
|  [0484](https://leetcode-cn.com/problems/find-permutation)  |  [寻找排列](/solution/0400-0499/0484.Find%20Permutation/README.md)  |  `贪心算法`  |  中等  |  🔒  |
|  [0485](https://leetcode-cn.com/problems/max-consecutive-ones)  |  [最大连续 1 的个数](/solution/0400-0499/0485.Max%20Consecutive%20Ones/README.md)  |  `数组`  |  简单  |    |
|  [0486](https://leetcode-cn.com/problems/predict-the-winner)  |  [预测赢家](/solution/0400-0499/0486.Predict%20the%20Winner/README.md)  |  `极小化极大`,`动态规划`  |  中等  |    |
|  [0487](https://leetcode-cn.com/problems/max-consecutive-ones-ii)  |  [最大连续1的个数 II](/solution/0400-0499/0487.Max%20Consecutive%20Ones%20II/README.md)  |  `双指针`  |  中等  |  🔒  |
|  [0488](https://leetcode-cn.com/problems/zuma-game)  |  [祖玛游戏](/solution/0400-0499/0488.Zuma%20Game/README.md)  |  `深度优先搜索`  |  困难  |    |
|  [0489](https://leetcode-cn.com/problems/robot-room-cleaner)  |  [扫地机器人](/solution/0400-0499/0489.Robot%20Room%20Cleaner/README.md)  |  `深度优先搜索`  |  困难  |  🔒  |
|  [0490](https://leetcode-cn.com/problems/the-maze)  |  [迷宫](/solution/0400-0499/0490.The%20Maze/README.md)  |  `深度优先搜索`,`广度优先搜索`  |  中等  |  🔒  |
|  [0491](https://leetcode-cn.com/problems/increasing-subsequences)  |  [递增子序列](/solution/0400-0499/0491.Increasing%20Subsequences/README.md)  |  `深度优先搜索`  |  中等  |    |
|  [0492](https://leetcode-cn.com/problems/construct-the-rectangle)  |  [构造矩形](/solution/0400-0499/0492.Construct%20the%20Rectangle/README.md)  |  `数学`  |  简单  |    |
|  [0493](https://leetcode-cn.com/problems/reverse-pairs)  |  [翻转对](/solution/0400-0499/0493.Reverse%20Pairs/README.md)  |  `排序`,`树状数组`,`线段树`,`二分查找`,`分治算法`  |  困难  |    |
|  [0494](https://leetcode-cn.com/problems/target-sum)  |  [目标和](/solution/0400-0499/0494.Target%20Sum/README.md)  |  `深度优先搜索`,`动态规划`  |  中等  |    |
|  [0495](https://leetcode-cn.com/problems/teemo-attacking)  |  [提莫攻击](/solution/0400-0499/0495.Teemo%20Attacking/README.md)  |  `数组`  |  简单  |    |
|  [0496](https://leetcode-cn.com/problems/next-greater-element-i)  |  [下一个更大元素 I](/solution/0400-0499/0496.Next%20Greater%20Element%20I/README.md)  |  `栈`  |  简单  |    |
|  [0497](https://leetcode-cn.com/problems/random-point-in-non-overlapping-rectangles)  |  [非重叠矩形中的随机点](/solution/0400-0499/0497.Random%20Point%20in%20Non-overlapping%20Rectangles/README.md)  |  `二分查找`  |  中等  |    |
|  [0498](https://leetcode-cn.com/problems/diagonal-traverse)  |  [对角线遍历](/solution/0400-0499/0498.Diagonal%20Traverse/README.md)  |    |  中等  |    |
|  [0499](https://leetcode-cn.com/problems/the-maze-iii)  |  [迷宫 III](/solution/0400-0499/0499.The%20Maze%20III/README.md)  |  `深度优先搜索`,`广度优先搜索`  |  困难  |  🔒  |
|  [0500](https://leetcode-cn.com/problems/keyboard-row)  |  [键盘行](/solution/0500-0599/0500.Keyboard%20Row/README.md)  |  `哈希表`  |  简单  |    |
|  [0501](https://leetcode-cn.com/problems/find-mode-in-binary-search-tree)  |  [二叉搜索树中的众数](/solution/0500-0599/0501.Find%20Mode%20in%20Binary%20Search%20Tree/README.md)  |  `树`  |  简单  |    |
|  [0502](https://leetcode-cn.com/problems/ipo)  |  [IPO](/solution/0500-0599/0502.IPO/README.md)  |  `堆`,`贪心算法`  |  困难  |    |
|  [0503](https://leetcode-cn.com/problems/next-greater-element-ii)  |  [下一个更大元素 II](/solution/0500-0599/0503.Next%20Greater%20Element%20II/README.md)  |  `栈`  |  中等  |    |
|  [0504](https://leetcode-cn.com/problems/base-7)  |  [七进制数](/solution/0500-0599/0504.Base%207/README.md)  |    |  简单  |    |
|  [0505](https://leetcode-cn.com/problems/the-maze-ii)  |  [迷宫 II](/solution/0500-0599/0505.The%20Maze%20II/README.md)  |  `深度优先搜索`,`广度优先搜索`  |  中等  |  🔒  |
|  [0506](https://leetcode-cn.com/problems/relative-ranks)  |  [相对名次](/solution/0500-0599/0506.Relative%20Ranks/README.md)  |    |  简单  |    |
|  [0507](https://leetcode-cn.com/problems/perfect-number)  |  [完美数](/solution/0500-0599/0507.Perfect%20Number/README.md)  |  `数学`  |  简单  |    |
|  [0508](https://leetcode-cn.com/problems/most-frequent-subtree-sum)  |  [出现次数最多的子树元素和](/solution/0500-0599/0508.Most%20Frequent%20Subtree%20Sum/README.md)  |  `树`,`哈希表`  |  中等  |    |
|  [0509](https://leetcode-cn.com/problems/fibonacci-number)  |  [斐波那契数](/solution/0500-0599/0509.Fibonacci%20Number/README.md)  |  `数组`  |  简单  |    |
|  [0510](https://leetcode-cn.com/problems/inorder-successor-in-bst-ii)  |  [二叉搜索树中的中序后继 II](/solution/0500-0599/0510.Inorder%20Successor%20in%20BST%20II/README.md)  |  `树`  |  中等  |  🔒  |
|  [0511](https://leetcode-cn.com/problems/game-play-analysis-i)  |  [游戏玩法分析 I](/solution/0500-0599/0511.Game%20Play%20Analysis%20I/README.md)  |    |  简单  |  🔒  |
|  [0512](https://leetcode-cn.com/problems/game-play-analysis-ii)  |  [游戏玩法分析 II](/solution/0500-0599/0512.Game%20Play%20Analysis%20II/README.md)  |    |  简单  |  🔒  |
|  [0513](https://leetcode-cn.com/problems/find-bottom-left-tree-value)  |  [找树左下角的值](/solution/0500-0599/0513.Find%20Bottom%20Left%20Tree%20Value/README.md)  |  `树`,`深度优先搜索`,`广度优先搜索`  |  中等  |    |
|  [0514](https://leetcode-cn.com/problems/freedom-trail)  |  [自由之路](/solution/0500-0599/0514.Freedom%20Trail/README.md)  |  `深度优先搜索`,`分治算法`,`动态规划`  |  困难  |    |
|  [0515](https://leetcode-cn.com/problems/find-largest-value-in-each-tree-row)  |  [在每个树行中找最大值](/solution/0500-0599/0515.Find%20Largest%20Value%20in%20Each%20Tree%20Row/README.md)  |  `树`,`深度优先搜索`,`广度优先搜索`  |  中等  |    |
|  [0516](https://leetcode-cn.com/problems/longest-palindromic-subsequence)  |  [最长回文子序列](/solution/0500-0599/0516.Longest%20Palindromic%20Subsequence/README.md)  |  `动态规划`  |  中等  |    |
|  [0517](https://leetcode-cn.com/problems/super-washing-machines)  |  [超级洗衣机](/solution/0500-0599/0517.Super%20Washing%20Machines/README.md)  |  `数学`,`动态规划`  |  困难  |    |
|  [0518](https://leetcode-cn.com/problems/coin-change-2)  |  [零钱兑换 II](/solution/0500-0599/0518.Coin%20Change%202/README.md)  |    |  中等  |    |
|  [0519](https://leetcode-cn.com/problems/random-flip-matrix)  |  [随机翻转矩阵](/solution/0500-0599/0519.Random%20Flip%20Matrix/README.md)  |    |  中等  |    |
|  [0520](https://leetcode-cn.com/problems/detect-capital)  |  [检测大写字母](/solution/0500-0599/0520.Detect%20Capital/README.md)  |  `字符串`  |  简单  |    |
|  [0521](https://leetcode-cn.com/problems/longest-uncommon-subsequence-i)  |  [最长特殊序列 Ⅰ](/solution/0500-0599/0521.Longest%20Uncommon%20Subsequence%20I/README.md)  |  `脑筋急转弯`,`字符串`  |  简单  |    |
|  [0522](https://leetcode-cn.com/problems/longest-uncommon-subsequence-ii)  |  [最长特殊序列 II](/solution/0500-0599/0522.Longest%20Uncommon%20Subsequence%20II/README.md)  |  `字符串`  |  中等  |    |
|  [0523](https://leetcode-cn.com/problems/continuous-subarray-sum)  |  [连续的子数组和](/solution/0500-0599/0523.Continuous%20Subarray%20Sum/README.md)  |  `数学`,`动态规划`  |  中等  |    |
|  [0524](https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting)  |  [通过删除字母匹配到字典里最长单词](/solution/0500-0599/0524.Longest%20Word%20in%20Dictionary%20through%20Deleting/README.md)  |  `排序`,`双指针`  |  中等  |    |
|  [0525](https://leetcode-cn.com/problems/contiguous-array)  |  [连续数组](/solution/0500-0599/0525.Contiguous%20Array/README.md)  |  `哈希表`  |  中等  |    |
|  [0526](https://leetcode-cn.com/problems/beautiful-arrangement)  |  [优美的排列](/solution/0500-0599/0526.Beautiful%20Arrangement/README.md)  |  `深度优先搜索`,`回溯算法`  |  中等  |    |
|  [0527](https://leetcode-cn.com/problems/word-abbreviation)  |  [单词缩写](/solution/0500-0599/0527.Word%20Abbreviation/README.md)  |  `排序`,`字符串`  |  困难  |  🔒  |
|  [0528](https://leetcode-cn.com/problems/random-pick-with-weight)  |  [按权重随机选择](/solution/0500-0599/0528.Random%20Pick%20with%20Weight/README.md)  |  `二分查找`  |  中等  |    |
|  [0529](https://leetcode-cn.com/problems/minesweeper)  |  [扫雷游戏](/solution/0500-0599/0529.Minesweeper/README.md)  |  `深度优先搜索`,`广度优先搜索`  |  中等  |    |
|  [0530](https://leetcode-cn.com/problems/minimum-absolute-difference-in-bst)  |  [二叉搜索树的最小绝对差](/solution/0500-0599/0530.Minimum%20Absolute%20Difference%20in%20BST/README.md)  |  `树`  |  简单  |    |
|  [0531](https://leetcode-cn.com/problems/lonely-pixel-i)  |  [孤独像素 I](/solution/0500-0599/0531.Lonely%20Pixel%20I/README.md)  |  `深度优先搜索`,`数组`  |  中等  |  🔒  |
|  [0532](https://leetcode-cn.com/problems/k-diff-pairs-in-an-array)  |  [数组中的 k-diff 数对](/solution/0500-0599/0532.K-diff%20Pairs%20in%20an%20Array/README.md)  |  `数组`,`双指针`  |  中等  |    |
|  [0533](https://leetcode-cn.com/problems/lonely-pixel-ii)  |  [孤独像素 II](/solution/0500-0599/0533.Lonely%20Pixel%20II/README.md)  |  `数组`  |  中等  |  🔒  |
|  [0534](https://leetcode-cn.com/problems/game-play-analysis-iii)  |  [游戏玩法分析 III](/solution/0500-0599/0534.Game%20Play%20Analysis%20III/README.md)  |    |  中等  |  🔒  |
|  [0535](https://leetcode-cn.com/problems/encode-and-decode-tinyurl)  |  [TinyURL 的加密与解密](/solution/0500-0599/0535.Encode%20and%20Decode%20TinyURL/README.md)  |  `哈希表`,`数学`  |  中等  |    |
|  [0536](https://leetcode-cn.com/problems/construct-binary-tree-from-string)  |  [从字符串生成二叉树](/solution/0500-0599/0536.Construct%20Binary%20Tree%20from%20String/README.md)  |  `树`,`字符串`  |  中等  |  🔒  |
|  [0537](https://leetcode-cn.com/problems/complex-number-multiplication)  |  [复数乘法](/solution/0500-0599/0537.Complex%20Number%20Multiplication/README.md)  |  `数学`,`字符串`  |  中等  |    |
|  [0538](https://leetcode-cn.com/problems/convert-bst-to-greater-tree)  |  [把二叉搜索树转换为累加树](/solution/0500-0599/0538.Convert%20BST%20to%20Greater%20Tree/README.md)  |  `树`,`深度优先搜索`,`二叉搜索树`,`递归`  |  中等  |    |
|  [0539](https://leetcode-cn.com/problems/minimum-time-difference)  |  [最小时间差](/solution/0500-0599/0539.Minimum%20Time%20Difference/README.md)  |  `字符串`  |  中等  |    |
|  [0540](https://leetcode-cn.com/problems/single-element-in-a-sorted-array)  |  [有序数组中的单一元素](/solution/0500-0599/0540.Single%20Element%20in%20a%20Sorted%20Array/README.md)  |  `二分查找`  |  中等  |    |
|  [0541](https://leetcode-cn.com/problems/reverse-string-ii)  |  [反转字符串 II](/solution/0500-0599/0541.Reverse%20String%20II/README.md)  |  `字符串`  |  简单  |    |
|  [0542](https://leetcode-cn.com/problems/01-matrix)  |  [01 矩阵](/solution/0500-0599/0542.01%20Matrix/README.md)  |  `深度优先搜索`,`广度优先搜索`  |  中等  |    |
|  [0543](https://leetcode-cn.com/problems/diameter-of-binary-tree)  |  [二叉树的直径](/solution/0500-0599/0543.Diameter%20of%20Binary%20Tree/README.md)  |  `树`  |  简单  |    |
|  [0544](https://leetcode-cn.com/problems/output-contest-matches)  |  [输出比赛匹配对](/solution/0500-0599/0544.Output%20Contest%20Matches/README.md)  |  `递归`,`字符串`  |  中等  |  🔒  |
|  [0545](https://leetcode-cn.com/problems/boundary-of-binary-tree)  |  [二叉树的边界](/solution/0500-0599/0545.Boundary%20of%20Binary%20Tree/README.md)  |  `树`  |  中等  |  🔒  |
|  [0546](https://leetcode-cn.com/problems/remove-boxes)  |  [移除盒子](/solution/0500-0599/0546.Remove%20Boxes/README.md)  |  `深度优先搜索`,`动态规划`  |  困难  |    |
|  [0547](https://leetcode-cn.com/problems/number-of-provinces)  |  [省份数量](/solution/0500-0599/0547.Number%20of%20Provinces/README.md)  |  `深度优先搜索`,`并查集`  |  中等  |    |
|  [0548](https://leetcode-cn.com/problems/split-array-with-equal-sum)  |  [将数组分割成和相等的子数组](/solution/0500-0599/0548.Split%20Array%20with%20Equal%20Sum/README.md)  |  `数组`  |  中等  |  🔒  |
|  [0549](https://leetcode-cn.com/problems/binary-tree-longest-consecutive-sequence-ii)  |  [二叉树中最长的连续序列](/solution/0500-0599/0549.Binary%20Tree%20Longest%20Consecutive%20Sequence%20II/README.md)  |  `树`  |  中等  |  🔒  |
|  [0550](https://leetcode-cn.com/problems/game-play-analysis-iv)  |  [游戏玩法分析 IV](/solution/0500-0599/0550.Game%20Play%20Analysis%20IV/README.md)  |    |  中等  |  🔒  |
|  [0551](https://leetcode-cn.com/problems/student-attendance-record-i)  |  [学生出勤记录 I](/solution/0500-0599/0551.Student%20Attendance%20Record%20I/README.md)  |  `字符串`  |  简单  |    |
|  [0552](https://leetcode-cn.com/problems/student-attendance-record-ii)  |  [学生出勤记录 II](/solution/0500-0599/0552.Student%20Attendance%20Record%20II/README.md)  |  `动态规划`  |  困难  |    |
|  [0553](https://leetcode-cn.com/problems/optimal-division)  |  [最优除法](/solution/0500-0599/0553.Optimal%20Division/README.md)  |  `数学`,`字符串`  |  中等  |    |
|  [0554](https://leetcode-cn.com/problems/brick-wall)  |  [砖墙](/solution/0500-0599/0554.Brick%20Wall/README.md)  |  `哈希表`  |  中等  |    |
|  [0555](https://leetcode-cn.com/problems/split-concatenated-strings)  |  [分割连接字符串](/solution/0500-0599/0555.Split%20Concatenated%20Strings/README.md)  |  `字符串`  |  中等  |  🔒  |
|  [0556](https://leetcode-cn.com/problems/next-greater-element-iii)  |  [下一个更大元素 III](/solution/0500-0599/0556.Next%20Greater%20Element%20III/README.md)  |  `字符串`  |  中等  |    |
|  [0557](https://leetcode-cn.com/problems/reverse-words-in-a-string-iii)  |  [反转字符串中的单词 III](/solution/0500-0599/0557.Reverse%20Words%20in%20a%20String%20III/README.md)  |  `字符串`  |  简单  |    |
|  [0558](https://leetcode-cn.com/problems/logical-or-of-two-binary-grids-represented-as-quad-trees)  |  [四叉树交集](/solution/0500-0599/0558.Logical%20OR%20of%20Two%20Binary%20Grids%20Represented%20as%20Quad-Trees/README.md)  |    |  中等  |    |
|  [0559](https://leetcode-cn.com/problems/maximum-depth-of-n-ary-tree)  |  [N 叉树的最大深度](/solution/0500-0599/0559.Maximum%20Depth%20of%20N-ary%20Tree/README.md)  |  `树`,`深度优先搜索`,`广度优先搜索`  |  简单  |    |
|  [0560](https://leetcode-cn.com/problems/subarray-sum-equals-k)  |  [和为K的子数组](/solution/0500-0599/0560.Subarray%20Sum%20Equals%20K/README.md)  |  `数组`,`哈希表`  |  中等  |    |
|  [0561](https://leetcode-cn.com/problems/array-partition-i)  |  [数组拆分 I](/solution/0500-0599/0561.Array%20Partition%20I/README.md)  |  `数组`  |  简单  |    |
|  [0562](https://leetcode-cn.com/problems/longest-line-of-consecutive-one-in-matrix)  |  [矩阵中最长的连续1线段](/solution/0500-0599/0562.Longest%20Line%20of%20Consecutive%20One%20in%20Matrix/README.md)  |  `数组`,`动态规划`  |  中等  |  🔒  |
|  [0563](https://leetcode-cn.com/problems/binary-tree-tilt)  |  [二叉树的坡度](/solution/0500-0599/0563.Binary%20Tree%20Tilt/README.md)  |  `树`,`深度优先搜索`,`递归`  |  简单  |    |
|  [0564](https://leetcode-cn.com/problems/find-the-closest-palindrome)  |  [寻找最近的回文数](/solution/0500-0599/0564.Find%20the%20Closest%20Palindrome/README.md)  |  `字符串`  |  困难  |    |
|  [0565](https://leetcode-cn.com/problems/array-nesting)  |  [数组嵌套](/solution/0500-0599/0565.Array%20Nesting/README.md)  |  `数组`  |  中等  |    |
|  [0566](https://leetcode-cn.com/problems/reshape-the-matrix)  |  [重塑矩阵](/solution/0500-0599/0566.Reshape%20the%20Matrix/README.md)  |  `数组`  |  简单  |    |
|  [0567](https://leetcode-cn.com/problems/permutation-in-string)  |  [字符串的排列](/solution/0500-0599/0567.Permutation%20in%20String/README.md)  |  `双指针`  |  中等  |    |
|  [0568](https://leetcode-cn.com/problems/maximum-vacation-days)  |  [最大休假天数](/solution/0500-0599/0568.Maximum%20Vacation%20Days/README.md)  |  `动态规划`  |  困难  |  🔒  |
|  [0569](https://leetcode-cn.com/problems/median-employee-salary)  |  [员工薪水中位数](/solution/0500-0599/0569.Median%20Employee%20Salary/README.md)  |    |  困难  |  🔒  |
|  [0570](https://leetcode-cn.com/problems/managers-with-at-least-5-direct-reports)  |  [至少有5名直接下属的经理](/solution/0500-0599/0570.Managers%20with%20at%20Least%205%20Direct%20Reports/README.md)  |    |  中等  |  🔒  |
|  [0571](https://leetcode-cn.com/problems/find-median-given-frequency-of-numbers)  |  [给定数字的频率查询中位数](/solution/0500-0599/0571.Find%20Median%20Given%20Frequency%20of%20Numbers/README.md)  |    |  困难  |  🔒  |
|  [0572](https://leetcode-cn.com/problems/subtree-of-another-tree)  |  [另一个树的子树](/solution/0500-0599/0572.Subtree%20of%20Another%20Tree/README.md)  |  `树`  |  简单  |    |
|  [0573](https://leetcode-cn.com/problems/squirrel-simulation)  |  [松鼠模拟](/solution/0500-0599/0573.Squirrel%20Simulation/README.md)  |  `数学`  |  中等  |  🔒  |
|  [0574](https://leetcode-cn.com/problems/winning-candidate)  |  [当选者](/solution/0500-0599/0574.Winning%20Candidate/README.md)  |    |  中等  |  🔒  |
|  [0575](https://leetcode-cn.com/problems/distribute-candies)  |  [分糖果](/solution/0500-0599/0575.Distribute%20Candies/README.md)  |  `哈希表`  |  简单  |    |
|  [0576](https://leetcode-cn.com/problems/out-of-boundary-paths)  |  [出界的路径数](/solution/0500-0599/0576.Out%20of%20Boundary%20Paths/README.md)  |  `深度优先搜索`,`动态规划`  |  中等  |    |
|  [0577](https://leetcode-cn.com/problems/employee-bonus)  |  [员工奖金](/solution/0500-0599/0577.Employee%20Bonus/README.md)  |    |  简单  |  🔒  |
|  [0578](https://leetcode-cn.com/problems/get-highest-answer-rate-question)  |  [查询回答率最高的问题](/solution/0500-0599/0578.Get%20Highest%20Answer%20Rate%20Question/README.md)  |    |  中等  |  🔒  |
|  [0579](https://leetcode-cn.com/problems/find-cumulative-salary-of-an-employee)  |  [查询员工的累计薪水](/solution/0500-0599/0579.Find%20Cumulative%20Salary%20of%20an%20Employee/README.md)  |    |  困难  |  🔒  |
|  [0580](https://leetcode-cn.com/problems/count-student-number-in-departments)  |  [统计各专业学生人数](/solution/0500-0599/0580.Count%20Student%20Number%20in%20Departments/README.md)  |    |  中等  |  🔒  |
|  [0581](https://leetcode-cn.com/problems/shortest-unsorted-continuous-subarray)  |  [最短无序连续子数组](/solution/0500-0599/0581.Shortest%20Unsorted%20Continuous%20Subarray/README.md)  |  `数组`  |  中等  |    |
|  [0582](https://leetcode-cn.com/problems/kill-process)  |  [杀掉进程](/solution/0500-0599/0582.Kill%20Process/README.md)  |  `树`,`队列`  |  中等  |  🔒  |
|  [0583](https://leetcode-cn.com/problems/delete-operation-for-two-strings)  |  [两个字符串的删除操作](/solution/0500-0599/0583.Delete%20Operation%20for%20Two%20Strings/README.md)  |  `字符串`  |  中等  |    |
|  [0584](https://leetcode-cn.com/problems/find-customer-referee)  |  [寻找用户推荐人](/solution/0500-0599/0584.Find%20Customer%20Referee/README.md)  |    |  简单  |  🔒  |
|  [0585](https://leetcode-cn.com/problems/investments-in-2016)  |  [2016年的投资](/solution/0500-0599/0585.Investments%20in%202016/README.md)  |    |  中等  |  🔒  |
|  [0586](https://leetcode-cn.com/problems/customer-placing-the-largest-number-of-orders)  |  [订单最多的客户](/solution/0500-0599/0586.Customer%20Placing%20the%20Largest%20Number%20of%20Orders/README.md)  |    |  简单  |  🔒  |
|  [0587](https://leetcode-cn.com/problems/erect-the-fence)  |  [安装栅栏](/solution/0500-0599/0587.Erect%20the%20Fence/README.md)  |  `几何`  |  困难  |    |
|  [0588](https://leetcode-cn.com/problems/design-in-memory-file-system)  |  [设计内存文件系统](/solution/0500-0599/0588.Design%20In-Memory%20File%20System/README.md)  |  `设计`  |  困难  |  🔒  |
|  [0589](https://leetcode-cn.com/problems/n-ary-tree-preorder-traversal)  |  [N 叉树的前序遍历](/solution/0500-0599/0589.N-ary%20Tree%20Preorder%20Traversal/README.md)  |  `树`  |  简单  |    |
|  [0590](https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal)  |  [N 叉树的后序遍历](/solution/0500-0599/0590.N-ary%20Tree%20Postorder%20Traversal/README.md)  |  `树`  |  简单  |    |
|  [0591](https://leetcode-cn.com/problems/tag-validator)  |  [标签验证器](/solution/0500-0599/0591.Tag%20Validator/README.md)  |  `栈`,`字符串`  |  困难  |    |
|  [0592](https://leetcode-cn.com/problems/fraction-addition-and-subtraction)  |  [分数加减运算](/solution/0500-0599/0592.Fraction%20Addition%20and%20Subtraction/README.md)  |  `数学`  |  中等  |    |
|  [0593](https://leetcode-cn.com/problems/valid-square)  |  [有效的正方形](/solution/0500-0599/0593.Valid%20Square/README.md)  |  `数学`  |  中等  |    |
|  [0594](https://leetcode-cn.com/problems/longest-harmonious-subsequence)  |  [最长和谐子序列](/solution/0500-0599/0594.Longest%20Harmonious%20Subsequence/README.md)  |  `哈希表`  |  简单  |    |
|  [0595](https://leetcode-cn.com/problems/big-countries)  |  [大的国家](/solution/0500-0599/0595.Big%20Countries/README.md)  |    |  简单  |    |
|  [0596](https://leetcode-cn.com/problems/classes-more-than-5-students)  |  [超过5名学生的课](/solution/0500-0599/0596.Classes%20More%20Than%205%20Students/README.md)  |    |  简单  |    |
|  [0597](https://leetcode-cn.com/problems/friend-requests-i-overall-acceptance-rate)  |  [好友申请 I：总体通过率](/solution/0500-0599/0597.Friend%20Requests%20I%20Overall%20Acceptance%20Rate/README.md)  |    |  简单  |  🔒  |
|  [0598](https://leetcode-cn.com/problems/range-addition-ii)  |  [范围求和 II](/solution/0500-0599/0598.Range%20Addition%20II/README.md)  |  `数学`  |  简单  |    |
|  [0599](https://leetcode-cn.com/problems/minimum-index-sum-of-two-lists)  |  [两个列表的最小索引总和](/solution/0500-0599/0599.Minimum%20Index%20Sum%20of%20Two%20Lists/README.md)  |  `哈希表`  |  简单  |    |
|  [0600](https://leetcode-cn.com/problems/non-negative-integers-without-consecutive-ones)  |  [不含连续1的非负整数](/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md)  |  `动态规划`  |  困难  |    |
|  [0601](https://leetcode-cn.com/problems/human-traffic-of-stadium)  |  [体育馆的人流量](/solution/0600-0699/0601.Human%20Traffic%20of%20Stadium/README.md)  |    |  困难  |    |
|  [0602](https://leetcode-cn.com/problems/friend-requests-ii-who-has-the-most-friends)  |  [好友申请 II ：谁有最多的好友](/solution/0600-0699/0602.Friend%20Requests%20II%20Who%20Has%20the%20Most%20Friends/README.md)  |    |  中等  |  🔒  |
|  [0603](https://leetcode-cn.com/problems/consecutive-available-seats)  |  [连续空余座位](/solution/0600-0699/0603.Consecutive%20Available%20Seats/README.md)  |    |  简单  |  🔒  |
|  [0604](https://leetcode-cn.com/problems/design-compressed-string-iterator)  |  [迭代压缩字符串](/solution/0600-0699/0604.Design%20Compressed%20String%20Iterator/README.md)  |  `设计`  |  简单  |  🔒  |
|  [0605](https://leetcode-cn.com/problems/can-place-flowers)  |  [种花问题](/solution/0600-0699/0605.Can%20Place%20Flowers/README.md)  |  `贪心算法`,`数组`  |  简单  |    |
|  [0606](https://leetcode-cn.com/problems/construct-string-from-binary-tree)  |  [根据二叉树创建字符串](/solution/0600-0699/0606.Construct%20String%20from%20Binary%20Tree/README.md)  |  `树`,`字符串`  |  简单  |    |
|  [0607](https://leetcode-cn.com/problems/sales-person)  |  [销售员](/solution/0600-0699/0607.Sales%20Person/README.md)  |    |  简单  |  🔒  |
|  [0608](https://leetcode-cn.com/problems/tree-node)  |  [树节点](/solution/0600-0699/0608.Tree%20Node/README.md)  |    |  中等  |  🔒  |
|  [0609](https://leetcode-cn.com/problems/find-duplicate-file-in-system)  |  [在系统中查找重复文件](/solution/0600-0699/0609.Find%20Duplicate%20File%20in%20System/README.md)  |  `哈希表`,`字符串`  |  中等  |    |
|  [0610](https://leetcode-cn.com/problems/triangle-judgement)  |  [判断三角形](/solution/0600-0699/0610.Triangle%20Judgement/README.md)  |    |  简单  |  🔒  |
|  [0611](https://leetcode-cn.com/problems/valid-triangle-number)  |  [有效三角形的个数](/solution/0600-0699/0611.Valid%20Triangle%20Number/README.md)  |  `数组`  |  中等  |    |
|  [0612](https://leetcode-cn.com/problems/shortest-distance-in-a-plane)  |  [平面上的最近距离](/solution/0600-0699/0612.Shortest%20Distance%20in%20a%20Plane/README.md)  |    |  中等  |  🔒  |
|  [0613](https://leetcode-cn.com/problems/shortest-distance-in-a-line)  |  [直线上的最近距离](/solution/0600-0699/0613.Shortest%20Distance%20in%20a%20Line/README.md)  |    |  简单  |  🔒  |
|  [0614](https://leetcode-cn.com/problems/second-degree-follower)  |  [二级关注者](/solution/0600-0699/0614.Second%20Degree%20Follower/README.md)  |    |  中等  |  🔒  |
|  [0615](https://leetcode-cn.com/problems/average-salary-departments-vs-company)  |  [平均工资：部门与公司比较](/solution/0600-0699/0615.Average%20Salary%20Departments%20VS%20Company/README.md)  |    |  困难  |  🔒  |
|  [0616](https://leetcode-cn.com/problems/add-bold-tag-in-string)  |  [给字符串添加加粗标签](/solution/0600-0699/0616.Add%20Bold%20Tag%20in%20String/README.md)  |  `字符串`  |  中等  |  🔒  |
|  [0617](https://leetcode-cn.com/problems/merge-two-binary-trees)  |  [合并二叉树](/solution/0600-0699/0617.Merge%20Two%20Binary%20Trees/README.md)  |  `树`  |  简单  |    |
|  [0618](https://leetcode-cn.com/problems/students-report-by-geography)  |  [学生地理信息报告](/solution/0600-0699/0618.Students%20Report%20By%20Geography/README.md)  |    |  困难  |  🔒  |
|  [0619](https://leetcode-cn.com/problems/biggest-single-number)  |  [只出现一次的最大数字](/solution/0600-0699/0619.Biggest%20Single%20Number/README.md)  |    |  简单  |  🔒  |
|  [0620](https://leetcode-cn.com/problems/not-boring-movies)  |  [有趣的电影](/solution/0600-0699/0620.Not%20Boring%20Movies/README.md)  |    |  简单  |    |
|  [0621](https://leetcode-cn.com/problems/task-scheduler)  |  [任务调度器](/solution/0600-0699/0621.Task%20Scheduler/README.md)  |  `贪心算法`,`队列`,`数组`  |  中等  |    |
|  [0622](https://leetcode-cn.com/problems/design-circular-queue)  |  [设计循环队列](/solution/0600-0699/0622.Design%20Circular%20Queue/README.md)  |  `设计`,`队列`  |  中等  |    |
|  [0623](https://leetcode-cn.com/problems/add-one-row-to-tree)  |  [在二叉树中增加一行](/solution/0600-0699/0623.Add%20One%20Row%20to%20Tree/README.md)  |  `树`  |  中等  |    |
|  [0624](https://leetcode-cn.com/problems/maximum-distance-in-arrays)  |  [数组列表中的最大距离](/solution/0600-0699/0624.Maximum%20Distance%20in%20Arrays/README.md)  |  `数组`,`哈希表`  |  中等  |  🔒  |
|  [0625](https://leetcode-cn.com/problems/minimum-factorization)  |  [最小因式分解](/solution/0600-0699/0625.Minimum%20Factorization/README.md)  |  `递归`,`数学`  |  中等  |  🔒  |
|  [0626](https://leetcode-cn.com/problems/exchange-seats)  |  [换座位](/solution/0600-0699/0626.Exchange%20Seats/README.md)  |    |  中等  |    |
|  [0627](https://leetcode-cn.com/problems/swap-salary)  |  [变更性别](/solution/0600-0699/0627.Swap%20Salary/README.md)  |    |  简单  |    |
|  [0628](https://leetcode-cn.com/problems/maximum-product-of-three-numbers)  |  [三个数的最大乘积](/solution/0600-0699/0628.Maximum%20Product%20of%20Three%20Numbers/README.md)  |  `数组`,`数学`  |  简单  |    |
|  [0629](https://leetcode-cn.com/problems/k-inverse-pairs-array)  |  [K个逆序对数组](/solution/0600-0699/0629.K%20Inverse%20Pairs%20Array/README.md)  |  `动态规划`  |  困难  |    |
|  [0630](https://leetcode-cn.com/problems/course-schedule-iii)  |  [课程表 III](/solution/0600-0699/0630.Course%20Schedule%20III/README.md)  |  `贪心算法`  |  困难  |    |
|  [0631](https://leetcode-cn.com/problems/design-excel-sum-formula)  |  [设计 Excel 求和公式](/solution/0600-0699/0631.Design%20Excel%20Sum%20Formula/README.md)  |  `设计`  |  困难  |  🔒  |
|  [0632](https://leetcode-cn.com/problems/smallest-range-covering-elements-from-k-lists)  |  [最小区间](/solution/0600-0699/0632.Smallest%20Range%20Covering%20Elements%20from%20K%20Lists/README.md)  |  `哈希表`,`双指针`,`字符串`  |  困难  |    |
|  [0633](https://leetcode-cn.com/problems/sum-of-square-numbers)  |  [平方数之和](/solution/0600-0699/0633.Sum%20of%20Square%20Numbers/README.md)  |  `数学`  |  中等  |    |
|  [0634](https://leetcode-cn.com/problems/find-the-derangement-of-an-array)  |  [寻找数组的错位排列](/solution/0600-0699/0634.Find%20the%20Derangement%20of%20An%20Array/README.md)  |  `数学`  |  中等  |  🔒  |
|  [0635](https://leetcode-cn.com/problems/design-log-storage-system)  |  [设计日志存储系统](/solution/0600-0699/0635.Design%20Log%20Storage%20System/README.md)  |  `设计`,`字符串`  |  中等  |  🔒  |
|  [0636](https://leetcode-cn.com/problems/exclusive-time-of-functions)  |  [函数的独占时间](/solution/0600-0699/0636.Exclusive%20Time%20of%20Functions/README.md)  |  `栈`  |  中等  |    |
|  [0637](https://leetcode-cn.com/problems/average-of-levels-in-binary-tree)  |  [二叉树的层平均值](/solution/0600-0699/0637.Average%20of%20Levels%20in%20Binary%20Tree/README.md)  |  `树`  |  简单  |    |
|  [0638](https://leetcode-cn.com/problems/shopping-offers)  |  [大礼包](/solution/0600-0699/0638.Shopping%20Offers/README.md)  |  `深度优先搜索`,`动态规划`  |  中等  |    |
|  [0639](https://leetcode-cn.com/problems/decode-ways-ii)  |  [解码方法 II](/solution/0600-0699/0639.Decode%20Ways%20II/README.md)  |  `动态规划`  |  困难  |    |
|  [0640](https://leetcode-cn.com/problems/solve-the-equation)  |  [求解方程](/solution/0600-0699/0640.Solve%20the%20Equation/README.md)  |  `数学`  |  中等  |    |
|  [0641](https://leetcode-cn.com/problems/design-circular-deque)  |  [设计循环双端队列](/solution/0600-0699/0641.Design%20Circular%20Deque/README.md)  |  `设计`,`队列`  |  中等  |    |
|  [0642](https://leetcode-cn.com/problems/design-search-autocomplete-system)  |  [设计搜索自动补全系统](/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README.md)  |  `设计`,`字典树`  |  困难  |  🔒  |
|  [0643](https://leetcode-cn.com/problems/maximum-average-subarray-i)  |  [子数组最大平均数 I](/solution/0600-0699/0643.Maximum%20Average%20Subarray%20I/README.md)  |  `数组`  |  简单  |    |
|  [0644](https://leetcode-cn.com/problems/maximum-average-subarray-ii)  |  [子数组最大平均数 II](/solution/0600-0699/0644.Maximum%20Average%20Subarray%20II/README.md)  |  `数组`,`二分查找`  |  困难  |  🔒  |
|  [0645](https://leetcode-cn.com/problems/set-mismatch)  |  [错误的集合](/solution/0600-0699/0645.Set%20Mismatch/README.md)  |  `哈希表`,`数学`  |  简单  |    |
|  [0646](https://leetcode-cn.com/problems/maximum-length-of-pair-chain)  |  [最长数对链](/solution/0600-0699/0646.Maximum%20Length%20of%20Pair%20Chain/README.md)  |  `动态规划`  |  中等  |    |
|  [0647](https://leetcode-cn.com/problems/palindromic-substrings)  |  [回文子串](/solution/0600-0699/0647.Palindromic%20Substrings/README.md)  |  `字符串`,`动态规划`  |  中等  |    |
|  [0648](https://leetcode-cn.com/problems/replace-words)  |  [单词替换](/solution/0600-0699/0648.Replace%20Words/README.md)  |  `字典树`,`哈希表`  |  中等  |    |
|  [0649](https://leetcode-cn.com/problems/dota2-senate)  |  [Dota2 参议院](/solution/0600-0699/0649.Dota2%20Senate/README.md)  |  `贪心算法`  |  中等  |    |
|  [0650](https://leetcode-cn.com/problems/2-keys-keyboard)  |  [只有两个键的键盘](/solution/0600-0699/0650.2%20Keys%20Keyboard/README.md)  |  `动态规划`  |  中等  |    |
|  [0651](https://leetcode-cn.com/problems/4-keys-keyboard)  |  [4键键盘](/solution/0600-0699/0651.4%20Keys%20Keyboard/README.md)  |  `贪心算法`,`数学`,`动态规划`  |  中等  |  🔒  |
|  [0652](https://leetcode-cn.com/problems/find-duplicate-subtrees)  |  [寻找重复的子树](/solution/0600-0699/0652.Find%20Duplicate%20Subtrees/README.md)  |  `树`  |  中等  |    |
|  [0653](https://leetcode-cn.com/problems/two-sum-iv-input-is-a-bst)  |  [两数之和 IV - 输入 BST](/solution/0600-0699/0653.Two%20Sum%20IV%20-%20Input%20is%20a%20BST/README.md)  |  `树`  |  简单  |    |
|  [0654](https://leetcode-cn.com/problems/maximum-binary-tree)  |  [最大二叉树](/solution/0600-0699/0654.Maximum%20Binary%20Tree/README.md)  |  `树`  |  中等  |    |
|  [0655](https://leetcode-cn.com/problems/print-binary-tree)  |  [输出二叉树](/solution/0600-0699/0655.Print%20Binary%20Tree/README.md)  |  `树`  |  中等  |    |
|  [0656](https://leetcode-cn.com/problems/coin-path)  |  [金币路径](/solution/0600-0699/0656.Coin%20Path/README.md)  |  `动态规划`  |  困难  |  🔒  |
|  [0657](https://leetcode-cn.com/problems/robot-return-to-origin)  |  [机器人能否返回原点](/solution/0600-0699/0657.Robot%20Return%20to%20Origin/README.md)  |  `字符串`  |  简单  |    |
|  [0658](https://leetcode-cn.com/problems/find-k-closest-elements)  |  [找到 K 个最接近的元素](/solution/0600-0699/0658.Find%20K%20Closest%20Elements/README.md)  |  `二分查找`  |  中等  |    |
|  [0659](https://leetcode-cn.com/problems/split-array-into-consecutive-subsequences)  |  [分割数组为连续子序列](/solution/0600-0699/0659.Split%20Array%20into%20Consecutive%20Subsequences/README.md)  |  `堆`,`贪心算法`  |  中等  |    |
|  [0660](https://leetcode-cn.com/problems/remove-9)  |  [移除 9](/solution/0600-0699/0660.Remove%209/README.md)  |  `数学`  |  困难  |  🔒  |
|  [0661](https://leetcode-cn.com/problems/image-smoother)  |  [图片平滑器](/solution/0600-0699/0661.Image%20Smoother/README.md)  |  `数组`  |  简单  |    |
|  [0662](https://leetcode-cn.com/problems/maximum-width-of-binary-tree)  |  [二叉树最大宽度](/solution/0600-0699/0662.Maximum%20Width%20of%20Binary%20Tree/README.md)  |  `树`  |  中等  |    |
|  [0663](https://leetcode-cn.com/problems/equal-tree-partition)  |  [均匀树划分](/solution/0600-0699/0663.Equal%20Tree%20Partition/README.md)  |  `树`  |  中等  |  🔒  |
|  [0664](https://leetcode-cn.com/problems/strange-printer)  |  [奇怪的打印机](/solution/0600-0699/0664.Strange%20Printer/README.md)  |  `深度优先搜索`,`动态规划`  |  困难  |    |
|  [0665](https://leetcode-cn.com/problems/non-decreasing-array)  |  [非递减数列](/solution/0600-0699/0665.Non-decreasing%20Array/README.md)  |  `数组`  |  中等  |    |
|  [0666](https://leetcode-cn.com/problems/path-sum-iv)  |  [路径总和 IV](/solution/0600-0699/0666.Path%20Sum%20IV/README.md)  |  `树`  |  中等  |  🔒  |
|  [0667](https://leetcode-cn.com/problems/beautiful-arrangement-ii)  |  [优美的排列 II](/solution/0600-0699/0667.Beautiful%20Arrangement%20II/README.md)  |  `数组`  |  中等  |    |
|  [0668](https://leetcode-cn.com/problems/kth-smallest-number-in-multiplication-table)  |  [乘法表中第k小的数](/solution/0600-0699/0668.Kth%20Smallest%20Number%20in%20Multiplication%20Table/README.md)  |  `二分查找`  |  困难  |    |
|  [0669](https://leetcode-cn.com/problems/trim-a-binary-search-tree)  |  [修剪二叉搜索树](/solution/0600-0699/0669.Trim%20a%20Binary%20Search%20Tree/README.md)  |  `树`,`递归`  |  中等  |    |
|  [0670](https://leetcode-cn.com/problems/maximum-swap)  |  [最大交换](/solution/0600-0699/0670.Maximum%20Swap/README.md)  |  `数组`,`数学`  |  中等  |    |
|  [0671](https://leetcode-cn.com/problems/second-minimum-node-in-a-binary-tree)  |  [二叉树中第二小的节点](/solution/0600-0699/0671.Second%20Minimum%20Node%20In%20a%20Binary%20Tree/README.md)  |  `树`  |  简单  |    |
|  [0672](https://leetcode-cn.com/problems/bulb-switcher-ii)  |  [灯泡开关 Ⅱ](/solution/0600-0699/0672.Bulb%20Switcher%20II/README.md)  |  `数学`  |  中等  |    |
|  [0673](https://leetcode-cn.com/problems/number-of-longest-increasing-subsequence)  |  [最长递增子序列的个数](/solution/0600-0699/0673.Number%20of%20Longest%20Increasing%20Subsequence/README.md)  |  `动态规划`  |  中等  |    |
|  [0674](https://leetcode-cn.com/problems/longest-continuous-increasing-subsequence)  |  [最长连续递增序列](/solution/0600-0699/0674.Longest%20Continuous%20Increasing%20Subsequence/README.md)  |  `数组`  |  简单  |    |
|  [0675](https://leetcode-cn.com/problems/cut-off-trees-for-golf-event)  |  [为高尔夫比赛砍树](/solution/0600-0699/0675.Cut%20Off%20Trees%20for%20Golf%20Event/README.md)  |  `广度优先搜索`  |  困难  |    |
|  [0676](https://leetcode-cn.com/problems/implement-magic-dictionary)  |  [实现一个魔法字典](/solution/0600-0699/0676.Implement%20Magic%20Dictionary/README.md)  |  `字典树`,`哈希表`  |  中等  |    |
|  [0677](https://leetcode-cn.com/problems/map-sum-pairs)  |  [键值映射](/solution/0600-0699/0677.Map%20Sum%20Pairs/README.md)  |  `字典树`  |  中等  |    |
|  [0678](https://leetcode-cn.com/problems/valid-parenthesis-string)  |  [有效的括号字符串](/solution/0600-0699/0678.Valid%20Parenthesis%20String/README.md)  |  `字符串`  |  中等  |    |
|  [0679](https://leetcode-cn.com/problems/24-game)  |  [24 点游戏](/solution/0600-0699/0679.24%20Game/README.md)  |  `深度优先搜索`  |  困难  |    |
|  [0680](https://leetcode-cn.com/problems/valid-palindrome-ii)  |  [验证回文字符串 Ⅱ](/solution/0600-0699/0680.Valid%20Palindrome%20II/README.md)  |  `字符串`  |  简单  |    |
|  [0681](https://leetcode-cn.com/problems/next-closest-time)  |  [最近时刻](/solution/0600-0699/0681.Next%20Closest%20Time/README.md)  |  `字符串`  |  中等  |  🔒  |
|  [0682](https://leetcode-cn.com/problems/baseball-game)  |  [棒球比赛](/solution/0600-0699/0682.Baseball%20Game/README.md)  |  `栈`  |  简单  |    |
|  [0683](https://leetcode-cn.com/problems/k-empty-slots)  |  [K 个关闭的灯泡](/solution/0600-0699/0683.K%20Empty%20Slots/README.md)  |    |  困难  |  🔒  |
|  [0684](https://leetcode-cn.com/problems/redundant-connection)  |  [冗余连接](/solution/0600-0699/0684.Redundant%20Connection/README.md)  |  `树`,`并查集`,`图`  |  中等  |    |
|  [0685](https://leetcode-cn.com/problems/redundant-connection-ii)  |  [冗余连接 II](/solution/0600-0699/0685.Redundant%20Connection%20II/README.md)  |  `树`,`深度优先搜索`,`并查集`,`图`  |  困难  |    |
|  [0686](https://leetcode-cn.com/problems/repeated-string-match)  |  [重复叠加字符串匹配](/solution/0600-0699/0686.Repeated%20String%20Match/README.md)  |  `字符串`  |  中等  |    |
|  [0687](https://leetcode-cn.com/problems/longest-univalue-path)  |  [最长同值路径](/solution/0600-0699/0687.Longest%20Univalue%20Path/README.md)  |  `树`,`递归`  |  中等  |    |
|  [0688](https://leetcode-cn.com/problems/knight-probability-in-chessboard)  |  [“马”在棋盘上的概率](/solution/0600-0699/0688.Knight%20Probability%20in%20Chessboard/README.md)  |  `动态规划`  |  中等  |    |
|  [0689](https://leetcode-cn.com/problems/maximum-sum-of-3-non-overlapping-subarrays)  |  [三个无重叠子数组的最大和](/solution/0600-0699/0689.Maximum%20Sum%20of%203%20Non-Overlapping%20Subarrays/README.md)  |  `数组`,`动态规划`  |  困难  |    |
|  [0690](https://leetcode-cn.com/problems/employee-importance)  |  [员工的重要性](/solution/0600-0699/0690.Employee%20Importance/README.md)  |  `深度优先搜索`,`广度优先搜索`,`哈希表`  |  简单  |    |
|  [0691](https://leetcode-cn.com/problems/stickers-to-spell-word)  |  [贴纸拼词](/solution/0600-0699/0691.Stickers%20to%20Spell%20Word/README.md)  |  `动态规划`,`回溯算法`  |  困难  |    |
|  [0692](https://leetcode-cn.com/problems/top-k-frequent-words)  |  [前K个高频单词](/solution/0600-0699/0692.Top%20K%20Frequent%20Words/README.md)  |  `堆`,`字典树`,`哈希表`  |  中等  |    |
|  [0693](https://leetcode-cn.com/problems/binary-number-with-alternating-bits)  |  [交替位二进制数](/solution/0600-0699/0693.Binary%20Number%20with%20Alternating%20Bits/README.md)  |  `位运算`  |  简单  |    |
|  [0694](https://leetcode-cn.com/problems/number-of-distinct-islands)  |  [不同岛屿的数量](/solution/0600-0699/0694.Number%20of%20Distinct%20Islands/README.md)  |  `深度优先搜索`,`广度优先搜索`,`哈希表`  |  中等  |  🔒  |
|  [0695](https://leetcode-cn.com/problems/max-area-of-island)  |  [岛屿的最大面积](/solution/0600-0699/0695.Max%20Area%20of%20Island/README.md)  |  `深度优先搜索`,`数组`  |  中等  |    |
|  [0696](https://leetcode-cn.com/problems/count-binary-substrings)  |  [计数二进制子串](/solution/0600-0699/0696.Count%20Binary%20Substrings/README.md)  |  `字符串`  |  简单  |    |
|  [0697](https://leetcode-cn.com/problems/degree-of-an-array)  |  [数组的度](/solution/0600-0699/0697.Degree%20of%20an%20Array/README.md)  |  `数组`  |  简单  |    |
|  [0698](https://leetcode-cn.com/problems/partition-to-k-equal-sum-subsets)  |  [划分为k个相等的子集](/solution/0600-0699/0698.Partition%20to%20K%20Equal%20Sum%20Subsets/README.md)  |  `递归`,`动态规划`  |  中等  |    |
|  [0699](https://leetcode-cn.com/problems/falling-squares)  |  [掉落的方块](/solution/0600-0699/0699.Falling%20Squares/README.md)  |  `线段树`  |  困难  |    |
|  [0700](https://leetcode-cn.com/problems/search-in-a-binary-search-tree)  |  [二叉搜索树中的搜索](/solution/0700-0799/0700.Search%20in%20a%20Binary%20Search%20Tree/README.md)  |  `树`  |  简单  |    |
|  [0701](https://leetcode-cn.com/problems/insert-into-a-binary-search-tree)  |  [二叉搜索树中的插入操作](/solution/0700-0799/0701.Insert%20into%20a%20Binary%20Search%20Tree/README.md)  |  `树`  |  中等  |    |
|  [0702](https://leetcode-cn.com/problems/search-in-a-sorted-array-of-unknown-size)  |  [搜索长度未知的有序数组](/solution/0700-0799/0702.Search%20in%20a%20Sorted%20Array%20of%20Unknown%20Size/README.md)  |  `二分查找`  |  中等  |  🔒  |
|  [0703](https://leetcode-cn.com/problems/kth-largest-element-in-a-stream)  |  [数据流中的第 K 大元素](/solution/0700-0799/0703.Kth%20Largest%20Element%20in%20a%20Stream/README.md)  |  `堆`,`设计`  |  简单  |    |
|  [0704](https://leetcode-cn.com/problems/binary-search)  |  [二分查找](/solution/0700-0799/0704.Binary%20Search/README.md)  |  `二分查找`  |  简单  |    |
|  [0705](https://leetcode-cn.com/problems/design-hashset)  |  [设计哈希集合](/solution/0700-0799/0705.Design%20HashSet/README.md)  |  `设计`,`哈希表`  |  简单  |    |
|  [0706](https://leetcode-cn.com/problems/design-hashmap)  |  [设计哈希映射](/solution/0700-0799/0706.Design%20HashMap/README.md)  |  `设计`,`哈希表`  |  简单  |    |
|  [0707](https://leetcode-cn.com/problems/design-linked-list)  |  [设计链表](/solution/0700-0799/0707.Design%20Linked%20List/README.md)  |  `设计`,`链表`  |  中等  |    |
|  [0708](https://leetcode-cn.com/problems/insert-into-a-sorted-circular-linked-list)  |  [循环有序列表的插入](/solution/0700-0799/0708.Insert%20into%20a%20Sorted%20Circular%20Linked%20List/README.md)  |  `链表`  |  中等  |  🔒  |
|  [0709](https://leetcode-cn.com/problems/to-lower-case)  |  [转换成小写字母](/solution/0700-0799/0709.To%20Lower%20Case/README.md)  |  `字符串`  |  简单  |    |
|  [0710](https://leetcode-cn.com/problems/random-pick-with-blacklist)  |  [黑名单中的随机数](/solution/0700-0799/0710.Random%20Pick%20with%20Blacklist/README.md)  |  `排序`,`哈希表`,`二分查找`  |  困难  |    |
|  [0711](https://leetcode-cn.com/problems/number-of-distinct-islands-ii)  |  [不同岛屿的数量 II](/solution/0700-0799/0711.Number%20of%20Distinct%20Islands%20II/README.md)  |  `深度优先搜索`,`哈希表`  |  困难  |  🔒  |
|  [0712](https://leetcode-cn.com/problems/minimum-ascii-delete-sum-for-two-strings)  |  [两个字符串的最小ASCII删除和](/solution/0700-0799/0712.Minimum%20ASCII%20Delete%20Sum%20for%20Two%20Strings/README.md)  |  `动态规划`  |  中等  |    |
|  [0713](https://leetcode-cn.com/problems/subarray-product-less-than-k)  |  [乘积小于K的子数组](/solution/0700-0799/0713.Subarray%20Product%20Less%20Than%20K/README.md)  |  `数组`,`双指针`  |  中等  |    |
|  [0714](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee)  |  [买卖股票的最佳时机含手续费](/solution/0700-0799/0714.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee/README.md)  |  `贪心算法`,`数组`,`动态规划`  |  中等  |    |
|  [0715](https://leetcode-cn.com/problems/range-module)  |  [Range 模块](/solution/0700-0799/0715.Range%20Module/README.md)  |  `线段树`  |  困难  |    |
|  [0716](https://leetcode-cn.com/problems/max-stack)  |  [最大栈](/solution/0700-0799/0716.Max%20Stack/README.md)  |  `设计`  |  简单  |  🔒  |
|  [0717](https://leetcode-cn.com/problems/1-bit-and-2-bit-characters)  |  [1比特与2比特字符](/solution/0700-0799/0717.1-bit%20and%202-bit%20Characters/README.md)  |  `数组`  |  简单  |    |
|  [0718](https://leetcode-cn.com/problems/maximum-length-of-repeated-subarray)  |  [最长重复子数组](/solution/0700-0799/0718.Maximum%20Length%20of%20Repeated%20Subarray/README.md)  |  `数组`,`哈希表`,`二分查找`,`动态规划`  |  中等  |    |
|  [0719](https://leetcode-cn.com/problems/find-k-th-smallest-pair-distance)  |  [找出第 k 小的距离对](/solution/0700-0799/0719.Find%20K-th%20Smallest%20Pair%20Distance/README.md)  |  `堆`,`数组`,`二分查找`  |  困难  |    |
|  [0720](https://leetcode-cn.com/problems/longest-word-in-dictionary)  |  [词典中最长的单词](/solution/0700-0799/0720.Longest%20Word%20in%20Dictionary/README.md)  |  `字典树`,`哈希表`  |  简单  |    |
|  [0721](https://leetcode-cn.com/problems/accounts-merge)  |  [账户合并](/solution/0700-0799/0721.Accounts%20Merge/README.md)  |  `深度优先搜索`,`并查集`  |  中等  |    |
|  [0722](https://leetcode-cn.com/problems/remove-comments)  |  [删除注释](/solution/0700-0799/0722.Remove%20Comments/README.md)  |  `字符串`  |  中等  |    |
|  [0723](https://leetcode-cn.com/problems/candy-crush)  |  [粉碎糖果](/solution/0700-0799/0723.Candy%20Crush/README.md)  |  `数组`,`双指针`  |  中等  |  🔒  |
|  [0724](https://leetcode-cn.com/problems/find-pivot-index)  |  [寻找数组的中心下标](/solution/0700-0799/0724.Find%20Pivot%20Index/README.md)  |  `数组`  |  简单  |    |
|  [0725](https://leetcode-cn.com/problems/split-linked-list-in-parts)  |  [分隔链表](/solution/0700-0799/0725.Split%20Linked%20List%20in%20Parts/README.md)  |  `链表`  |  中等  |    |
|  [0726](https://leetcode-cn.com/problems/number-of-atoms)  |  [原子的数量](/solution/0700-0799/0726.Number%20of%20Atoms/README.md)  |  `栈`,`递归`,`哈希表`  |  困难  |    |
|  [0727](https://leetcode-cn.com/problems/minimum-window-subsequence)  |  [最小窗口子序列](/solution/0700-0799/0727.Minimum%20Window%20Subsequence/README.md)  |  `动态规划`  |  困难  |  🔒  |
|  [0728](https://leetcode-cn.com/problems/self-dividing-numbers)  |  [自除数](/solution/0700-0799/0728.Self%20Dividing%20Numbers/README.md)  |  `数学`  |  简单  |    |
|  [0729](https://leetcode-cn.com/problems/my-calendar-i)  |  [我的日程安排表 I](/solution/0700-0799/0729.My%20Calendar%20I/README.md)  |  `数组`  |  中等  |    |
|  [0730](https://leetcode-cn.com/problems/count-different-palindromic-subsequences)  |  [统计不同回文子序列](/solution/0700-0799/0730.Count%20Different%20Palindromic%20Subsequences/README.md)  |  `字符串`,`动态规划`  |  困难  |    |
|  [0731](https://leetcode-cn.com/problems/my-calendar-ii)  |  [我的日程安排表 II](/solution/0700-0799/0731.My%20Calendar%20II/README.md)  |    |  中等  |    |
|  [0732](https://leetcode-cn.com/problems/my-calendar-iii)  |  [我的日程安排表 III](/solution/0700-0799/0732.My%20Calendar%20III/README.md)  |  `线段树`  |  困难  |    |
|  [0733](https://leetcode-cn.com/problems/flood-fill)  |  [图像渲染](/solution/0700-0799/0733.Flood%20Fill/README.md)  |  `深度优先搜索`  |  简单  |    |
|  [0734](https://leetcode-cn.com/problems/sentence-similarity)  |  [句子相似性](/solution/0700-0799/0734.Sentence%20Similarity/README.md)  |  `哈希表`  |  简单  |  🔒  |
|  [0735](https://leetcode-cn.com/problems/asteroid-collision)  |  [行星碰撞](/solution/0700-0799/0735.Asteroid%20Collision/README.md)  |  `栈`  |  中等  |    |
|  [0736](https://leetcode-cn.com/problems/parse-lisp-expression)  |  [Lisp 语法解析](/solution/0700-0799/0736.Parse%20Lisp%20Expression/README.md)  |  `字符串`  |  困难  |    |
|  [0737](https://leetcode-cn.com/problems/sentence-similarity-ii)  |  [句子相似性 II](/solution/0700-0799/0737.Sentence%20Similarity%20II/README.md)  |  `深度优先搜索`,`并查集`  |  中等  |  🔒  |
|  [0738](https://leetcode-cn.com/problems/monotone-increasing-digits)  |  [单调递增的数字](/solution/0700-0799/0738.Monotone%20Increasing%20Digits/README.md)  |  `贪心算法`  |  中等  |    |
|  [0739](https://leetcode-cn.com/problems/daily-temperatures)  |  [每日温度](/solution/0700-0799/0739.Daily%20Temperatures/README.md)  |  `栈`,`哈希表`  |  中等  |    |
|  [0740](https://leetcode-cn.com/problems/delete-and-earn)  |  [删除并获得点数](/solution/0700-0799/0740.Delete%20and%20Earn/README.md)  |  `动态规划`  |  中等  |    |
|  [0741](https://leetcode-cn.com/problems/cherry-pickup)  |  [摘樱桃](/solution/0700-0799/0741.Cherry%20Pickup/README.md)  |  `动态规划`  |  困难  |    |
|  [0742](https://leetcode-cn.com/problems/closest-leaf-in-a-binary-tree)  |  [二叉树最近的叶节点](/solution/0700-0799/0742.Closest%20Leaf%20in%20a%20Binary%20Tree/README.md)  |  `树`  |  中等  |  🔒  |
|  [0743](https://leetcode-cn.com/problems/network-delay-time)  |  [网络延迟时间](/solution/0700-0799/0743.Network%20Delay%20Time/README.md)  |  `堆`,`深度优先搜索`,`广度优先搜索`,`图`  |  中等  |    |
|  [0744](https://leetcode-cn.com/problems/find-smallest-letter-greater-than-target)  |  [寻找比目标字母大的最小字母](/solution/0700-0799/0744.Find%20Smallest%20Letter%20Greater%20Than%20Target/README.md)  |  `二分查找`  |  简单  |    |
|  [0745](https://leetcode-cn.com/problems/prefix-and-suffix-search)  |  [前缀和后缀搜索](/solution/0700-0799/0745.Prefix%20and%20Suffix%20Search/README.md)  |  `字典树`  |  困难  |    |
|  [0746](https://leetcode-cn.com/problems/min-cost-climbing-stairs)  |  [使用最小花费爬楼梯](/solution/0700-0799/0746.Min%20Cost%20Climbing%20Stairs/README.md)  |  `数组`,`动态规划`  |  简单  |    |
|  [0747](https://leetcode-cn.com/problems/largest-number-at-least-twice-of-others)  |  [至少是其他数字两倍的最大数](/solution/0700-0799/0747.Largest%20Number%20At%20Least%20Twice%20of%20Others/README.md)  |  `数组`  |  简单  |    |
|  [0748](https://leetcode-cn.com/problems/shortest-completing-word)  |  [最短补全词](/solution/0700-0799/0748.Shortest%20Completing%20Word/README.md)  |  `哈希表`  |  简单  |    |
|  [0749](https://leetcode-cn.com/problems/contain-virus)  |  [隔离病毒](/solution/0700-0799/0749.Contain%20Virus/README.md)  |  `深度优先搜索`  |  困难  |    |
|  [0750](https://leetcode-cn.com/problems/number-of-corner-rectangles)  |  [角矩形的数量](/solution/0700-0799/0750.Number%20Of%20Corner%20Rectangles/README.md)  |  `动态规划`  |  中等  |  🔒  |
|  [0751](https://leetcode-cn.com/problems/ip-to-cidr)  |  [IP 到 CIDR](/solution/0700-0799/0751.IP%20to%20CIDR/README.md)  |  `位运算`  |  中等  |  🔒  |
|  [0752](https://leetcode-cn.com/problems/open-the-lock)  |  [打开转盘锁](/solution/0700-0799/0752.Open%20the%20Lock/README.md)  |  `广度优先搜索`  |  中等  |    |
|  [0753](https://leetcode-cn.com/problems/cracking-the-safe)  |  [破解保险箱](/solution/0700-0799/0753.Cracking%20the%20Safe/README.md)  |  `深度优先搜索`,`数学`  |  困难  |    |
|  [0754](https://leetcode-cn.com/problems/reach-a-number)  |  [到达终点数字](/solution/0700-0799/0754.Reach%20a%20Number/README.md)  |  `数学`  |  中等  |    |
|  [0755](https://leetcode-cn.com/problems/pour-water)  |  [倒水](/solution/0700-0799/0755.Pour%20Water/README.md)  |  `数组`  |  中等  |  🔒  |
|  [0756](https://leetcode-cn.com/problems/pyramid-transition-matrix)  |  [金字塔转换矩阵](/solution/0700-0799/0756.Pyramid%20Transition%20Matrix/README.md)  |  `位运算`,`深度优先搜索`  |  中等  |    |
|  [0757](https://leetcode-cn.com/problems/set-intersection-size-at-least-two)  |  [设置交集大小至少为2](/solution/0700-0799/0757.Set%20Intersection%20Size%20At%20Least%20Two/README.md)  |  `贪心算法`  |  困难  |    |
|  [0758](https://leetcode-cn.com/problems/bold-words-in-string)  |  [字符串中的加粗单词](/solution/0700-0799/0758.Bold%20Words%20in%20String/README.md)  |  `字符串`  |  中等  |  🔒  |
|  [0759](https://leetcode-cn.com/problems/employee-free-time)  |  [员工空闲时间](/solution/0700-0799/0759.Employee%20Free%20Time/README.md)  |  `堆`,`贪心算法`  |  困难  |  🔒  |
|  [0760](https://leetcode-cn.com/problems/find-anagram-mappings)  |  [找出变位映射](/solution/0700-0799/0760.Find%20Anagram%20Mappings/README.md)  |  `哈希表`  |  简单  |  🔒  |
|  [0761](https://leetcode-cn.com/problems/special-binary-string)  |  [特殊的二进制序列](/solution/0700-0799/0761.Special%20Binary%20String/README.md)  |  `递归`,`字符串`  |  困难  |    |
|  [0762](https://leetcode-cn.com/problems/prime-number-of-set-bits-in-binary-representation)  |  [二进制表示中质数个计算置位](/solution/0700-0799/0762.Prime%20Number%20of%20Set%20Bits%20in%20Binary%20Representation/README.md)  |  `位运算`  |  简单  |    |
|  [0763](https://leetcode-cn.com/problems/partition-labels)  |  [划分字母区间](/solution/0700-0799/0763.Partition%20Labels/README.md)  |  `贪心算法`,`双指针`  |  中等  |    |
|  [0764](https://leetcode-cn.com/problems/largest-plus-sign)  |  [最大加号标志](/solution/0700-0799/0764.Largest%20Plus%20Sign/README.md)  |  `动态规划`  |  中等  |    |
|  [0765](https://leetcode-cn.com/problems/couples-holding-hands)  |  [情侣牵手](/solution/0700-0799/0765.Couples%20Holding%20Hands/README.md)  |  `贪心算法`,`并查集`,`图`  |  困难  |    |
|  [0766](https://leetcode-cn.com/problems/toeplitz-matrix)  |  [托普利茨矩阵](/solution/0700-0799/0766.Toeplitz%20Matrix/README.md)  |  `数组`  |  简单  |    |
|  [0767](https://leetcode-cn.com/problems/reorganize-string)  |  [重构字符串](/solution/0700-0799/0767.Reorganize%20String/README.md)  |  `堆`,`贪心算法`,`排序`,`字符串`  |  中等  |    |
|  [0768](https://leetcode-cn.com/problems/max-chunks-to-make-sorted-ii)  |  [最多能完成排序的块 II](/solution/0700-0799/0768.Max%20Chunks%20To%20Make%20Sorted%20II/README.md)  |  `数组`  |  困难  |    |
|  [0769](https://leetcode-cn.com/problems/max-chunks-to-make-sorted)  |  [最多能完成排序的块](/solution/0700-0799/0769.Max%20Chunks%20To%20Make%20Sorted/README.md)  |  `数组`  |  中等  |    |
|  [0770](https://leetcode-cn.com/problems/basic-calculator-iv)  |  [基本计算器 IV](/solution/0700-0799/0770.Basic%20Calculator%20IV/README.md)  |  `栈`,`哈希表`,`字符串`  |  困难  |    |
|  [0771](https://leetcode-cn.com/problems/jewels-and-stones)  |  [宝石与石头](/solution/0700-0799/0771.Jewels%20and%20Stones/README.md)  |  `哈希表`  |  简单  |    |
|  [0772](https://leetcode-cn.com/problems/basic-calculator-iii)  |  [基本计算器 III](/solution/0700-0799/0772.Basic%20Calculator%20III/README.md)  |  `栈`,`字符串`  |  困难  |  🔒  |
|  [0773](https://leetcode-cn.com/problems/sliding-puzzle)  |  [滑动谜题](/solution/0700-0799/0773.Sliding%20Puzzle/README.md)  |  `广度优先搜索`  |  困难  |    |
|  [0774](https://leetcode-cn.com/problems/minimize-max-distance-to-gas-station)  |  [最小化去加油站的最大距离](/solution/0700-0799/0774.Minimize%20Max%20Distance%20to%20Gas%20Station/README.md)  |  `二分查找`  |  困难  |  🔒  |
|  [0775](https://leetcode-cn.com/problems/global-and-local-inversions)  |  [全局倒置与局部倒置](/solution/0700-0799/0775.Global%20and%20Local%20Inversions/README.md)  |  `数组`,`数学`  |  中等  |    |
|  [0776](https://leetcode-cn.com/problems/split-bst)  |  [拆分二叉搜索树](/solution/0700-0799/0776.Split%20BST/README.md)  |  `树`,`递归`  |  中等  |  🔒  |
|  [0777](https://leetcode-cn.com/problems/swap-adjacent-in-lr-string)  |  [在LR字符串中交换相邻字符](/solution/0700-0799/0777.Swap%20Adjacent%20in%20LR%20String/README.md)  |  `脑筋急转弯`  |  中等  |    |
|  [0778](https://leetcode-cn.com/problems/swim-in-rising-water)  |  [水位上升的泳池中游泳](/solution/0700-0799/0778.Swim%20in%20Rising%20Water/README.md)  |  `堆`,`深度优先搜索`,`并查集`,`二分查找`  |  困难  |    |
|  [0779](https://leetcode-cn.com/problems/k-th-symbol-in-grammar)  |  [第K个语法符号](/solution/0700-0799/0779.K-th%20Symbol%20in%20Grammar/README.md)  |  `递归`  |  中等  |    |
|  [0780](https://leetcode-cn.com/problems/reaching-points)  |  [到达终点](/solution/0700-0799/0780.Reaching%20Points/README.md)  |  `数学`  |  困难  |    |
|  [0781](https://leetcode-cn.com/problems/rabbits-in-forest)  |  [森林中的兔子](/solution/0700-0799/0781.Rabbits%20in%20Forest/README.md)  |  `哈希表`,`数学`  |  中等  |    |
|  [0782](https://leetcode-cn.com/problems/transform-to-chessboard)  |  [变为棋盘](/solution/0700-0799/0782.Transform%20to%20Chessboard/README.md)  |  `数组`,`数学`  |  困难  |    |
|  [0783](https://leetcode-cn.com/problems/minimum-distance-between-bst-nodes)  |  [二叉搜索树节点最小距离](/solution/0700-0799/0783.Minimum%20Distance%20Between%20BST%20Nodes/README.md)  |  `树`,`深度优先搜索`,`递归`  |  简单  |    |
|  [0784](https://leetcode-cn.com/problems/letter-case-permutation)  |  [字母大小写全排列](/solution/0700-0799/0784.Letter%20Case%20Permutation/README.md)  |  `位运算`,`回溯算法`  |  中等  |    |
|  [0785](https://leetcode-cn.com/problems/is-graph-bipartite)  |  [判断二分图](/solution/0700-0799/0785.Is%20Graph%20Bipartite/README.md)  |  `深度优先搜索`,`广度优先搜索`,`图`  |  中等  |    |
|  [0786](https://leetcode-cn.com/problems/k-th-smallest-prime-fraction)  |  [第 K 个最小的素数分数](/solution/0700-0799/0786.K-th%20Smallest%20Prime%20Fraction/README.md)  |  `堆`,`二分查找`  |  困难  |    |
|  [0787](https://leetcode-cn.com/problems/cheapest-flights-within-k-stops)  |  [K 站中转内最便宜的航班](/solution/0700-0799/0787.Cheapest%20Flights%20Within%20K%20Stops/README.md)  |  `堆`,`广度优先搜索`,`动态规划`  |  中等  |    |
|  [0788](https://leetcode-cn.com/problems/rotated-digits)  |  [旋转数字](/solution/0700-0799/0788.Rotated%20Digits/README.md)  |  `字符串`  |  简单  |    |
|  [0789](https://leetcode-cn.com/problems/escape-the-ghosts)  |  [逃脱阻碍者](/solution/0700-0799/0789.Escape%20The%20Ghosts/README.md)  |  `数学`  |  中等  |    |
|  [0790](https://leetcode-cn.com/problems/domino-and-tromino-tiling)  |  [多米诺和托米诺平铺](/solution/0700-0799/0790.Domino%20and%20Tromino%20Tiling/README.md)  |  `动态规划`  |  中等  |    |
|  [0791](https://leetcode-cn.com/problems/custom-sort-string)  |  [自定义字符串排序](/solution/0700-0799/0791.Custom%20Sort%20String/README.md)  |  `字符串`  |  中等  |    |
|  [0792](https://leetcode-cn.com/problems/number-of-matching-subsequences)  |  [匹配子序列的单词数](/solution/0700-0799/0792.Number%20of%20Matching%20Subsequences/README.md)  |  `数组`  |  中等  |    |
|  [0793](https://leetcode-cn.com/problems/preimage-size-of-factorial-zeroes-function)  |  [阶乘函数后 K 个零](/solution/0700-0799/0793.Preimage%20Size%20of%20Factorial%20Zeroes%20Function/README.md)  |  `二分查找`  |  困难  |    |
|  [0794](https://leetcode-cn.com/problems/valid-tic-tac-toe-state)  |  [有效的井字游戏](/solution/0700-0799/0794.Valid%20Tic-Tac-Toe%20State/README.md)  |  `递归`,`数学`  |  中等  |    |
|  [0795](https://leetcode-cn.com/problems/number-of-subarrays-with-bounded-maximum)  |  [区间子数组个数](/solution/0700-0799/0795.Number%20of%20Subarrays%20with%20Bounded%20Maximum/README.md)  |  `数组`  |  中等  |    |
|  [0796](https://leetcode-cn.com/problems/rotate-string)  |  [旋转字符串](/solution/0700-0799/0796.Rotate%20String/README.md)  |    |  简单  |    |
|  [0797](https://leetcode-cn.com/problems/all-paths-from-source-to-target)  |  [所有可能的路径](/solution/0700-0799/0797.All%20Paths%20From%20Source%20to%20Target/README.md)  |  `深度优先搜索`,`图`,`回溯算法`  |  中等  |    |
|  [0798](https://leetcode-cn.com/problems/smallest-rotation-with-highest-score)  |  [得分最高的最小轮调](/solution/0700-0799/0798.Smallest%20Rotation%20with%20Highest%20Score/README.md)  |    |  困难  |    |
|  [0799](https://leetcode-cn.com/problems/champagne-tower)  |  [香槟塔](/solution/0700-0799/0799.Champagne%20Tower/README.md)  |  `动态规划`  |  中等  |    |
|  [0800](https://leetcode-cn.com/problems/similar-rgb-color)  |  [相似 RGB 颜色](/solution/0800-0899/0800.Similar%20RGB%20Color/README.md)  |  `数学`,`字符串`  |  简单  |  🔒  |
|  [0801](https://leetcode-cn.com/problems/minimum-swaps-to-make-sequences-increasing)  |  [使序列递增的最小交换次数](/solution/0800-0899/0801.Minimum%20Swaps%20To%20Make%20Sequences%20Increasing/README.md)  |  `动态规划`  |  中等  |    |
|  [0802](https://leetcode-cn.com/problems/find-eventual-safe-states)  |  [找到最终的安全状态](/solution/0800-0899/0802.Find%20Eventual%20Safe%20States/README.md)  |  `深度优先搜索`,`图`  |  中等  |    |
|  [0803](https://leetcode-cn.com/problems/bricks-falling-when-hit)  |  [打砖块](/solution/0800-0899/0803.Bricks%20Falling%20When%20Hit/README.md)  |  `并查集`  |  困难  |    |
|  [0804](https://leetcode-cn.com/problems/unique-morse-code-words)  |  [唯一摩尔斯密码词](/solution/0800-0899/0804.Unique%20Morse%20Code%20Words/README.md)  |  `字符串`  |  简单  |    |
|  [0805](https://leetcode-cn.com/problems/split-array-with-same-average)  |  [数组的均值分割](/solution/0800-0899/0805.Split%20Array%20With%20Same%20Average/README.md)  |  `数学`  |  困难  |    |
|  [0806](https://leetcode-cn.com/problems/number-of-lines-to-write-string)  |  [写字符串需要的行数](/solution/0800-0899/0806.Number%20of%20Lines%20To%20Write%20String/README.md)  |    |  简单  |    |
|  [0807](https://leetcode-cn.com/problems/max-increase-to-keep-city-skyline)  |  [保持城市天际线](/solution/0800-0899/0807.Max%20Increase%20to%20Keep%20City%20Skyline/README.md)  |    |  中等  |    |
|  [0808](https://leetcode-cn.com/problems/soup-servings)  |  [分汤](/solution/0800-0899/0808.Soup%20Servings/README.md)  |  `动态规划`  |  中等  |    |
|  [0809](https://leetcode-cn.com/problems/expressive-words)  |  [情感丰富的文字](/solution/0800-0899/0809.Expressive%20Words/README.md)  |  `字符串`  |  中等  |    |
|  [0810](https://leetcode-cn.com/problems/chalkboard-xor-game)  |  [黑板异或游戏](/solution/0800-0899/0810.Chalkboard%20XOR%20Game/README.md)  |  `数学`  |  困难  |    |
|  [0811](https://leetcode-cn.com/problems/subdomain-visit-count)  |  [子域名访问计数](/solution/0800-0899/0811.Subdomain%20Visit%20Count/README.md)  |  `哈希表`  |  简单  |    |
|  [0812](https://leetcode-cn.com/problems/largest-triangle-area)  |  [最大三角形面积](/solution/0800-0899/0812.Largest%20Triangle%20Area/README.md)  |  `数学`  |  简单  |    |
|  [0813](https://leetcode-cn.com/problems/largest-sum-of-averages)  |  [最大平均值和的分组](/solution/0800-0899/0813.Largest%20Sum%20of%20Averages/README.md)  |  `动态规划`  |  中等  |    |
|  [0814](https://leetcode-cn.com/problems/binary-tree-pruning)  |  [二叉树剪枝](/solution/0800-0899/0814.Binary%20Tree%20Pruning/README.md)  |  `树`  |  中等  |    |
|  [0815](https://leetcode-cn.com/problems/bus-routes)  |  [公交路线](/solution/0800-0899/0815.Bus%20Routes/README.md)  |  `广度优先搜索`  |  困难  |    |
|  [0816](https://leetcode-cn.com/problems/ambiguous-coordinates)  |  [模糊坐标](/solution/0800-0899/0816.Ambiguous%20Coordinates/README.md)  |  `字符串`  |  中等  |    |
|  [0817](https://leetcode-cn.com/problems/linked-list-components)  |  [链表组件](/solution/0800-0899/0817.Linked%20List%20Components/README.md)  |  `链表`  |  中等  |    |
|  [0818](https://leetcode-cn.com/problems/race-car)  |  [赛车](/solution/0800-0899/0818.Race%20Car/README.md)  |  `堆`,`动态规划`  |  困难  |    |
|  [0819](https://leetcode-cn.com/problems/most-common-word)  |  [最常见的单词](/solution/0800-0899/0819.Most%20Common%20Word/README.md)  |  `字符串`  |  简单  |    |
|  [0820](https://leetcode-cn.com/problems/short-encoding-of-words)  |  [单词的压缩编码](/solution/0800-0899/0820.Short%20Encoding%20of%20Words/README.md)  |    |  中等  |    |
|  [0821](https://leetcode-cn.com/problems/shortest-distance-to-a-character)  |  [字符的最短距离](/solution/0800-0899/0821.Shortest%20Distance%20to%20a%20Character/README.md)  |    |  简单  |    |
|  [0822](https://leetcode-cn.com/problems/card-flipping-game)  |  [翻转卡片游戏](/solution/0800-0899/0822.Card%20Flipping%20Game/README.md)  |    |  中等  |    |
|  [0823](https://leetcode-cn.com/problems/binary-trees-with-factors)  |  [带因子的二叉树](/solution/0800-0899/0823.Binary%20Trees%20With%20Factors/README.md)  |    |  中等  |    |
|  [0824](https://leetcode-cn.com/problems/goat-latin)  |  [山羊拉丁文](/solution/0800-0899/0824.Goat%20Latin/README.md)  |  `字符串`  |  简单  |    |
|  [0825](https://leetcode-cn.com/problems/friends-of-appropriate-ages)  |  [适龄的朋友](/solution/0800-0899/0825.Friends%20Of%20Appropriate%20Ages/README.md)  |  `数组`  |  中等  |    |
|  [0826](https://leetcode-cn.com/problems/most-profit-assigning-work)  |  [安排工作以达到最大收益](/solution/0800-0899/0826.Most%20Profit%20Assigning%20Work/README.md)  |  `双指针`  |  中等  |    |
|  [0827](https://leetcode-cn.com/problems/making-a-large-island)  |  [最大人工岛](/solution/0800-0899/0827.Making%20A%20Large%20Island/README.md)  |  `深度优先搜索`,`广度优先搜索`  |  困难  |    |
|  [0828](https://leetcode-cn.com/problems/count-unique-characters-of-all-substrings-of-a-given-string)  |  [统计子串中的唯一字符](/solution/0800-0899/0828.Count%20Unique%20Characters%20of%20All%20Substrings%20of%20a%20Given%20String/README.md)  |  `双指针`  |  困难  |    |
|  [0829](https://leetcode-cn.com/problems/consecutive-numbers-sum)  |  [连续整数求和](/solution/0800-0899/0829.Consecutive%20Numbers%20Sum/README.md)  |  `数学`  |  困难  |    |
|  [0830](https://leetcode-cn.com/problems/positions-of-large-groups)  |  [较大分组的位置](/solution/0800-0899/0830.Positions%20of%20Large%20Groups/README.md)  |  `数组`  |  简单  |    |
|  [0831](https://leetcode-cn.com/problems/masking-personal-information)  |  [隐藏个人信息](/solution/0800-0899/0831.Masking%20Personal%20Information/README.md)  |  `字符串`  |  中等  |    |
|  [0832](https://leetcode-cn.com/problems/flipping-an-image)  |  [翻转图像](/solution/0800-0899/0832.Flipping%20an%20Image/README.md)  |  `数组`  |  简单  |    |
|  [0833](https://leetcode-cn.com/problems/find-and-replace-in-string)  |  [字符串中的查找与替换](/solution/0800-0899/0833.Find%20And%20Replace%20in%20String/README.md)  |  `字符串`  |  中等  |    |
|  [0834](https://leetcode-cn.com/problems/sum-of-distances-in-tree)  |  [树中距离之和](/solution/0800-0899/0834.Sum%20of%20Distances%20in%20Tree/README.md)  |  `树`,`深度优先搜索`  |  困难  |    |
|  [0835](https://leetcode-cn.com/problems/image-overlap)  |  [图像重叠](/solution/0800-0899/0835.Image%20Overlap/README.md)  |  `数组`  |  中等  |    |
|  [0836](https://leetcode-cn.com/problems/rectangle-overlap)  |  [矩形重叠](/solution/0800-0899/0836.Rectangle%20Overlap/README.md)  |  `数学`  |  简单  |    |
|  [0837](https://leetcode-cn.com/problems/new-21-game)  |  [新21点](/solution/0800-0899/0837.New%2021%20Game/README.md)  |  `动态规划`  |  中等  |    |
|  [0838](https://leetcode-cn.com/problems/push-dominoes)  |  [推多米诺](/solution/0800-0899/0838.Push%20Dominoes/README.md)  |  `双指针`,`动态规划`  |  中等  |    |
|  [0839](https://leetcode-cn.com/problems/similar-string-groups)  |  [相似字符串组](/solution/0800-0899/0839.Similar%20String%20Groups/README.md)  |  `深度优先搜索`,`并查集`,`图`  |  困难  |    |
|  [0840](https://leetcode-cn.com/problems/magic-squares-in-grid)  |  [矩阵中的幻方](/solution/0800-0899/0840.Magic%20Squares%20In%20Grid/README.md)  |  `数组`  |  中等  |    |
|  [0841](https://leetcode-cn.com/problems/keys-and-rooms)  |  [钥匙和房间](/solution/0800-0899/0841.Keys%20and%20Rooms/README.md)  |  `深度优先搜索`,`图`  |  中等  |    |
|  [0842](https://leetcode-cn.com/problems/split-array-into-fibonacci-sequence)  |  [将数组拆分成斐波那契序列](/solution/0800-0899/0842.Split%20Array%20into%20Fibonacci%20Sequence/README.md)  |  `贪心算法`,`字符串`,`回溯算法`  |  中等  |    |
|  [0843](https://leetcode-cn.com/problems/guess-the-word)  |  [猜猜这个单词](/solution/0800-0899/0843.Guess%20the%20Word/README.md)  |  `极小化极大`  |  困难  |    |
|  [0844](https://leetcode-cn.com/problems/backspace-string-compare)  |  [比较含退格的字符串](/solution/0800-0899/0844.Backspace%20String%20Compare/README.md)  |  `栈`,`双指针`  |  简单  |    |
|  [0845](https://leetcode-cn.com/problems/longest-mountain-in-array)  |  [数组中的最长山脉](/solution/0800-0899/0845.Longest%20Mountain%20in%20Array/README.md)  |  `双指针`  |  中等  |    |
|  [0846](https://leetcode-cn.com/problems/hand-of-straights)  |  [一手顺子](/solution/0800-0899/0846.Hand%20of%20Straights/README.md)  |    |  中等  |    |
|  [0847](https://leetcode-cn.com/problems/shortest-path-visiting-all-nodes)  |  [访问所有节点的最短路径](/solution/0800-0899/0847.Shortest%20Path%20Visiting%20All%20Nodes/README.md)  |  `广度优先搜索`,`动态规划`  |  困难  |    |
|  [0848](https://leetcode-cn.com/problems/shifting-letters)  |  [字母移位](/solution/0800-0899/0848.Shifting%20Letters/README.md)  |  `字符串`  |  中等  |    |
|  [0849](https://leetcode-cn.com/problems/maximize-distance-to-closest-person)  |  [到最近的人的最大距离](/solution/0800-0899/0849.Maximize%20Distance%20to%20Closest%20Person/README.md)  |  `数组`  |  中等  |    |
|  [0850](https://leetcode-cn.com/problems/rectangle-area-ii)  |  [矩形面积 II](/solution/0800-0899/0850.Rectangle%20Area%20II/README.md)  |  `线段树`  |  困难  |    |
|  [0851](https://leetcode-cn.com/problems/loud-and-rich)  |  [喧闹和富有](/solution/0800-0899/0851.Loud%20and%20Rich/README.md)  |  `深度优先搜索`  |  中等  |    |
|  [0852](https://leetcode-cn.com/problems/peak-index-in-a-mountain-array)  |  [山脉数组的峰顶索引](/solution/0800-0899/0852.Peak%20Index%20in%20a%20Mountain%20Array/README.md)  |  `二分查找`  |  简单  |    |
|  [0853](https://leetcode-cn.com/problems/car-fleet)  |  [车队](/solution/0800-0899/0853.Car%20Fleet/README.md)  |  `排序`  |  中等  |    |
|  [0854](https://leetcode-cn.com/problems/k-similar-strings)  |  [相似度为 K 的字符串](/solution/0800-0899/0854.K-Similar%20Strings/README.md)  |  `广度优先搜索`,`图`  |  困难  |    |
|  [0855](https://leetcode-cn.com/problems/exam-room)  |  [考场就座](/solution/0800-0899/0855.Exam%20Room/README.md)  |    |  中等  |    |
|  [0856](https://leetcode-cn.com/problems/score-of-parentheses)  |  [括号的分数](/solution/0800-0899/0856.Score%20of%20Parentheses/README.md)  |  `栈`,`字符串`  |  中等  |    |
|  [0857](https://leetcode-cn.com/problems/minimum-cost-to-hire-k-workers)  |  [雇佣 K 名工人的最低成本](/solution/0800-0899/0857.Minimum%20Cost%20to%20Hire%20K%20Workers/README.md)  |  `堆`  |  困难  |    |
|  [0858](https://leetcode-cn.com/problems/mirror-reflection)  |  [镜面反射](/solution/0800-0899/0858.Mirror%20Reflection/README.md)  |  `数学`  |  中等  |    |
|  [0859](https://leetcode-cn.com/problems/buddy-strings)  |  [亲密字符串](/solution/0800-0899/0859.Buddy%20Strings/README.md)  |  `字符串`  |  简单  |    |
|  [0860](https://leetcode-cn.com/problems/lemonade-change)  |  [柠檬水找零](/solution/0800-0899/0860.Lemonade%20Change/README.md)  |  `贪心算法`  |  简单  |    |
|  [0861](https://leetcode-cn.com/problems/score-after-flipping-matrix)  |  [翻转矩阵后的得分](/solution/0800-0899/0861.Score%20After%20Flipping%20Matrix/README.md)  |  `贪心算法`  |  中等  |    |
|  [0862](https://leetcode-cn.com/problems/shortest-subarray-with-sum-at-least-k)  |  [和至少为 K 的最短子数组](/solution/0800-0899/0862.Shortest%20Subarray%20with%20Sum%20at%20Least%20K/README.md)  |  `队列`,`二分查找`  |  困难  |    |
|  [0863](https://leetcode-cn.com/problems/all-nodes-distance-k-in-binary-tree)  |  [二叉树中所有距离为 K 的结点](/solution/0800-0899/0863.All%20Nodes%20Distance%20K%20in%20Binary%20Tree/README.md)  |  `树`,`深度优先搜索`,`广度优先搜索`  |  中等  |    |
|  [0864](https://leetcode-cn.com/problems/shortest-path-to-get-all-keys)  |  [获取所有钥匙的最短路径](/solution/0800-0899/0864.Shortest%20Path%20to%20Get%20All%20Keys/README.md)  |  `堆`,`广度优先搜索`  |  困难  |    |
|  [0865](https://leetcode-cn.com/problems/smallest-subtree-with-all-the-deepest-nodes)  |  [具有所有最深节点的最小子树](/solution/0800-0899/0865.Smallest%20Subtree%20with%20all%20the%20Deepest%20Nodes/README.md)  |  `树`,`深度优先搜索`,`广度优先搜索`,`递归`  |  中等  |    |
|  [0866](https://leetcode-cn.com/problems/prime-palindrome)  |  [回文素数](/solution/0800-0899/0866.Prime%20Palindrome/README.md)  |  `数学`  |  中等  |    |
|  [0867](https://leetcode-cn.com/problems/transpose-matrix)  |  [转置矩阵](/solution/0800-0899/0867.Transpose%20Matrix/README.md)  |  `数组`  |  简单  |    |
|  [0868](https://leetcode-cn.com/problems/binary-gap)  |  [二进制间距](/solution/0800-0899/0868.Binary%20Gap/README.md)  |  `数学`  |  简单  |    |
|  [0869](https://leetcode-cn.com/problems/reordered-power-of-2)  |  [重新排序得到 2 的幂](/solution/0800-0899/0869.Reordered%20Power%20of%202/README.md)  |  `数学`  |  中等  |    |
|  [0870](https://leetcode-cn.com/problems/advantage-shuffle)  |  [优势洗牌](/solution/0800-0899/0870.Advantage%20Shuffle/README.md)  |  `贪心算法`,`数组`  |  中等  |    |
|  [0871](https://leetcode-cn.com/problems/minimum-number-of-refueling-stops)  |  [最低加油次数](/solution/0800-0899/0871.Minimum%20Number%20of%20Refueling%20Stops/README.md)  |  `堆`,`动态规划`  |  困难  |    |
|  [0872](https://leetcode-cn.com/problems/leaf-similar-trees)  |  [叶子相似的树](/solution/0800-0899/0872.Leaf-Similar%20Trees/README.md)  |  `树`,`深度优先搜索`  |  简单  |    |
|  [0873](https://leetcode-cn.com/problems/length-of-longest-fibonacci-subsequence)  |  [最长的斐波那契子序列的长度](/solution/0800-0899/0873.Length%20of%20Longest%20Fibonacci%20Subsequence/README.md)  |  `数组`,`动态规划`  |  中等  |    |
|  [0874](https://leetcode-cn.com/problems/walking-robot-simulation)  |  [模拟行走机器人](/solution/0800-0899/0874.Walking%20Robot%20Simulation/README.md)  |  `贪心算法`  |  简单  |    |
|  [0875](https://leetcode-cn.com/problems/koko-eating-bananas)  |  [爱吃香蕉的珂珂](/solution/0800-0899/0875.Koko%20Eating%20Bananas/README.md)  |  `二分查找`  |  中等  |    |
|  [0876](https://leetcode-cn.com/problems/middle-of-the-linked-list)  |  [链表的中间结点](/solution/0800-0899/0876.Middle%20of%20the%20Linked%20List/README.md)  |  `链表`  |  简单  |    |
|  [0877](https://leetcode-cn.com/problems/stone-game)  |  [石子游戏](/solution/0800-0899/0877.Stone%20Game/README.md)  |  `极小化极大`,`数学`,`动态规划`  |  中等  |    |
|  [0878](https://leetcode-cn.com/problems/nth-magical-number)  |  [第 N 个神奇数字](/solution/0800-0899/0878.Nth%20Magical%20Number/README.md)  |  `数学`,`二分查找`  |  困难  |    |
|  [0879](https://leetcode-cn.com/problems/profitable-schemes)  |  [盈利计划](/solution/0800-0899/0879.Profitable%20Schemes/README.md)  |  `动态规划`  |  困难  |    |
|  [0880](https://leetcode-cn.com/problems/decoded-string-at-index)  |  [索引处的解码字符串](/solution/0800-0899/0880.Decoded%20String%20at%20Index/README.md)  |  `栈`  |  中等  |    |
|  [0881](https://leetcode-cn.com/problems/boats-to-save-people)  |  [救生艇](/solution/0800-0899/0881.Boats%20to%20Save%20People/README.md)  |  `贪心算法`,`双指针`  |  中等  |    |
|  [0882](https://leetcode-cn.com/problems/reachable-nodes-in-subdivided-graph)  |  [细分图中的可到达结点](/solution/0800-0899/0882.Reachable%20Nodes%20In%20Subdivided%20Graph/README.md)  |  `堆`,`广度优先搜索`  |  困难  |    |
|  [0883](https://leetcode-cn.com/problems/projection-area-of-3d-shapes)  |  [三维形体投影面积](/solution/0800-0899/0883.Projection%20Area%20of%203D%20Shapes/README.md)  |  `数学`  |  简单  |    |
|  [0884](https://leetcode-cn.com/problems/uncommon-words-from-two-sentences)  |  [两句话中的不常见单词](/solution/0800-0899/0884.Uncommon%20Words%20from%20Two%20Sentences/README.md)  |  `哈希表`  |  简单  |    |
|  [0885](https://leetcode-cn.com/problems/spiral-matrix-iii)  |  [螺旋矩阵 III](/solution/0800-0899/0885.Spiral%20Matrix%20III/README.md)  |  `数学`  |  中等  |    |
|  [0886](https://leetcode-cn.com/problems/possible-bipartition)  |  [可能的二分法](/solution/0800-0899/0886.Possible%20Bipartition/README.md)  |  `深度优先搜索`,`图`  |  中等  |    |
|  [0887](https://leetcode-cn.com/problems/super-egg-drop)  |  [鸡蛋掉落](/solution/0800-0899/0887.Super%20Egg%20Drop/README.md)  |  `数学`,`二分查找`,`动态规划`  |  困难  |    |
|  [0888](https://leetcode-cn.com/problems/fair-candy-swap)  |  [公平的糖果棒交换](/solution/0800-0899/0888.Fair%20Candy%20Swap/README.md)  |  `数组`  |  简单  |    |
|  [0889](https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal)  |  [根据前序和后序遍历构造二叉树](/solution/0800-0899/0889.Construct%20Binary%20Tree%20from%20Preorder%20and%20Postorder%20Traversal/README.md)  |  `树`  |  中等  |    |
|  [0890](https://leetcode-cn.com/problems/find-and-replace-pattern)  |  [查找和替换模式](/solution/0800-0899/0890.Find%20and%20Replace%20Pattern/README.md)  |  `字符串`  |  中等  |    |
|  [0891](https://leetcode-cn.com/problems/sum-of-subsequence-widths)  |  [子序列宽度之和](/solution/0800-0899/0891.Sum%20of%20Subsequence%20Widths/README.md)  |  `数组`,`数学`  |  困难  |    |
|  [0892](https://leetcode-cn.com/problems/surface-area-of-3d-shapes)  |  [三维形体的表面积](/solution/0800-0899/0892.Surface%20Area%20of%203D%20Shapes/README.md)  |  `几何`,`数学`  |  简单  |    |
|  [0893](https://leetcode-cn.com/problems/groups-of-special-equivalent-strings)  |  [特殊等价字符串组](/solution/0800-0899/0893.Groups%20of%20Special-Equivalent%20Strings/README.md)  |  `字符串`  |  简单  |    |
|  [0894](https://leetcode-cn.com/problems/all-possible-full-binary-trees)  |  [所有可能的满二叉树](/solution/0800-0899/0894.All%20Possible%20Full%20Binary%20Trees/README.md)  |  `树`,`递归`  |  中等  |    |
|  [0895](https://leetcode-cn.com/problems/maximum-frequency-stack)  |  [最大频率栈](/solution/0800-0899/0895.Maximum%20Frequency%20Stack/README.md)  |  `栈`,`哈希表`  |  困难  |    |
|  [0896](https://leetcode-cn.com/problems/monotonic-array)  |  [单调数列](/solution/0800-0899/0896.Monotonic%20Array/README.md)  |  `数组`  |  简单  |    |
|  [0897](https://leetcode-cn.com/problems/increasing-order-search-tree)  |  [递增顺序搜索树](/solution/0800-0899/0897.Increasing%20Order%20Search%20Tree/README.md)  |  `树`,`深度优先搜索`,`递归`  |  简单  |    |
|  [0898](https://leetcode-cn.com/problems/bitwise-ors-of-subarrays)  |  [子数组按位或操作](/solution/0800-0899/0898.Bitwise%20ORs%20of%20Subarrays/README.md)  |  `位运算`,`动态规划`  |  中等  |    |
|  [0899](https://leetcode-cn.com/problems/orderly-queue)  |  [有序队列](/solution/0800-0899/0899.Orderly%20Queue/README.md)  |  `数学`,`字符串`  |  困难  |    |
|  [0900](https://leetcode-cn.com/problems/rle-iterator)  |  [RLE 迭代器](/solution/0900-0999/0900.RLE%20Iterator/README.md)  |  `数组`  |  中等  |    |
|  [0901](https://leetcode-cn.com/problems/online-stock-span)  |  [股票价格跨度](/solution/0900-0999/0901.Online%20Stock%20Span/README.md)  |  `栈`  |  中等  |    |
|  [0902](https://leetcode-cn.com/problems/numbers-at-most-n-given-digit-set)  |  [最大为 N 的数字组合](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md)  |  `数学`,`动态规划`  |  困难  |    |
|  [0903](https://leetcode-cn.com/problems/valid-permutations-for-di-sequence)  |  [DI 序列的有效排列](/solution/0900-0999/0903.Valid%20Permutations%20for%20DI%20Sequence/README.md)  |  `分治算法`,`动态规划`  |  困难  |    |
|  [0904](https://leetcode-cn.com/problems/fruit-into-baskets)  |  [水果成篮](/solution/0900-0999/0904.Fruit%20Into%20Baskets/README.md)  |  `双指针`  |  中等  |    |
|  [0905](https://leetcode-cn.com/problems/sort-array-by-parity)  |  [按奇偶排序数组](/solution/0900-0999/0905.Sort%20Array%20By%20Parity/README.md)  |  `数组`  |  简单  |    |
|  [0906](https://leetcode-cn.com/problems/super-palindromes)  |  [超级回文数](/solution/0900-0999/0906.Super%20Palindromes/README.md)  |  `数学`  |  困难  |    |
|  [0907](https://leetcode-cn.com/problems/sum-of-subarray-minimums)  |  [子数组的最小值之和](/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README.md)  |  `栈`,`数组`  |  中等  |    |
|  [0908](https://leetcode-cn.com/problems/smallest-range-i)  |  [最小差值 I](/solution/0900-0999/0908.Smallest%20Range%20I/README.md)  |  `数学`  |  简单  |    |
|  [0909](https://leetcode-cn.com/problems/snakes-and-ladders)  |  [蛇梯棋](/solution/0900-0999/0909.Snakes%20and%20Ladders/README.md)  |  `广度优先搜索`  |  中等  |    |
|  [0910](https://leetcode-cn.com/problems/smallest-range-ii)  |  [最小差值 II](/solution/0900-0999/0910.Smallest%20Range%20II/README.md)  |  `贪心算法`,`数学`  |  中等  |    |
|  [0911](https://leetcode-cn.com/problems/online-election)  |  [在线选举](/solution/0900-0999/0911.Online%20Election/README.md)  |  `二分查找`  |  中等  |    |
|  [0912](https://leetcode-cn.com/problems/sort-an-array)  |  [排序数组](/solution/0900-0999/0912.Sort%20an%20Array/README.md)  |    |  中等  |    |
|  [0913](https://leetcode-cn.com/problems/cat-and-mouse)  |  [猫和老鼠](/solution/0900-0999/0913.Cat%20and%20Mouse/README.md)  |  `广度优先搜索`,`极小化极大`  |  困难  |    |
|  [0914](https://leetcode-cn.com/problems/x-of-a-kind-in-a-deck-of-cards)  |  [卡牌分组](/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README.md)  |  `数组`,`数学`  |  简单  |    |
|  [0915](https://leetcode-cn.com/problems/partition-array-into-disjoint-intervals)  |  [分割数组](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README.md)  |  `数组`  |  中等  |    |
|  [0916](https://leetcode-cn.com/problems/word-subsets)  |  [单词子集](/solution/0900-0999/0916.Word%20Subsets/README.md)  |  `字符串`  |  中等  |    |
|  [0917](https://leetcode-cn.com/problems/reverse-only-letters)  |  [仅仅反转字母](/solution/0900-0999/0917.Reverse%20Only%20Letters/README.md)  |  `字符串`  |  简单  |    |
|  [0918](https://leetcode-cn.com/problems/maximum-sum-circular-subarray)  |  [环形子数组的最大和](/solution/0900-0999/0918.Maximum%20Sum%20Circular%20Subarray/README.md)  |  `数组`  |  中等  |    |
|  [0919](https://leetcode-cn.com/problems/complete-binary-tree-inserter)  |  [完全二叉树插入器](/solution/0900-0999/0919.Complete%20Binary%20Tree%20Inserter/README.md)  |  `树`  |  中等  |    |
|  [0920](https://leetcode-cn.com/problems/number-of-music-playlists)  |  [播放列表的数量](/solution/0900-0999/0920.Number%20of%20Music%20Playlists/README.md)  |  `动态规划`  |  困难  |    |
|  [0921](https://leetcode-cn.com/problems/minimum-add-to-make-parentheses-valid)  |  [使括号有效的最少添加](/solution/0900-0999/0921.Minimum%20Add%20to%20Make%20Parentheses%20Valid/README.md)  |  `栈`,`贪心算法`  |  中等  |    |
|  [0922](https://leetcode-cn.com/problems/sort-array-by-parity-ii)  |  [按奇偶排序数组 II](/solution/0900-0999/0922.Sort%20Array%20By%20Parity%20II/README.md)  |  `排序`,`数组`  |  简单  |    |
|  [0923](https://leetcode-cn.com/problems/3sum-with-multiplicity)  |  [三数之和的多种可能](/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README.md)  |  `双指针`  |  中等  |    |
|  [0924](https://leetcode-cn.com/problems/minimize-malware-spread)  |  [尽量减少恶意软件的传播](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README.md)  |  `深度优先搜索`,`并查集`  |  困难  |    |
|  [0925](https://leetcode-cn.com/problems/long-pressed-name)  |  [长按键入](/solution/0900-0999/0925.Long%20Pressed%20Name/README.md)  |  `双指针`,`字符串`  |  简单  |    |
|  [0926](https://leetcode-cn.com/problems/flip-string-to-monotone-increasing)  |  [将字符串翻转到单调递增](/solution/0900-0999/0926.Flip%20String%20to%20Monotone%20Increasing/README.md)  |  `数组`  |  中等  |    |
|  [0927](https://leetcode-cn.com/problems/three-equal-parts)  |  [三等分](/solution/0900-0999/0927.Three%20Equal%20Parts/README.md)  |  `贪心算法`,`数学`,`二分查找`  |  困难  |    |
|  [0928](https://leetcode-cn.com/problems/minimize-malware-spread-ii)  |  [尽量减少恶意软件的传播 II](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README.md)  |  `深度优先搜索`,`并查集`,`图`  |  困难  |    |
|  [0929](https://leetcode-cn.com/problems/unique-email-addresses)  |  [独特的电子邮件地址](/solution/0900-0999/0929.Unique%20Email%20Addresses/README.md)  |  `字符串`  |  简单  |    |
|  [0930](https://leetcode-cn.com/problems/binary-subarrays-with-sum)  |  [和相同的二元子数组](/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README.md)  |  `哈希表`,`双指针`  |  中等  |    |
|  [0931](https://leetcode-cn.com/problems/minimum-falling-path-sum)  |  [下降路径最小和](/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README.md)  |  `动态规划`  |  中等  |    |
|  [0932](https://leetcode-cn.com/problems/beautiful-array)  |  [漂亮数组](/solution/0900-0999/0932.Beautiful%20Array/README.md)  |  `分治算法`  |  中等  |    |
|  [0933](https://leetcode-cn.com/problems/number-of-recent-calls)  |  [最近的请求次数](/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README.md)  |  `队列`  |  简单  |    |
|  [0934](https://leetcode-cn.com/problems/shortest-bridge)  |  [最短的桥](/solution/0900-0999/0934.Shortest%20Bridge/README.md)  |  `深度优先搜索`,`广度优先搜索`  |  中等  |    |
|  [0935](https://leetcode-cn.com/problems/knight-dialer)  |  [骑士拨号器](/solution/0900-0999/0935.Knight%20Dialer/README.md)  |  `动态规划`  |  中等  |    |
|  [0936](https://leetcode-cn.com/problems/stamping-the-sequence)  |  [戳印序列](/solution/0900-0999/0936.Stamping%20The%20Sequence/README.md)  |  `贪心算法`,`字符串`  |  困难  |    |
|  [0937](https://leetcode-cn.com/problems/reorder-data-in-log-files)  |  [重新排列日志文件](/solution/0900-0999/0937.Reorder%20Data%20in%20Log%20Files/README.md)  |  `字符串`  |  简单  |    |
|  [0938](https://leetcode-cn.com/problems/range-sum-of-bst)  |  [二叉搜索树的范围和](/solution/0900-0999/0938.Range%20Sum%20of%20BST/README.md)  |  `树`,`深度优先搜索`,`递归`  |  简单  |    |
|  [0939](https://leetcode-cn.com/problems/minimum-area-rectangle)  |  [最小面积矩形](/solution/0900-0999/0939.Minimum%20Area%20Rectangle/README.md)  |  `哈希表`  |  中等  |    |
|  [0940](https://leetcode-cn.com/problems/distinct-subsequences-ii)  |  [不同的子序列 II](/solution/0900-0999/0940.Distinct%20Subsequences%20II/README.md)  |  `动态规划`  |  困难  |    |
|  [0941](https://leetcode-cn.com/problems/valid-mountain-array)  |  [有效的山脉数组](/solution/0900-0999/0941.Valid%20Mountain%20Array/README.md)  |  `数组`  |  简单  |    |
|  [0942](https://leetcode-cn.com/problems/di-string-match)  |  [增减字符串匹配](/solution/0900-0999/0942.DI%20String%20Match/README.md)  |  `数学`  |  简单  |    |
|  [0943](https://leetcode-cn.com/problems/find-the-shortest-superstring)  |  [最短超级串](/solution/0900-0999/0943.Find%20the%20Shortest%20Superstring/README.md)  |  `动态规划`  |  困难  |    |
|  [0944](https://leetcode-cn.com/problems/delete-columns-to-make-sorted)  |  [删列造序](/solution/0900-0999/0944.Delete%20Columns%20to%20Make%20Sorted/README.md)  |  `贪心算法`  |  简单  |    |
|  [0945](https://leetcode-cn.com/problems/minimum-increment-to-make-array-unique)  |  [使数组唯一的最小增量](/solution/0900-0999/0945.Minimum%20Increment%20to%20Make%20Array%20Unique/README.md)  |  `数组`  |  中等  |    |
|  [0946](https://leetcode-cn.com/problems/validate-stack-sequences)  |  [验证栈序列](/solution/0900-0999/0946.Validate%20Stack%20Sequences/README.md)  |  `栈`  |  中等  |    |
|  [0947](https://leetcode-cn.com/problems/most-stones-removed-with-same-row-or-column)  |  [移除最多的同行或同列石头](/solution/0900-0999/0947.Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/README.md)  |  `深度优先搜索`,`并查集`  |  中等  |    |
|  [0948](https://leetcode-cn.com/problems/bag-of-tokens)  |  [令牌放置](/solution/0900-0999/0948.Bag%20of%20Tokens/README.md)  |  `贪心算法`,`排序`,`双指针`  |  中等  |    |
|  [0949](https://leetcode-cn.com/problems/largest-time-for-given-digits)  |  [给定数字能组成的最大时间](/solution/0900-0999/0949.Largest%20Time%20for%20Given%20Digits/README.md)  |  `数学`  |  中等  |    |
|  [0950](https://leetcode-cn.com/problems/reveal-cards-in-increasing-order)  |  [按递增顺序显示卡牌](/solution/0900-0999/0950.Reveal%20Cards%20In%20Increasing%20Order/README.md)  |  `数组`  |  中等  |    |
|  [0951](https://leetcode-cn.com/problems/flip-equivalent-binary-trees)  |  [翻转等价二叉树](/solution/0900-0999/0951.Flip%20Equivalent%20Binary%20Trees/README.md)  |  `树`  |  中等  |    |
|  [0952](https://leetcode-cn.com/problems/largest-component-size-by-common-factor)  |  [按公因数计算最大组件大小](/solution/0900-0999/0952.Largest%20Component%20Size%20by%20Common%20Factor/README.md)  |  `并查集`,`数学`  |  困难  |    |
|  [0953](https://leetcode-cn.com/problems/verifying-an-alien-dictionary)  |  [验证外星语词典](/solution/0900-0999/0953.Verifying%20an%20Alien%20Dictionary/README.md)  |  `哈希表`  |  简单  |    |
|  [0954](https://leetcode-cn.com/problems/array-of-doubled-pairs)  |  [二倍数对数组](/solution/0900-0999/0954.Array%20of%20Doubled%20Pairs/README.md)  |  `数组`,`哈希表`  |  中等  |    |
|  [0955](https://leetcode-cn.com/problems/delete-columns-to-make-sorted-ii)  |  [删列造序 II](/solution/0900-0999/0955.Delete%20Columns%20to%20Make%20Sorted%20II/README.md)  |  `贪心算法`  |  中等  |    |
|  [0956](https://leetcode-cn.com/problems/tallest-billboard)  |  [最高的广告牌](/solution/0900-0999/0956.Tallest%20Billboard/README.md)  |  `动态规划`  |  困难  |    |
|  [0957](https://leetcode-cn.com/problems/prison-cells-after-n-days)  |  [N 天后的牢房](/solution/0900-0999/0957.Prison%20Cells%20After%20N%20Days/README.md)  |  `哈希表`  |  中等  |    |
|  [0958](https://leetcode-cn.com/problems/check-completeness-of-a-binary-tree)  |  [二叉树的完全性检验](/solution/0900-0999/0958.Check%20Completeness%20of%20a%20Binary%20Tree/README.md)  |  `树`  |  中等  |    |
|  [0959](https://leetcode-cn.com/problems/regions-cut-by-slashes)  |  [由斜杠划分区域](/solution/0900-0999/0959.Regions%20Cut%20By%20Slashes/README.md)  |  `深度优先搜索`,`并查集`,`图`  |  中等  |    |
|  [0960](https://leetcode-cn.com/problems/delete-columns-to-make-sorted-iii)  |  [删列造序 III](/solution/0900-0999/0960.Delete%20Columns%20to%20Make%20Sorted%20III/README.md)  |  `动态规划`  |  困难  |    |
|  [0961](https://leetcode-cn.com/problems/n-repeated-element-in-size-2n-array)  |  [重复 N 次的元素](/solution/0900-0999/0961.N-Repeated%20Element%20in%20Size%202N%20Array/README.md)  |  `哈希表`  |  简单  |    |
|  [0962](https://leetcode-cn.com/problems/maximum-width-ramp)  |  [最大宽度坡](/solution/0900-0999/0962.Maximum%20Width%20Ramp/README.md)  |  `数组`  |  中等  |    |
|  [0963](https://leetcode-cn.com/problems/minimum-area-rectangle-ii)  |  [最小面积矩形 II](/solution/0900-0999/0963.Minimum%20Area%20Rectangle%20II/README.md)  |  `几何`,`数学`  |  中等  |    |
|  [0964](https://leetcode-cn.com/problems/least-operators-to-express-number)  |  [表示数字的最少运算符](/solution/0900-0999/0964.Least%20Operators%20to%20Express%20Number/README.md)  |  `数学`,`动态规划`  |  困难  |    |
|  [0965](https://leetcode-cn.com/problems/univalued-binary-tree)  |  [单值二叉树](/solution/0900-0999/0965.Univalued%20Binary%20Tree/README.md)  |  `树`  |  简单  |    |
|  [0966](https://leetcode-cn.com/problems/vowel-spellchecker)  |  [元音拼写检查器](/solution/0900-0999/0966.Vowel%20Spellchecker/README.md)  |  `哈希表`,`字符串`  |  中等  |    |
|  [0967](https://leetcode-cn.com/problems/numbers-with-same-consecutive-differences)  |  [连续差相同的数字](/solution/0900-0999/0967.Numbers%20With%20Same%20Consecutive%20Differences/README.md)  |  `深度优先搜索`,`广度优先搜索`,`递归`,`回溯算法`  |  中等  |    |
|  [0968](https://leetcode-cn.com/problems/binary-tree-cameras)  |  [监控二叉树](/solution/0900-0999/0968.Binary%20Tree%20Cameras/README.md)  |  `树`,`深度优先搜索`,`动态规划`  |  困难  |    |
|  [0969](https://leetcode-cn.com/problems/pancake-sorting)  |  [煎饼排序](/solution/0900-0999/0969.Pancake%20Sorting/README.md)  |  `排序`,`数组`  |  中等  |    |
|  [0970](https://leetcode-cn.com/problems/powerful-integers)  |  [强整数](/solution/0900-0999/0970.Powerful%20Integers/README.md)  |  `哈希表`,`数学`  |  中等  |    |
|  [0971](https://leetcode-cn.com/problems/flip-binary-tree-to-match-preorder-traversal)  |  [翻转二叉树以匹配先序遍历](/solution/0900-0999/0971.Flip%20Binary%20Tree%20To%20Match%20Preorder%20Traversal/README.md)  |  `树`,`深度优先搜索`  |  中等  |    |
|  [0972](https://leetcode-cn.com/problems/equal-rational-numbers)  |  [相等的有理数](/solution/0900-0999/0972.Equal%20Rational%20Numbers/README.md)  |  `数学`  |  困难  |    |
|  [0973](https://leetcode-cn.com/problems/k-closest-points-to-origin)  |  [最接近原点的 K 个点](/solution/0900-0999/0973.K%20Closest%20Points%20to%20Origin/README.md)  |  `堆`,`排序`,`分治算法`  |  中等  |    |
|  [0974](https://leetcode-cn.com/problems/subarray-sums-divisible-by-k)  |  [和可被 K 整除的子数组](/solution/0900-0999/0974.Subarray%20Sums%20Divisible%20by%20K/README.md)  |  `数组`,`哈希表`  |  中等  |    |
|  [0975](https://leetcode-cn.com/problems/odd-even-jump)  |  [奇偶跳](/solution/0900-0999/0975.Odd%20Even%20Jump/README.md)  |  `栈`,`动态规划`  |  困难  |    |
|  [0976](https://leetcode-cn.com/problems/largest-perimeter-triangle)  |  [三角形的最大周长](/solution/0900-0999/0976.Largest%20Perimeter%20Triangle/README.md)  |  `排序`,`数学`  |  简单  |    |
|  [0977](https://leetcode-cn.com/problems/squares-of-a-sorted-array)  |  [有序数组的平方](/solution/0900-0999/0977.Squares%20of%20a%20Sorted%20Array/README.md)  |  `数组`,`双指针`  |  简单  |    |
|  [0978](https://leetcode-cn.com/problems/longest-turbulent-subarray)  |  [最长湍流子数组](/solution/0900-0999/0978.Longest%20Turbulent%20Subarray/README.md)  |  `数组`,`动态规划`  |  中等  |    |
|  [0979](https://leetcode-cn.com/problems/distribute-coins-in-binary-tree)  |  [在二叉树中分配硬币](/solution/0900-0999/0979.Distribute%20Coins%20in%20Binary%20Tree/README.md)  |  `树`,`深度优先搜索`  |  中等  |    |
|  [0980](https://leetcode-cn.com/problems/unique-paths-iii)  |  [不同路径 III](/solution/0900-0999/0980.Unique%20Paths%20III/README.md)  |  `深度优先搜索`,`回溯算法`  |  困难  |    |
|  [0981](https://leetcode-cn.com/problems/time-based-key-value-store)  |  [基于时间的键值存储](/solution/0900-0999/0981.Time%20Based%20Key-Value%20Store/README.md)  |  `哈希表`,`二分查找`  |  中等  |    |
|  [0982](https://leetcode-cn.com/problems/triples-with-bitwise-and-equal-to-zero)  |  [按位与为零的三元组](/solution/0900-0999/0982.Triples%20with%20Bitwise%20AND%20Equal%20To%20Zero/README.md)  |  `动态规划`  |  困难  |    |
|  [0983](https://leetcode-cn.com/problems/minimum-cost-for-tickets)  |  [最低票价](/solution/0900-0999/0983.Minimum%20Cost%20For%20Tickets/README.md)  |  `动态规划`  |  中等  |    |
|  [0984](https://leetcode-cn.com/problems/string-without-aaa-or-bbb)  |  [不含 AAA 或 BBB 的字符串](/solution/0900-0999/0984.String%20Without%20AAA%20or%20BBB/README.md)  |  `贪心算法`  |  中等  |    |
|  [0985](https://leetcode-cn.com/problems/sum-of-even-numbers-after-queries)  |  [查询后的偶数和](/solution/0900-0999/0985.Sum%20of%20Even%20Numbers%20After%20Queries/README.md)  |  `数组`  |  简单  |    |
|  [0986](https://leetcode-cn.com/problems/interval-list-intersections)  |  [区间列表的交集](/solution/0900-0999/0986.Interval%20List%20Intersections/README.md)  |  `双指针`  |  中等  |    |
|  [0987](https://leetcode-cn.com/problems/vertical-order-traversal-of-a-binary-tree)  |  [二叉树的垂序遍历](/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README.md)  |  `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`  |  困难  |    |
|  [0988](https://leetcode-cn.com/problems/smallest-string-starting-from-leaf)  |  [从叶结点开始的最小字符串](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README.md)  |  `树`,`深度优先搜索`  |  中等  |    |
|  [0989](https://leetcode-cn.com/problems/add-to-array-form-of-integer)  |  [数组形式的整数加法](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README.md)  |  `数组`  |  简单  |    |
|  [0990](https://leetcode-cn.com/problems/satisfiability-of-equality-equations)  |  [等式方程的可满足性](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README.md)  |  `并查集`,`图`  |  中等  |    |
|  [0991](https://leetcode-cn.com/problems/broken-calculator)  |  [坏了的计算器](/solution/0900-0999/0991.Broken%20Calculator/README.md)  |  `贪心算法`,`数学`  |  中等  |    |
|  [0992](https://leetcode-cn.com/problems/subarrays-with-k-different-integers)  |  [K 个不同整数的子数组](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README.md)  |  `哈希表`,`双指针`  |  困难  |    |
|  [0993](https://leetcode-cn.com/problems/cousins-in-binary-tree)  |  [二叉树的堂兄弟节点](/solution/0900-0999/0993.Cousins%20in%20Binary%20Tree/README.md)  |  `树`,`广度优先搜索`  |  简单  |    |
|  [0994](https://leetcode-cn.com/problems/rotting-oranges)  |  [腐烂的橘子](/solution/0900-0999/0994.Rotting%20Oranges/README.md)  |  `广度优先搜索`  |  中等  |    |
|  [0995](https://leetcode-cn.com/problems/minimum-number-of-k-consecutive-bit-flips)  |  [K 连续位的最小翻转次数](/solution/0900-0999/0995.Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips/README.md)  |  `贪心算法`  |  困难  |    |
|  [0996](https://leetcode-cn.com/problems/number-of-squareful-arrays)  |  [正方形数组的数目](/solution/0900-0999/0996.Number%20of%20Squareful%20Arrays/README.md)  |  `图`,`数学`,`回溯算法`  |  困难  |    |
|  [0997](https://leetcode-cn.com/problems/find-the-town-judge)  |  [找到小镇的法官](/solution/0900-0999/0997.Find%20the%20Town%20Judge/README.md)  |  `图`  |  简单  |    |
|  [0998](https://leetcode-cn.com/problems/maximum-binary-tree-ii)  |  [最大二叉树 II](/solution/0900-0999/0998.Maximum%20Binary%20Tree%20II/README.md)  |  `树`  |  中等  |    |
|  [0999](https://leetcode-cn.com/problems/available-captures-for-rook)  |  [可以被一步捕获的棋子数](/solution/0900-0999/0999.Available%20Captures%20for%20Rook/README.md)  |  `数组`  |  简单  |    |
|  [1000](https://leetcode-cn.com/problems/minimum-cost-to-merge-stones)  |  [合并石头的最低成本](/solution/1000-1099/1000.Minimum%20Cost%20to%20Merge%20Stones/README.md)  |  `动态规划`  |  困难  |    |
|  [1001](https://leetcode-cn.com/problems/grid-illumination)  |  [网格照明](/solution/1000-1099/1001.Grid%20Illumination/README.md)  |  `哈希表`  |  困难  |    |
|  [1002](https://leetcode-cn.com/problems/find-common-characters)  |  [查找常用字符](/solution/1000-1099/1002.Find%20Common%20Characters/README.md)  |  `数组`,`哈希表`  |  简单  |    |
|  [1003](https://leetcode-cn.com/problems/check-if-word-is-valid-after-substitutions)  |  [检查替换后的词是否有效](/solution/1000-1099/1003.Check%20If%20Word%20Is%20Valid%20After%20Substitutions/README.md)  |  `栈`,`字符串`  |  中等  |    |
|  [1004](https://leetcode-cn.com/problems/max-consecutive-ones-iii)  |  [最大连续1的个数 III](/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README.md)  |  `双指针`  |  中等  |    |
|  [1005](https://leetcode-cn.com/problems/maximize-sum-of-array-after-k-negations)  |  [K 次取反后最大化的数组和](/solution/1000-1099/1005.Maximize%20Sum%20Of%20Array%20After%20K%20Negations/README.md)  |  `贪心算法`  |  简单  |    |
|  [1006](https://leetcode-cn.com/problems/clumsy-factorial)  |  [笨阶乘](/solution/1000-1099/1006.Clumsy%20Factorial/README.md)  |  `数学`  |  中等  |    |
|  [1007](https://leetcode-cn.com/problems/minimum-domino-rotations-for-equal-row)  |  [行相等的最少多米诺旋转](/solution/1000-1099/1007.Minimum%20Domino%20Rotations%20For%20Equal%20Row/README.md)  |  `贪心算法`,`数组`  |  中等  |    |
|  [1008](https://leetcode-cn.com/problems/construct-binary-search-tree-from-preorder-traversal)  |  [前序遍历构造二叉搜索树](/solution/1000-1099/1008.Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal/README.md)  |  `树`  |  中等  |    |
|  [1009](https://leetcode-cn.com/problems/complement-of-base-10-integer)  |  [十进制整数的反码](/solution/1000-1099/1009.Complement%20of%20Base%2010%20Integer/README.md)  |  `数学`  |  简单  |    |
|  [1010](https://leetcode-cn.com/problems/pairs-of-songs-with-total-durations-divisible-by-60)  |  [总持续时间可被 60 整除的歌曲](/solution/1000-1099/1010.Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060/README.md)  |  `数组`  |  中等  |    |
|  [1011](https://leetcode-cn.com/problems/capacity-to-ship-packages-within-d-days)  |  [在 D 天内送达包裹的能力](/solution/1000-1099/1011.Capacity%20To%20Ship%20Packages%20Within%20D%20Days/README.md)  |  `数组`,`二分查找`  |  中等  |    |
|  [1012](https://leetcode-cn.com/problems/numbers-with-repeated-digits)  |  [至少有 1 位重复的数字](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md)  |  `数学`,`动态规划`  |  困难  |    |
|  [1013](https://leetcode-cn.com/problems/partition-array-into-three-parts-with-equal-sum)  |  [将数组分成和相等的三个部分](/solution/1000-1099/1013.Partition%20Array%20Into%20Three%20Parts%20With%20Equal%20Sum/README.md)  |  `数组`  |  简单  |    |
|  [1014](https://leetcode-cn.com/problems/best-sightseeing-pair)  |  [最佳观光组合](/solution/1000-1099/1014.Best%20Sightseeing%20Pair/README.md)  |  `数组`  |  中等  |    |
|  [1015](https://leetcode-cn.com/problems/smallest-integer-divisible-by-k)  |  [可被 K 整除的最小整数](/solution/1000-1099/1015.Smallest%20Integer%20Divisible%20by%20K/README.md)  |  `数学`  |  中等  |    |
|  [1016](https://leetcode-cn.com/problems/binary-string-with-substrings-representing-1-to-n)  |  [子串能表示从 1 到 N 数字的二进制串](/solution/1000-1099/1016.Binary%20String%20With%20Substrings%20Representing%201%20To%20N/README.md)  |  `字符串`  |  中等  |    |
|  [1017](https://leetcode-cn.com/problems/convert-to-base-2)  |  [负二进制转换](/solution/1000-1099/1017.Convert%20to%20Base%20-2/README.md)  |  `数学`  |  中等  |    |
|  [1018](https://leetcode-cn.com/problems/binary-prefix-divisible-by-5)  |  [可被 5 整除的二进制前缀](/solution/1000-1099/1018.Binary%20Prefix%20Divisible%20By%205/README.md)  |  `数组`  |  简单  |    |
|  [1019](https://leetcode-cn.com/problems/next-greater-node-in-linked-list)  |  [链表中的下一个更大节点](/solution/1000-1099/1019.Next%20Greater%20Node%20In%20Linked%20List/README.md)  |  `栈`,`链表`  |  中等  |    |
|  [1020](https://leetcode-cn.com/problems/number-of-enclaves)  |  [飞地的数量](/solution/1000-1099/1020.Number%20of%20Enclaves/README.md)  |  `深度优先搜索`  |  中等  |    |
|  [1021](https://leetcode-cn.com/problems/remove-outermost-parentheses)  |  [删除最外层的括号](/solution/1000-1099/1021.Remove%20Outermost%20Parentheses/README.md)  |  `栈`  |  简单  |    |
|  [1022](https://leetcode-cn.com/problems/sum-of-root-to-leaf-binary-numbers)  |  [从根到叶的二进制数之和](/solution/1000-1099/1022.Sum%20of%20Root%20To%20Leaf%20Binary%20Numbers/README.md)  |  `树`  |  简单  |    |
|  [1023](https://leetcode-cn.com/problems/camelcase-matching)  |  [驼峰式匹配](/solution/1000-1099/1023.Camelcase%20Matching/README.md)  |  `字典树`,`字符串`  |  中等  |    |
|  [1024](https://leetcode-cn.com/problems/video-stitching)  |  [视频拼接](/solution/1000-1099/1024.Video%20Stitching/README.md)  |  `动态规划`  |  中等  |    |
|  [1025](https://leetcode-cn.com/problems/divisor-game)  |  [除数博弈](/solution/1000-1099/1025.Divisor%20Game/README.md)  |  `数学`,`动态规划`  |  简单  |    |
|  [1026](https://leetcode-cn.com/problems/maximum-difference-between-node-and-ancestor)  |  [节点与其祖先之间的最大差值](/solution/1000-1099/1026.Maximum%20Difference%20Between%20Node%20and%20Ancestor/README.md)  |  `树`,`深度优先搜索`  |  中等  |    |
|  [1027](https://leetcode-cn.com/problems/longest-arithmetic-subsequence)  |  [最长等差数列](/solution/1000-1099/1027.Longest%20Arithmetic%20Subsequence/README.md)  |  `动态规划`  |  中等  |    |
|  [1028](https://leetcode-cn.com/problems/recover-a-tree-from-preorder-traversal)  |  [从先序遍历还原二叉树](/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/README.md)  |  `树`,`深度优先搜索`  |  困难  |    |
|  [1029](https://leetcode-cn.com/problems/two-city-scheduling)  |  [两地调度](/solution/1000-1099/1029.Two%20City%20Scheduling/README.md)  |  `贪心算法`  |  中等  |    |
|  [1030](https://leetcode-cn.com/problems/matrix-cells-in-distance-order)  |  [距离顺序排列矩阵单元格](/solution/1000-1099/1030.Matrix%20Cells%20in%20Distance%20Order/README.md)  |  `排序`  |  简单  |    |
|  [1031](https://leetcode-cn.com/problems/maximum-sum-of-two-non-overlapping-subarrays)  |  [两个非重叠子数组的最大和](/solution/1000-1099/1031.Maximum%20Sum%20of%20Two%20Non-Overlapping%20Subarrays/README.md)  |  `数组`  |  中等  |    |
|  [1032](https://leetcode-cn.com/problems/stream-of-characters)  |  [字符流](/solution/1000-1099/1032.Stream%20of%20Characters/README.md)  |  `字典树`  |  困难  |    |
|  [1033](https://leetcode-cn.com/problems/moving-stones-until-consecutive)  |  [移动石子直到连续](/solution/1000-1099/1033.Moving%20Stones%20Until%20Consecutive/README.md)  |  `脑筋急转弯`  |  简单  |    |
|  [1034](https://leetcode-cn.com/problems/coloring-a-border)  |  [边框着色](/solution/1000-1099/1034.Coloring%20A%20Border/README.md)  |  `深度优先搜索`  |  中等  |    |
|  [1035](https://leetcode-cn.com/problems/uncrossed-lines)  |  [不相交的线](/solution/1000-1099/1035.Uncrossed%20Lines/README.md)  |  `数组`  |  中等  |    |
|  [1036](https://leetcode-cn.com/problems/escape-a-large-maze)  |  [逃离大迷宫](/solution/1000-1099/1036.Escape%20a%20Large%20Maze/README.md)  |  `广度优先搜索`  |  困难  |    |
|  [1037](https://leetcode-cn.com/problems/valid-boomerang)  |  [有效的回旋镖](/solution/1000-1099/1037.Valid%20Boomerang/README.md)  |  `数学`  |  简单  |    |
|  [1038](https://leetcode-cn.com/problems/binary-search-tree-to-greater-sum-tree)  |  [把二叉搜索树转换为累加树](/solution/1000-1099/1038.Binary%20Search%20Tree%20to%20Greater%20Sum%20Tree/README.md)  |  `树`,`深度优先搜索`,`二叉搜索树`,`递归`  |  中等  |    |
|  [1039](https://leetcode-cn.com/problems/minimum-score-triangulation-of-polygon)  |  [多边形三角剖分的最低得分](/solution/1000-1099/1039.Minimum%20Score%20Triangulation%20of%20Polygon/README.md)  |  `动态规划`  |  中等  |    |
|  [1040](https://leetcode-cn.com/problems/moving-stones-until-consecutive-ii)  |  [移动石子直到连续 II](/solution/1000-1099/1040.Moving%20Stones%20Until%20Consecutive%20II/README.md)  |  `数组`  |  中等  |    |
|  [1041](https://leetcode-cn.com/problems/robot-bounded-in-circle)  |  [困于环中的机器人](/solution/1000-1099/1041.Robot%20Bounded%20In%20Circle/README.md)  |  `数学`  |  中等  |    |
|  [1042](https://leetcode-cn.com/problems/flower-planting-with-no-adjacent)  |  [不邻接植花](/solution/1000-1099/1042.Flower%20Planting%20With%20No%20Adjacent/README.md)  |  `图`  |  中等  |    |
|  [1043](https://leetcode-cn.com/problems/partition-array-for-maximum-sum)  |  [分隔数组以得到最大和](/solution/1000-1099/1043.Partition%20Array%20for%20Maximum%20Sum/README.md)  |  `动态规划`  |  中等  |    |
|  [1044](https://leetcode-cn.com/problems/longest-duplicate-substring)  |  [最长重复子串](/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README.md)  |  `哈希表`,`二分查找`  |  困难  |    |
|  [1045](https://leetcode-cn.com/problems/customers-who-bought-all-products)  |  [买下所有产品的客户](/solution/1000-1099/1045.Customers%20Who%20Bought%20All%20Products/README.md)  |    |  中等  |  🔒  |
|  [1046](https://leetcode-cn.com/problems/last-stone-weight)  |  [最后一块石头的重量](/solution/1000-1099/1046.Last%20Stone%20Weight/README.md)  |  `堆`,`贪心算法`  |  简单  |    |
|  [1047](https://leetcode-cn.com/problems/remove-all-adjacent-duplicates-in-string)  |  [删除字符串中的所有相邻重复项](/solution/1000-1099/1047.Remove%20All%20Adjacent%20Duplicates%20In%20String/README.md)  |  `栈`  |  简单  |    |
|  [1048](https://leetcode-cn.com/problems/longest-string-chain)  |  [最长字符串链](/solution/1000-1099/1048.Longest%20String%20Chain/README.md)  |  `哈希表`,`动态规划`  |  中等  |    |
|  [1049](https://leetcode-cn.com/problems/last-stone-weight-ii)  |  [最后一块石头的重量 II](/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README.md)  |  `动态规划`  |  中等  |    |
|  [1050](https://leetcode-cn.com/problems/actors-and-directors-who-cooperated-at-least-three-times)  |  [合作过至少三次的演员和导演](/solution/1000-1099/1050.Actors%20and%20Directors%20Who%20Cooperated%20At%20Least%20Three%20Times/README.md)  |    |  简单  |  🔒  |
|  [1051](https://leetcode-cn.com/problems/height-checker)  |  [高度检查器](/solution/1000-1099/1051.Height%20Checker/README.md)  |  `数组`  |  简单  |    |
|  [1052](https://leetcode-cn.com/problems/grumpy-bookstore-owner)  |  [爱生气的书店老板](/solution/1000-1099/1052.Grumpy%20Bookstore%20Owner/README.md)  |  `数组`  |  中等  |    |
|  [1053](https://leetcode-cn.com/problems/previous-permutation-with-one-swap)  |  [交换一次的先前排列](/solution/1000-1099/1053.Previous%20Permutation%20With%20One%20Swap/README.md)  |  `贪心算法`,`数组`  |  中等  |    |
|  [1054](https://leetcode-cn.com/problems/distant-barcodes)  |  [距离相等的条形码](/solution/1000-1099/1054.Distant%20Barcodes/README.md)  |  `堆`,`排序`  |  中等  |    |
|  [1055](https://leetcode-cn.com/problems/shortest-way-to-form-string)  |  [形成字符串的最短路径](/solution/1000-1099/1055.Shortest%20Way%20to%20Form%20String/README.md)  |  `贪心算法`,`动态规划`  |  中等  |  🔒  |
|  [1056](https://leetcode-cn.com/problems/confusing-number)  |  [易混淆数](/solution/1000-1099/1056.Confusing%20Number/README.md)  |  `数学`  |  简单  |  🔒  |
|  [1057](https://leetcode-cn.com/problems/campus-bikes)  |  [校园自行车分配](/solution/1000-1099/1057.Campus%20Bikes/README.md)  |  `贪心算法`,`排序`  |  中等  |  🔒  |
|  [1058](https://leetcode-cn.com/problems/minimize-rounding-error-to-meet-target)  |  [最小化舍入误差以满足目标](/solution/1000-1099/1058.Minimize%20Rounding%20Error%20to%20Meet%20Target/README.md)  |  `贪心算法`,`数学`,`动态规划`  |  中等  |  🔒  |
|  [1059](https://leetcode-cn.com/problems/all-paths-from-source-lead-to-destination)  |  [从始点到终点的所有路径](/solution/1000-1099/1059.All%20Paths%20from%20Source%20Lead%20to%20Destination/README.md)  |  `深度优先搜索`,`图`  |  中等  |  🔒  |
|  [1060](https://leetcode-cn.com/problems/missing-element-in-sorted-array)  |  [有序数组中的缺失元素](/solution/1000-1099/1060.Missing%20Element%20in%20Sorted%20Array/README.md)  |  `二分查找`  |  中等  |  🔒  |
|  [1061](https://leetcode-cn.com/problems/lexicographically-smallest-equivalent-string)  |  [按字典序排列最小的等效字符串](/solution/1000-1099/1061.Lexicographically%20Smallest%20Equivalent%20String/README.md)  |  `深度优先搜索`,`并查集`  |  中等  |  🔒  |
|  [1062](https://leetcode-cn.com/problems/longest-repeating-substring)  |  [最长重复子串](/solution/1000-1099/1062.Longest%20Repeating%20Substring/README.md)  |  `字符串`  |  中等  |  🔒  |
|  [1063](https://leetcode-cn.com/problems/number-of-valid-subarrays)  |  [有效子数组的数目](/solution/1000-1099/1063.Number%20of%20Valid%20Subarrays/README.md)  |  `栈`  |  困难  |  🔒  |
|  [1064](https://leetcode-cn.com/problems/fixed-point)  |  [不动点](/solution/1000-1099/1064.Fixed%20Point/README.md)  |  `数组`,`二分查找`  |  简单  |  🔒  |
|  [1065](https://leetcode-cn.com/problems/index-pairs-of-a-string)  |  [字符串的索引对](/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README.md)  |  `字典树`,`字符串`  |  简单  |  🔒  |
|  [1066](https://leetcode-cn.com/problems/campus-bikes-ii)  |  [校园自行车分配 II](/solution/1000-1099/1066.Campus%20Bikes%20II/README.md)  |  `动态规划`,`回溯算法`  |  中等  |  🔒  |
|  [1067](https://leetcode-cn.com/problems/digit-count-in-range)  |  [范围内的数字计数](/solution/1000-1099/1067.Digit%20Count%20in%20Range/README.md)  |  `数学`,`动态规划`  |  困难  |  🔒  |
|  [1068](https://leetcode-cn.com/problems/product-sales-analysis-i)  |  [产品销售分析 I](/solution/1000-1099/1068.Product%20Sales%20Analysis%20I/README.md)  |    |  简单  |  🔒  |
|  [1069](https://leetcode-cn.com/problems/product-sales-analysis-ii)  |  [产品销售分析 II](/solution/1000-1099/1069.Product%20Sales%20Analysis%20II/README.md)  |    |  简单  |  🔒  |
|  [1070](https://leetcode-cn.com/problems/product-sales-analysis-iii)  |  [产品销售分析 III](/solution/1000-1099/1070.Product%20Sales%20Analysis%20III/README.md)  |    |  中等  |  🔒  |
|  [1071](https://leetcode-cn.com/problems/greatest-common-divisor-of-strings)  |  [字符串的最大公因子](/solution/1000-1099/1071.Greatest%20Common%20Divisor%20of%20Strings/README.md)  |  `字符串`  |  简单  |    |
|  [1072](https://leetcode-cn.com/problems/flip-columns-for-maximum-number-of-equal-rows)  |  [按列翻转得到最大值等行数](/solution/1000-1099/1072.Flip%20Columns%20For%20Maximum%20Number%20of%20Equal%20Rows/README.md)  |  `哈希表`  |  中等  |    |
|  [1073](https://leetcode-cn.com/problems/adding-two-negabinary-numbers)  |  [负二进制数相加](/solution/1000-1099/1073.Adding%20Two%20Negabinary%20Numbers/README.md)  |  `数学`  |  中等  |    |
|  [1074](https://leetcode-cn.com/problems/number-of-submatrices-that-sum-to-target)  |  [元素和为目标值的子矩阵数量](/solution/1000-1099/1074.Number%20of%20Submatrices%20That%20Sum%20to%20Target/README.md)  |  `数组`,`动态规划`  |  困难  |    |
|  [1075](https://leetcode-cn.com/problems/project-employees-i)  |  [项目员工 I](/solution/1000-1099/1075.Project%20Employees%20I/README.md)  |    |  简单  |  🔒  |
|  [1076](https://leetcode-cn.com/problems/project-employees-ii)  |  [项目员工II](/solution/1000-1099/1076.Project%20Employees%20II/README.md)  |    |  简单  |  🔒  |
|  [1077](https://leetcode-cn.com/problems/project-employees-iii)  |  [项目员工 III](/solution/1000-1099/1077.Project%20Employees%20III/README.md)  |    |  中等  |  🔒  |
|  [1078](https://leetcode-cn.com/problems/occurrences-after-bigram)  |  [Bigram 分词](/solution/1000-1099/1078.Occurrences%20After%20Bigram/README.md)  |  `哈希表`  |  简单  |    |
|  [1079](https://leetcode-cn.com/problems/letter-tile-possibilities)  |  [活字印刷](/solution/1000-1099/1079.Letter%20Tile%20Possibilities/README.md)  |  `回溯算法`  |  中等  |    |
|  [1080](https://leetcode-cn.com/problems/insufficient-nodes-in-root-to-leaf-paths)  |  [根到叶路径上的不足节点](/solution/1000-1099/1080.Insufficient%20Nodes%20in%20Root%20to%20Leaf%20Paths/README.md)  |  `深度优先搜索`  |  中等  |    |
|  [1081](https://leetcode-cn.com/problems/smallest-subsequence-of-distinct-characters)  |  [不同字符的最小子序列](/solution/1000-1099/1081.Smallest%20Subsequence%20of%20Distinct%20Characters/README.md)  |  `栈`,`贪心算法`,`字符串`  |  中等  |    |
|  [1082](https://leetcode-cn.com/problems/sales-analysis-i)  |  [销售分析 I ](/solution/1000-1099/1082.Sales%20Analysis%20I/README.md)  |    |  简单  |  🔒  |
|  [1083](https://leetcode-cn.com/problems/sales-analysis-ii)  |  [销售分析 II](/solution/1000-1099/1083.Sales%20Analysis%20II/README.md)  |    |  简单  |  🔒  |
|  [1084](https://leetcode-cn.com/problems/sales-analysis-iii)  |  [销售分析III](/solution/1000-1099/1084.Sales%20Analysis%20III/README.md)  |    |  简单  |  🔒  |
|  [1085](https://leetcode-cn.com/problems/sum-of-digits-in-the-minimum-number)  |  [最小元素各数位之和](/solution/1000-1099/1085.Sum%20of%20Digits%20in%20the%20Minimum%20Number/README.md)  |  `数组`  |  简单  |  🔒  |
|  [1086](https://leetcode-cn.com/problems/high-five)  |  [前五科的均分](/solution/1000-1099/1086.High%20Five/README.md)  |  `排序`,`数组`,`哈希表`  |  简单  |  🔒  |
|  [1087](https://leetcode-cn.com/problems/brace-expansion)  |  [花括号展开](/solution/1000-1099/1087.Brace%20Expansion/README.md)  |  `回溯算法`  |  中等  |  🔒  |
|  [1088](https://leetcode-cn.com/problems/confusing-number-ii)  |  [易混淆数 II](/solution/1000-1099/1088.Confusing%20Number%20II/README.md)  |  `数学`,`回溯算法`  |  困难  |  🔒  |
|  [1089](https://leetcode-cn.com/problems/duplicate-zeros)  |  [复写零](/solution/1000-1099/1089.Duplicate%20Zeros/README.md)  |  `数组`  |  简单  |    |
|  [1090](https://leetcode-cn.com/problems/largest-values-from-labels)  |  [受标签影响的最大值](/solution/1000-1099/1090.Largest%20Values%20From%20Labels/README.md)  |  `贪心算法`,`哈希表`  |  中等  |    |
|  [1091](https://leetcode-cn.com/problems/shortest-path-in-binary-matrix)  |  [二进制矩阵中的最短路径](/solution/1000-1099/1091.Shortest%20Path%20in%20Binary%20Matrix/README.md)  |  `广度优先搜索`  |  中等  |    |
|  [1092](https://leetcode-cn.com/problems/shortest-common-supersequence)  |  [最短公共超序列](/solution/1000-1099/1092.Shortest%20Common%20Supersequence/README.md)  |  `动态规划`  |  困难  |    |
|  [1093](https://leetcode-cn.com/problems/statistics-from-a-large-sample)  |  [大样本统计](/solution/1000-1099/1093.Statistics%20from%20a%20Large%20Sample/README.md)  |  `数学`,`双指针`  |  中等  |    |
|  [1094](https://leetcode-cn.com/problems/car-pooling)  |  [拼车](/solution/1000-1099/1094.Car%20Pooling/README.md)  |  `贪心算法`  |  中等  |    |
|  [1095](https://leetcode-cn.com/problems/find-in-mountain-array)  |  [山脉数组中查找目标值](/solution/1000-1099/1095.Find%20in%20Mountain%20Array/README.md)  |  `二分查找`  |  困难  |    |
|  [1096](https://leetcode-cn.com/problems/brace-expansion-ii)  |  [花括号展开 II](/solution/1000-1099/1096.Brace%20Expansion%20II/README.md)  |  `字符串`  |  困难  |    |
|  [1097](https://leetcode-cn.com/problems/game-play-analysis-v)  |  [游戏玩法分析 V](/solution/1000-1099/1097.Game%20Play%20Analysis%20V/README.md)  |    |  困难  |  🔒  |
|  [1098](https://leetcode-cn.com/problems/unpopular-books)  |  [小众书籍](/solution/1000-1099/1098.Unpopular%20Books/README.md)  |    |  中等  |  🔒  |
|  [1099](https://leetcode-cn.com/problems/two-sum-less-than-k)  |  [小于 K 的两数之和](/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README.md)  |  `排序`,`数组`,`双指针`  |  简单  |  🔒  |
|  [1100](https://leetcode-cn.com/problems/find-k-length-substrings-with-no-repeated-characters)  |  [长度为 K 的无重复字符子串](/solution/1100-1199/1100.Find%20K-Length%20Substrings%20With%20No%20Repeated%20Characters/README.md)  |  `字符串`  |  中等  |  🔒  |
|  [1101](https://leetcode-cn.com/problems/the-earliest-moment-when-everyone-become-friends)  |  [彼此熟识的最早时间](/solution/1100-1199/1101.The%20Earliest%20Moment%20When%20Everyone%20Become%20Friends/README.md)  |  `并查集`  |  中等  |  🔒  |
|  [1102](https://leetcode-cn.com/problems/path-with-maximum-minimum-value)  |  [得分最高的路径](/solution/1100-1199/1102.Path%20With%20Maximum%20Minimum%20Value/README.md)  |  `深度优先搜索`,`并查集`,`图`  |  中等  |  🔒  |
|  [1103](https://leetcode-cn.com/problems/distribute-candies-to-people)  |  [分糖果 II](/solution/1100-1199/1103.Distribute%20Candies%20to%20People/README.md)  |  `数学`  |  简单  |    |
|  [1104](https://leetcode-cn.com/problems/path-in-zigzag-labelled-binary-tree)  |  [二叉树寻路](/solution/1100-1199/1104.Path%20In%20Zigzag%20Labelled%20Binary%20Tree/README.md)  |  `树`,`数学`  |  中等  |    |
|  [1105](https://leetcode-cn.com/problems/filling-bookcase-shelves)  |  [填充书架](/solution/1100-1199/1105.Filling%20Bookcase%20Shelves/README.md)  |  `动态规划`  |  中等  |    |
|  [1106](https://leetcode-cn.com/problems/parsing-a-boolean-expression)  |  [解析布尔表达式](/solution/1100-1199/1106.Parsing%20A%20Boolean%20Expression/README.md)  |  `字符串`  |  困难  |    |
|  [1107](https://leetcode-cn.com/problems/new-users-daily-count)  |  [每日新用户统计](/solution/1100-1199/1107.New%20Users%20Daily%20Count/README.md)  |    |  中等  |  🔒  |
|  [1108](https://leetcode-cn.com/problems/defanging-an-ip-address)  |  [IP 地址无效化](/solution/1100-1199/1108.Defanging%20an%20IP%20Address/README.md)  |  `字符串`  |  简单  |    |
|  [1109](https://leetcode-cn.com/problems/corporate-flight-bookings)  |  [航班预订统计](/solution/1100-1199/1109.Corporate%20Flight%20Bookings/README.md)  |  `数组`,`数学`  |  中等  |    |
|  [1110](https://leetcode-cn.com/problems/delete-nodes-and-return-forest)  |  [删点成林](/solution/1100-1199/1110.Delete%20Nodes%20And%20Return%20Forest/README.md)  |  `树`,`深度优先搜索`  |  中等  |    |
|  [1111](https://leetcode-cn.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings)  |  [有效括号的嵌套深度](/solution/1100-1199/1111.Maximum%20Nesting%20Depth%20of%20Two%20Valid%20Parentheses%20Strings/README.md)  |  `贪心算法`,`二分查找`  |  中等  |    |
|  [1112](https://leetcode-cn.com/problems/highest-grade-for-each-student)  |  [每位学生的最高成绩](/solution/1100-1199/1112.Highest%20Grade%20For%20Each%20Student/README.md)  |    |  中等  |  🔒  |
|  [1113](https://leetcode-cn.com/problems/reported-posts)  |  [报告的记录](/solution/1100-1199/1113.Reported%20Posts/README.md)  |    |  简单  |  🔒  |
|  [1114](https://leetcode-cn.com/problems/print-in-order)  |  [按序打印](/solution/1100-1199/1114.Print%20in%20Order/README.md)  |    |  简单  |    |
|  [1115](https://leetcode-cn.com/problems/print-foobar-alternately)  |  [交替打印FooBar](/solution/1100-1199/1115.Print%20FooBar%20Alternately/README.md)  |    |  中等  |    |
|  [1116](https://leetcode-cn.com/problems/print-zero-even-odd)  |  [打印零与奇偶数](/solution/1100-1199/1116.Print%20Zero%20Even%20Odd/README.md)  |    |  中等  |    |
|  [1117](https://leetcode-cn.com/problems/building-h2o)  |  [H2O 生成](/solution/1100-1199/1117.Building%20H2O/README.md)  |    |  中等  |    |
|  [1118](https://leetcode-cn.com/problems/number-of-days-in-a-month)  |  [一月有多少天](/solution/1100-1199/1118.Number%20of%20Days%20in%20a%20Month/README.md)  |    |  简单  |  🔒  |
|  [1119](https://leetcode-cn.com/problems/remove-vowels-from-a-string)  |  [删去字符串中的元音](/solution/1100-1199/1119.Remove%20Vowels%20from%20a%20String/README.md)  |  `字符串`  |  简单  |  🔒  |
|  [1120](https://leetcode-cn.com/problems/maximum-average-subtree)  |  [子树的最大平均值](/solution/1100-1199/1120.Maximum%20Average%20Subtree/README.md)  |  `树`  |  中等  |  🔒  |
|  [1121](https://leetcode-cn.com/problems/divide-array-into-increasing-sequences)  |  [将数组分成几个递增序列](/solution/1100-1199/1121.Divide%20Array%20Into%20Increasing%20Sequences/README.md)  |  `数学`  |  困难  |  🔒  |
|  [1122](https://leetcode-cn.com/problems/relative-sort-array)  |  [数组的相对排序](/solution/1100-1199/1122.Relative%20Sort%20Array/README.md)  |  `排序`,`数组`  |  简单  |    |
|  [1123](https://leetcode-cn.com/problems/lowest-common-ancestor-of-deepest-leaves)  |  [最深叶节点的最近公共祖先](/solution/1100-1199/1123.Lowest%20Common%20Ancestor%20of%20Deepest%20Leaves/README.md)  |  `树`,`深度优先搜索`  |  中等  |    |
|  [1124](https://leetcode-cn.com/problems/longest-well-performing-interval)  |  [表现良好的最长时间段](/solution/1100-1199/1124.Longest%20Well-Performing%20Interval/README.md)  |  `栈`  |  中等  |    |
|  [1125](https://leetcode-cn.com/problems/smallest-sufficient-team)  |  [最小的必要团队](/solution/1100-1199/1125.Smallest%20Sufficient%20Team/README.md)  |  `位运算`,`动态规划`  |  困难  |    |
|  [1126](https://leetcode-cn.com/problems/active-businesses)  |  [查询活跃业务](/solution/1100-1199/1126.Active%20Businesses/README.md)  |    |  中等  |  🔒  |
|  [1127](https://leetcode-cn.com/problems/user-purchase-platform)  |  [用户购买平台](/solution/1100-1199/1127.User%20Purchase%20Platform/README.md)  |    |  困难  |  🔒  |
|  [1128](https://leetcode-cn.com/problems/number-of-equivalent-domino-pairs)  |  [等价多米诺骨牌对的数量](/solution/1100-1199/1128.Number%20of%20Equivalent%20Domino%20Pairs/README.md)  |  `数组`  |  简单  |    |
|  [1129](https://leetcode-cn.com/problems/shortest-path-with-alternating-colors)  |  [颜色交替的最短路径](/solution/1100-1199/1129.Shortest%20Path%20with%20Alternating%20Colors/README.md)  |  `广度优先搜索`,`图`  |  中等  |    |
|  [1130](https://leetcode-cn.com/problems/minimum-cost-tree-from-leaf-values)  |  [叶值的最小代价生成树](/solution/1100-1199/1130.Minimum%20Cost%20Tree%20From%20Leaf%20Values/README.md)  |  `栈`,`树`,`动态规划`  |  中等  |    |
|  [1131](https://leetcode-cn.com/problems/maximum-of-absolute-value-expression)  |  [绝对值表达式的最大值](/solution/1100-1199/1131.Maximum%20of%20Absolute%20Value%20Expression/README.md)  |  `位运算`,`数学`  |  中等  |    |
|  [1132](https://leetcode-cn.com/problems/reported-posts-ii)  |  [报告的记录 II](/solution/1100-1199/1132.Reported%20Posts%20II/README.md)  |    |  中等  |  🔒  |
|  [1133](https://leetcode-cn.com/problems/largest-unique-number)  |  [最大唯一数](/solution/1100-1199/1133.Largest%20Unique%20Number/README.md)  |  `数组`,`哈希表`  |  简单  |  🔒  |
|  [1134](https://leetcode-cn.com/problems/armstrong-number)  |  [阿姆斯特朗数](/solution/1100-1199/1134.Armstrong%20Number/README.md)  |  `数学`  |  简单  |  🔒  |
|  [1135](https://leetcode-cn.com/problems/connecting-cities-with-minimum-cost)  |  [最低成本联通所有城市](/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README.md)  |  `并查集`,`图`  |  中等  |  🔒  |
|  [1136](https://leetcode-cn.com/problems/parallel-courses)  |  [平行课程](/solution/1100-1199/1136.Parallel%20Courses/README.md)  |  `深度优先搜索`,`图`,`动态规划`  |  中等  |  🔒  |
|  [1137](https://leetcode-cn.com/problems/n-th-tribonacci-number)  |  [第 N 个泰波那契数](/solution/1100-1199/1137.N-th%20Tribonacci%20Number/README.md)  |  `递归`  |  简单  |    |
|  [1138](https://leetcode-cn.com/problems/alphabet-board-path)  |  [字母板上的路径](/solution/1100-1199/1138.Alphabet%20Board%20Path/README.md)  |  `哈希表`,`字符串`  |  中等  |    |
|  [1139](https://leetcode-cn.com/problems/largest-1-bordered-square)  |  [最大的以 1 为边界的正方形](/solution/1100-1199/1139.Largest%201-Bordered%20Square/README.md)  |  `动态规划`  |  中等  |    |
|  [1140](https://leetcode-cn.com/problems/stone-game-ii)  |  [石子游戏 II](/solution/1100-1199/1140.Stone%20Game%20II/README.md)  |  `动态规划`  |  中等  |    |
|  [1141](https://leetcode-cn.com/problems/user-activity-for-the-past-30-days-i)  |  [查询近30天活跃用户数](/solution/1100-1199/1141.User%20Activity%20for%20the%20Past%2030%20Days%20I/README.md)  |    |  简单  |  🔒  |
|  [1142](https://leetcode-cn.com/problems/user-activity-for-the-past-30-days-ii)  |  [过去30天的用户活动 II](/solution/1100-1199/1142.User%20Activity%20for%20the%20Past%2030%20Days%20II/README.md)  |    |  简单  |  🔒  |
|  [1143](https://leetcode-cn.com/problems/longest-common-subsequence)  |  [最长公共子序列](/solution/1100-1199/1143.Longest%20Common%20Subsequence/README.md)  |  `动态规划`  |  中等  |    |
|  [1144](https://leetcode-cn.com/problems/decrease-elements-to-make-array-zigzag)  |  [递减元素使数组呈锯齿状](/solution/1100-1199/1144.Decrease%20Elements%20To%20Make%20Array%20Zigzag/README.md)  |  `数组`  |  中等  |    |
|  [1145](https://leetcode-cn.com/problems/binary-tree-coloring-game)  |  [二叉树着色游戏](/solution/1100-1199/1145.Binary%20Tree%20Coloring%20Game/README.md)  |  `树`,`深度优先搜索`  |  中等  |    |
|  [1146](https://leetcode-cn.com/problems/snapshot-array)  |  [快照数组](/solution/1100-1199/1146.Snapshot%20Array/README.md)  |  `数组`  |  中等  |    |
|  [1147](https://leetcode-cn.com/problems/longest-chunked-palindrome-decomposition)  |  [段式回文](/solution/1100-1199/1147.Longest%20Chunked%20Palindrome%20Decomposition/README.md)  |  `动态规划`  |  困难  |    |
|  [1148](https://leetcode-cn.com/problems/article-views-i)  |  [文章浏览 I](/solution/1100-1199/1148.Article%20Views%20I/README.md)  |    |  简单  |  🔒  |
|  [1149](https://leetcode-cn.com/problems/article-views-ii)  |  [文章浏览 II](/solution/1100-1199/1149.Article%20Views%20II/README.md)  |    |  中等  |  🔒  |
|  [1150](https://leetcode-cn.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array)  |  [检查一个数是否在数组中占绝大多数](/solution/1100-1199/1150.Check%20If%20a%20Number%20Is%20Majority%20Element%20in%20a%20Sorted%20Array/README.md)  |  `数组`,`二分查找`  |  简单  |  🔒  |
|  [1151](https://leetcode-cn.com/problems/minimum-swaps-to-group-all-1s-together)  |  [最少交换次数来组合所有的 1](/solution/1100-1199/1151.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together/README.md)  |  `数组`  |  中等  |  🔒  |
|  [1152](https://leetcode-cn.com/problems/analyze-user-website-visit-pattern)  |  [用户网站访问行为分析](/solution/1100-1199/1152.Analyze%20User%20Website%20Visit%20Pattern/README.md)  |  `排序`,`数组`,`哈希表`  |  中等  |  🔒  |
|  [1153](https://leetcode-cn.com/problems/string-transforms-into-another-string)  |  [字符串转化](/solution/1100-1199/1153.String%20Transforms%20Into%20Another%20String/README.md)  |  `图`  |  困难  |  🔒  |
|  [1154](https://leetcode-cn.com/problems/day-of-the-year)  |  [一年中的第几天](/solution/1100-1199/1154.Day%20of%20the%20Year/README.md)  |  `数学`  |  简单  |    |
|  [1155](https://leetcode-cn.com/problems/number-of-dice-rolls-with-target-sum)  |  [掷骰子的N种方法](/solution/1100-1199/1155.Number%20of%20Dice%20Rolls%20With%20Target%20Sum/README.md)  |  `动态规划`  |  中等  |    |
|  [1156](https://leetcode-cn.com/problems/swap-for-longest-repeated-character-substring)  |  [单字符重复子串的最大长度](/solution/1100-1199/1156.Swap%20For%20Longest%20Repeated%20Character%20Substring/README.md)  |  `字符串`  |  中等  |    |
|  [1157](https://leetcode-cn.com/problems/online-majority-element-in-subarray)  |  [子数组中占绝大多数的元素](/solution/1100-1199/1157.Online%20Majority%20Element%20In%20Subarray/README.md)  |  `线段树`,`数组`,`二分查找`  |  困难  |    |
|  [1158](https://leetcode-cn.com/problems/market-analysis-i)  |  [市场分析 I](/solution/1100-1199/1158.Market%20Analysis%20I/README.md)  |    |  中等  |  🔒  |
|  [1159](https://leetcode-cn.com/problems/market-analysis-ii)  |  [市场分析 II](/solution/1100-1199/1159.Market%20Analysis%20II/README.md)  |    |  困难  |  🔒  |
|  [1160](https://leetcode-cn.com/problems/find-words-that-can-be-formed-by-characters)  |  [拼写单词](/solution/1100-1199/1160.Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters/README.md)  |  `数组`,`哈希表`  |  简单  |    |
|  [1161](https://leetcode-cn.com/problems/maximum-level-sum-of-a-binary-tree)  |  [最大层内元素和](/solution/1100-1199/1161.Maximum%20Level%20Sum%20of%20a%20Binary%20Tree/README.md)  |  `树`,`广度优先搜索`  |  中等  |    |
|  [1162](https://leetcode-cn.com/problems/as-far-from-land-as-possible)  |  [地图分析](/solution/1100-1199/1162.As%20Far%20from%20Land%20as%20Possible/README.md)  |  `广度优先搜索`,`图`  |  中等  |    |
|  [1163](https://leetcode-cn.com/problems/last-substring-in-lexicographical-order)  |  [按字典序排在最后的子串](/solution/1100-1199/1163.Last%20Substring%20in%20Lexicographical%20Order/README.md)  |  `字符串`  |  困难  |    |
|  [1164](https://leetcode-cn.com/problems/product-price-at-a-given-date)  |  [指定日期的产品价格](/solution/1100-1199/1164.Product%20Price%20at%20a%20Given%20Date/README.md)  |    |  中等  |  🔒  |
|  [1165](https://leetcode-cn.com/problems/single-row-keyboard)  |  [单行键盘](/solution/1100-1199/1165.Single-Row%20Keyboard/README.md)  |  `字符串`  |  简单  |  🔒  |
|  [1166](https://leetcode-cn.com/problems/design-file-system)  |  [设计文件系统](/solution/1100-1199/1166.Design%20File%20System/README.md)  |  `设计`,`哈希表`  |  中等  |  🔒  |
|  [1167](https://leetcode-cn.com/problems/minimum-cost-to-connect-sticks)  |  [连接棒材的最低费用](/solution/1100-1199/1167.Minimum%20Cost%20to%20Connect%20Sticks/README.md)  |  `贪心算法`  |  中等  |  🔒  |
|  [1168](https://leetcode-cn.com/problems/optimize-water-distribution-in-a-village)  |  [水资源分配优化](/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README.md)  |  `并查集`,`图`  |  困难  |  🔒  |
|  [1169](https://leetcode-cn.com/problems/invalid-transactions)  |  [查询无效交易](/solution/1100-1199/1169.Invalid%20Transactions/README.md)  |  `数组`,`字符串`  |  中等  |    |
|  [1170](https://leetcode-cn.com/problems/compare-strings-by-frequency-of-the-smallest-character)  |  [比较字符串最小字母出现频次](/solution/1100-1199/1170.Compare%20Strings%20by%20Frequency%20of%20the%20Smallest%20Character/README.md)  |  `数组`,`字符串`,`二分查找`  |  中等  |    |
|  [1171](https://leetcode-cn.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list)  |  [从链表中删去总和值为零的连续节点](/solution/1100-1199/1171.Remove%20Zero%20Sum%20Consecutive%20Nodes%20from%20Linked%20List/README.md)  |  `链表`  |  中等  |    |
|  [1172](https://leetcode-cn.com/problems/dinner-plate-stacks)  |  [餐盘栈](/solution/1100-1199/1172.Dinner%20Plate%20Stacks/README.md)  |  `设计`  |  困难  |    |
|  [1173](https://leetcode-cn.com/problems/immediate-food-delivery-i)  |  [即时食物配送 I](/solution/1100-1199/1173.Immediate%20Food%20Delivery%20I/README.md)  |    |  简单  |  🔒  |
|  [1174](https://leetcode-cn.com/problems/immediate-food-delivery-ii)  |  [即时食物配送 II](/solution/1100-1199/1174.Immediate%20Food%20Delivery%20II/README.md)  |    |  中等  |  🔒  |
|  [1175](https://leetcode-cn.com/problems/prime-arrangements)  |  [质数排列](/solution/1100-1199/1175.Prime%20Arrangements/README.md)  |  `数学`  |  简单  |    |
|  [1176](https://leetcode-cn.com/problems/diet-plan-performance)  |  [健身计划评估](/solution/1100-1199/1176.Diet%20Plan%20Performance/README.md)  |  `数组`  |  简单  |  🔒  |
|  [1177](https://leetcode-cn.com/problems/can-make-palindrome-from-substring)  |  [构建回文串检测](/solution/1100-1199/1177.Can%20Make%20Palindrome%20from%20Substring/README.md)  |  `数组`,`字符串`  |  中等  |    |
|  [1178](https://leetcode-cn.com/problems/number-of-valid-words-for-each-puzzle)  |  [猜字谜](/solution/1100-1199/1178.Number%20of%20Valid%20Words%20for%20Each%20Puzzle/README.md)  |  `位运算`,`哈希表`  |  困难  |    |
|  [1179](https://leetcode-cn.com/problems/reformat-department-table)  |  [重新格式化部门表](/solution/1100-1199/1179.Reformat%20Department%20Table/README.md)  |    |  简单  |    |
|  [1180](https://leetcode-cn.com/problems/count-substrings-with-only-one-distinct-letter)  |  [统计只含单一字母的子串](/solution/1100-1199/1180.Count%20Substrings%20with%20Only%20One%20Distinct%20Letter/README.md)  |  `数学`,`字符串`  |  简单  |  🔒  |
|  [1181](https://leetcode-cn.com/problems/before-and-after-puzzle)  |  [前后拼接](/solution/1100-1199/1181.Before%20and%20After%20Puzzle/README.md)  |  `字符串`  |  中等  |  🔒  |
|  [1182](https://leetcode-cn.com/problems/shortest-distance-to-target-color)  |  [与目标颜色间的最短距离](/solution/1100-1199/1182.Shortest%20Distance%20to%20Target%20Color/README.md)  |  `二分查找`  |  中等  |  🔒  |
|  [1183](https://leetcode-cn.com/problems/maximum-number-of-ones)  |  [矩阵中 1 的最大数量](/solution/1100-1199/1183.Maximum%20Number%20of%20Ones/README.md)  |  `排序`,`数学`  |  困难  |  🔒  |
|  [1184](https://leetcode-cn.com/problems/distance-between-bus-stops)  |  [公交站间的距离](/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/README.md)  |  `数组`  |  简单  |    |
|  [1185](https://leetcode-cn.com/problems/day-of-the-week)  |  [一周中的第几天](/solution/1100-1199/1185.Day%20of%20the%20Week/README.md)  |  `数组`  |  简单  |    |
|  [1186](https://leetcode-cn.com/problems/maximum-subarray-sum-with-one-deletion)  |  [删除一次得到子数组最大和](/solution/1100-1199/1186.Maximum%20Subarray%20Sum%20with%20One%20Deletion/README.md)  |  `动态规划`  |  中等  |    |
|  [1187](https://leetcode-cn.com/problems/make-array-strictly-increasing)  |  [使数组严格递增](/solution/1100-1199/1187.Make%20Array%20Strictly%20Increasing/README.md)  |  `动态规划`  |  困难  |    |
|  [1188](https://leetcode-cn.com/problems/design-bounded-blocking-queue)  |  [设计有限阻塞队列](/solution/1100-1199/1188.Design%20Bounded%20Blocking%20Queue/README.md)  |    |  中等  |  🔒  |
|  [1189](https://leetcode-cn.com/problems/maximum-number-of-balloons)  |  [“气球” 的最大数量](/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/README.md)  |  `哈希表`,`字符串`  |  简单  |    |
|  [1190](https://leetcode-cn.com/problems/reverse-substrings-between-each-pair-of-parentheses)  |  [反转每对括号间的子串](/solution/1100-1199/1190.Reverse%20Substrings%20Between%20Each%20Pair%20of%20Parentheses/README.md)  |  `栈`  |  中等  |    |
|  [1191](https://leetcode-cn.com/problems/k-concatenation-maximum-sum)  |  [K 次串联后最大子数组之和](/solution/1100-1199/1191.K-Concatenation%20Maximum%20Sum/README.md)  |  `动态规划`  |  中等  |    |
|  [1192](https://leetcode-cn.com/problems/critical-connections-in-a-network)  |  [查找集群内的「关键连接」](/solution/1100-1199/1192.Critical%20Connections%20in%20a%20Network/README.md)  |  `深度优先搜索`  |  困难  |    |
|  [1193](https://leetcode-cn.com/problems/monthly-transactions-i)  |  [每月交易 I](/solution/1100-1199/1193.Monthly%20Transactions%20I/README.md)  |    |  中等  |  🔒  |
|  [1194](https://leetcode-cn.com/problems/tournament-winners)  |  [锦标赛优胜者](/solution/1100-1199/1194.Tournament%20Winners/README.md)  |    |  困难  |  🔒  |
|  [1195](https://leetcode-cn.com/problems/fizz-buzz-multithreaded)  |  [交替打印字符串](/solution/1100-1199/1195.Fizz%20Buzz%20Multithreaded/README.md)  |    |  中等  |    |
|  [1196](https://leetcode-cn.com/problems/how-many-apples-can-you-put-into-the-basket)  |  [最多可以买到的苹果数量](/solution/1100-1199/1196.How%20Many%20Apples%20Can%20You%20Put%20into%20the%20Basket/README.md)  |  `贪心算法`  |  简单  |  🔒  |
|  [1197](https://leetcode-cn.com/problems/minimum-knight-moves)  |  [进击的骑士](/solution/1100-1199/1197.Minimum%20Knight%20Moves/README.md)  |  `广度优先搜索`  |  中等  |  🔒  |
|  [1198](https://leetcode-cn.com/problems/find-smallest-common-element-in-all-rows)  |  [找出所有行中最小公共元素](/solution/1100-1199/1198.Find%20Smallest%20Common%20Element%20in%20All%20Rows/README.md)  |  `哈希表`,`二分查找`  |  中等  |  🔒  |
|  [1199](https://leetcode-cn.com/problems/minimum-time-to-build-blocks)  |  [建造街区的最短时间](/solution/1100-1199/1199.Minimum%20Time%20to%20Build%20Blocks/README.md)  |  `数学`,`动态规划`  |  困难  |  🔒  |
|  [1200](https://leetcode-cn.com/problems/minimum-absolute-difference)  |  [最小绝对差](/solution/1200-1299/1200.Minimum%20Absolute%20Difference/README.md)  |  `数组`  |  简单  |    |
|  [1201](https://leetcode-cn.com/problems/ugly-number-iii)  |  [丑数 III](/solution/1200-1299/1201.Ugly%20Number%20III/README.md)  |  `数学`,`二分查找`  |  中等  |    |
|  [1202](https://leetcode-cn.com/problems/smallest-string-with-swaps)  |  [交换字符串中的元素](/solution/1200-1299/1202.Smallest%20String%20With%20Swaps/README.md)  |  `并查集`,`数组`  |  中等  |    |
|  [1203](https://leetcode-cn.com/problems/sort-items-by-groups-respecting-dependencies)  |  [项目管理](/solution/1200-1299/1203.Sort%20Items%20by%20Groups%20Respecting%20Dependencies/README.md)  |  `深度优先搜索`,`图`,`拓扑排序`  |  困难  |    |
|  [1204](https://leetcode-cn.com/problems/last-person-to-fit-in-the-elevator)  |  [最后一个能进入电梯的人](/solution/1200-1299/1204.Last%20Person%20to%20Fit%20in%20the%20Elevator/README.md)  |    |  中等  |  🔒  |
|  [1205](https://leetcode-cn.com/problems/monthly-transactions-ii)  |  [每月交易II](/solution/1200-1299/1205.Monthly%20Transactions%20II/README.md)  |    |  中等  |  🔒  |
|  [1206](https://leetcode-cn.com/problems/design-skiplist)  |  [设计跳表](/solution/1200-1299/1206.Design%20Skiplist/README.md)  |  `设计`  |  困难  |    |
|  [1207](https://leetcode-cn.com/problems/unique-number-of-occurrences)  |  [独一无二的出现次数](/solution/1200-1299/1207.Unique%20Number%20of%20Occurrences/README.md)  |  `哈希表`  |  简单  |    |
|  [1208](https://leetcode-cn.com/problems/get-equal-substrings-within-budget)  |  [尽可能使字符串相等](/solution/1200-1299/1208.Get%20Equal%20Substrings%20Within%20Budget/README.md)  |  `数组`  |  中等  |    |
|  [1209](https://leetcode-cn.com/problems/remove-all-adjacent-duplicates-in-string-ii)  |  [删除字符串中的所有相邻重复项 II](/solution/1200-1299/1209.Remove%20All%20Adjacent%20Duplicates%20in%20String%20II/README.md)  |  `栈`  |  中等  |    |
|  [1210](https://leetcode-cn.com/problems/minimum-moves-to-reach-target-with-rotations)  |  [穿过迷宫的最少移动次数](/solution/1200-1299/1210.Minimum%20Moves%20to%20Reach%20Target%20with%20Rotations/README.md)  |  `广度优先搜索`  |  困难  |    |
|  [1211](https://leetcode-cn.com/problems/queries-quality-and-percentage)  |  [查询结果的质量和占比](/solution/1200-1299/1211.Queries%20Quality%20and%20Percentage/README.md)  |    |  简单  |  🔒  |
|  [1212](https://leetcode-cn.com/problems/team-scores-in-football-tournament)  |  [查询球队积分](/solution/1200-1299/1212.Team%20Scores%20in%20Football%20Tournament/README.md)  |    |  中等  |  🔒  |
|  [1213](https://leetcode-cn.com/problems/intersection-of-three-sorted-arrays)  |  [三个有序数组的交集](/solution/1200-1299/1213.Intersection%20of%20Three%20Sorted%20Arrays/README.md)  |  `哈希表`,`双指针`  |  简单  |  🔒  |
|  [1214](https://leetcode-cn.com/problems/two-sum-bsts)  |  [查找两棵二叉搜索树之和](/solution/1200-1299/1214.Two%20Sum%20BSTs/README.md)  |  `二叉搜索树`  |  中等  |  🔒  |
|  [1215](https://leetcode-cn.com/problems/stepping-numbers)  |  [步进数](/solution/1200-1299/1215.Stepping%20Numbers/README.md)  |  `回溯算法`  |  中等  |  🔒  |
|  [1216](https://leetcode-cn.com/problems/valid-palindrome-iii)  |  [验证回文字符串 III](/solution/1200-1299/1216.Valid%20Palindrome%20III/README.md)  |  `字符串`,`动态规划`  |  困难  |  🔒  |
|  [1217](https://leetcode-cn.com/problems/minimum-cost-to-move-chips-to-the-same-position)  |  [玩筹码](/solution/1200-1299/1217.Minimum%20Cost%20to%20Move%20Chips%20to%20The%20Same%20Position/README.md)  |  `贪心算法`,`数组`,`数学`  |  简单  |    |
|  [1218](https://leetcode-cn.com/problems/longest-arithmetic-subsequence-of-given-difference)  |  [最长定差子序列](/solution/1200-1299/1218.Longest%20Arithmetic%20Subsequence%20of%20Given%20Difference/README.md)  |  `哈希表`,`数学`,`动态规划`  |  中等  |    |
|  [1219](https://leetcode-cn.com/problems/path-with-maximum-gold)  |  [黄金矿工](/solution/1200-1299/1219.Path%20with%20Maximum%20Gold/README.md)  |  `回溯算法`  |  中等  |    |
|  [1220](https://leetcode-cn.com/problems/count-vowels-permutation)  |  [统计元音字母序列的数目](/solution/1200-1299/1220.Count%20Vowels%20Permutation/README.md)  |  `动态规划`  |  困难  |    |
|  [1221](https://leetcode-cn.com/problems/split-a-string-in-balanced-strings)  |  [分割平衡字符串](/solution/1200-1299/1221.Split%20a%20String%20in%20Balanced%20Strings/README.md)  |  `贪心算法`,`字符串`  |  简单  |    |
|  [1222](https://leetcode-cn.com/problems/queens-that-can-attack-the-king)  |  [可以攻击国王的皇后](/solution/1200-1299/1222.Queens%20That%20Can%20Attack%20the%20King/README.md)  |  `数组`  |  中等  |    |
|  [1223](https://leetcode-cn.com/problems/dice-roll-simulation)  |  [掷骰子模拟](/solution/1200-1299/1223.Dice%20Roll%20Simulation/README.md)  |  `动态规划`  |  困难  |    |
|  [1224](https://leetcode-cn.com/problems/maximum-equal-frequency)  |  [最大相等频率](/solution/1200-1299/1224.Maximum%20Equal%20Frequency/README.md)  |  `哈希表`  |  困难  |    |
|  [1225](https://leetcode-cn.com/problems/report-contiguous-dates)  |  [报告系统状态的连续日期](/solution/1200-1299/1225.Report%20Contiguous%20Dates/README.md)  |    |  困难  |  🔒  |
|  [1226](https://leetcode-cn.com/problems/the-dining-philosophers)  |  [哲学家进餐](/solution/1200-1299/1226.The%20Dining%20Philosophers/README.md)  |    |  中等  |    |
|  [1227](https://leetcode-cn.com/problems/airplane-seat-assignment-probability)  |  [飞机座位分配概率](/solution/1200-1299/1227.Airplane%20Seat%20Assignment%20Probability/README.md)  |  `脑筋急转弯`,`数学`,`动态规划`  |  中等  |    |
|  [1228](https://leetcode-cn.com/problems/missing-number-in-arithmetic-progression)  |  [等差数列中缺失的数字](/solution/1200-1299/1228.Missing%20Number%20In%20Arithmetic%20Progression/README.md)  |  `数学`  |  简单  |  🔒  |
|  [1229](https://leetcode-cn.com/problems/meeting-scheduler)  |  [安排会议日程](/solution/1200-1299/1229.Meeting%20Scheduler/README.md)  |  `排序`,`双指针`  |  中等  |  🔒  |
|  [1230](https://leetcode-cn.com/problems/toss-strange-coins)  |  [抛掷硬币](/solution/1200-1299/1230.Toss%20Strange%20Coins/README.md)  |  `数学`,`动态规划`  |  中等  |  🔒  |
|  [1231](https://leetcode-cn.com/problems/divide-chocolate)  |  [分享巧克力](/solution/1200-1299/1231.Divide%20Chocolate/README.md)  |  `贪心算法`,`二分查找`  |  困难  |  🔒  |
|  [1232](https://leetcode-cn.com/problems/check-if-it-is-a-straight-line)  |  [缀点成线](/solution/1200-1299/1232.Check%20If%20It%20Is%20a%20Straight%20Line/README.md)  |  `几何`,`数组`,`数学`  |  简单  |    |
|  [1233](https://leetcode-cn.com/problems/remove-sub-folders-from-the-filesystem)  |  [删除子文件夹](/solution/1200-1299/1233.Remove%20Sub-Folders%20from%20the%20Filesystem/README.md)  |  `数组`,`字符串`  |  中等  |    |
|  [1234](https://leetcode-cn.com/problems/replace-the-substring-for-balanced-string)  |  [替换子串得到平衡字符串](/solution/1200-1299/1234.Replace%20the%20Substring%20for%20Balanced%20String/README.md)  |  `双指针`,`字符串`  |  中等  |    |
|  [1235](https://leetcode-cn.com/problems/maximum-profit-in-job-scheduling)  |  [规划兼职工作](/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README.md)  |  `排序`,`二分查找`,`动态规划`  |  困难  |    |
|  [1236](https://leetcode-cn.com/problems/web-crawler)  |  [网络爬虫](/solution/1200-1299/1236.Web%20Crawler/README.md)  |  `深度优先搜索`,`广度优先搜索`  |  中等  |  🔒  |
|  [1237](https://leetcode-cn.com/problems/find-positive-integer-solution-for-a-given-equation)  |  [找出给定方程的正整数解](/solution/1200-1299/1237.Find%20Positive%20Integer%20Solution%20for%20a%20Given%20Equation/README.md)  |  `数学`,`二分查找`  |  中等  |    |
|  [1238](https://leetcode-cn.com/problems/circular-permutation-in-binary-representation)  |  [循环码排列](/solution/1200-1299/1238.Circular%20Permutation%20in%20Binary%20Representation/README.md)  |  `数学`  |  中等  |    |
|  [1239](https://leetcode-cn.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters)  |  [串联字符串的最大长度](/solution/1200-1299/1239.Maximum%20Length%20of%20a%20Concatenated%20String%20with%20Unique%20Characters/README.md)  |  `位运算`,`回溯算法`  |  中等  |    |
|  [1240](https://leetcode-cn.com/problems/tiling-a-rectangle-with-the-fewest-squares)  |  [铺瓷砖](/solution/1200-1299/1240.Tiling%20a%20Rectangle%20with%20the%20Fewest%20Squares/README.md)  |  `动态规划`,`回溯算法`  |  困难  |    |
|  [1241](https://leetcode-cn.com/problems/number-of-comments-per-post)  |  [每个帖子的评论数](/solution/1200-1299/1241.Number%20of%20Comments%20per%20Post/README.md)  |    |  简单  |  🔒  |
|  [1242](https://leetcode-cn.com/problems/web-crawler-multithreaded)  |  [多线程网页爬虫](/solution/1200-1299/1242.Web%20Crawler%20Multithreaded/README.md)  |  `深度优先搜索`,`广度优先搜索`  |  中等  |  🔒  |
|  [1243](https://leetcode-cn.com/problems/array-transformation)  |  [数组变换](/solution/1200-1299/1243.Array%20Transformation/README.md)  |  `数组`  |  简单  |  🔒  |
|  [1244](https://leetcode-cn.com/problems/design-a-leaderboard)  |  [力扣排行榜](/solution/1200-1299/1244.Design%20A%20Leaderboard/README.md)  |  `排序`,`设计`,`哈希表`  |  中等  |  🔒  |
|  [1245](https://leetcode-cn.com/problems/tree-diameter)  |  [树的直径](/solution/1200-1299/1245.Tree%20Diameter/README.md)  |  `树`,`深度优先搜索`,`广度优先搜索`  |  中等  |  🔒  |
|  [1246](https://leetcode-cn.com/problems/palindrome-removal)  |  [删除回文子数组](/solution/1200-1299/1246.Palindrome%20Removal/README.md)  |  `动态规划`  |  困难  |  🔒  |
|  [1247](https://leetcode-cn.com/problems/minimum-swaps-to-make-strings-equal)  |  [交换字符使得字符串相同](/solution/1200-1299/1247.Minimum%20Swaps%20to%20Make%20Strings%20Equal/README.md)  |  `贪心算法`,`字符串`  |  中等  |    |
|  [1248](https://leetcode-cn.com/problems/count-number-of-nice-subarrays)  |  [统计「优美子数组」](/solution/1200-1299/1248.Count%20Number%20of%20Nice%20Subarrays/README.md)  |  `双指针`  |  中等  |    |
|  [1249](https://leetcode-cn.com/problems/minimum-remove-to-make-valid-parentheses)  |  [移除无效的括号](/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README.md)  |  `栈`,`字符串`  |  中等  |    |
|  [1250](https://leetcode-cn.com/problems/check-if-it-is-a-good-array)  |  [检查「好数组」](/solution/1200-1299/1250.Check%20If%20It%20Is%20a%20Good%20Array/README.md)  |  `数学`  |  困难  |    |
|  [1251](https://leetcode-cn.com/problems/average-selling-price)  |  [平均售价](/solution/1200-1299/1251.Average%20Selling%20Price/README.md)  |    |  简单  |  🔒  |
|  [1252](https://leetcode-cn.com/problems/cells-with-odd-values-in-a-matrix)  |  [奇数值单元格的数目](/solution/1200-1299/1252.Cells%20with%20Odd%20Values%20in%20a%20Matrix/README.md)  |  `数组`  |  简单  |    |
|  [1253](https://leetcode-cn.com/problems/reconstruct-a-2-row-binary-matrix)  |  [重构 2 行二进制矩阵](/solution/1200-1299/1253.Reconstruct%20a%202-Row%20Binary%20Matrix/README.md)  |  `贪心算法`,`数学`  |  中等  |    |
|  [1254](https://leetcode-cn.com/problems/number-of-closed-islands)  |  [统计封闭岛屿的数目](/solution/1200-1299/1254.Number%20of%20Closed%20Islands/README.md)  |  `深度优先搜索`  |  中等  |    |
|  [1255](https://leetcode-cn.com/problems/maximum-score-words-formed-by-letters)  |  [得分最高的单词集合](/solution/1200-1299/1255.Maximum%20Score%20Words%20Formed%20by%20Letters/README.md)  |  `位运算`  |  困难  |    |
|  [1256](https://leetcode-cn.com/problems/encode-number)  |  [加密数字](/solution/1200-1299/1256.Encode%20Number/README.md)  |  `位运算`,`数学`  |  中等  |  🔒  |
|  [1257](https://leetcode-cn.com/problems/smallest-common-region)  |  [最小公共区域](/solution/1200-1299/1257.Smallest%20Common%20Region/README.md)  |  `树`  |  中等  |  🔒  |
|  [1258](https://leetcode-cn.com/problems/synonymous-sentences)  |  [近义词句子](/solution/1200-1299/1258.Synonymous%20Sentences/README.md)  |  `回溯算法`  |  中等  |  🔒  |
|  [1259](https://leetcode-cn.com/problems/handshakes-that-dont-cross)  |  [不相交的握手](/solution/1200-1299/1259.Handshakes%20That%20Don%27t%20Cross/README.md)  |  `数学`,`动态规划`  |  困难  |  🔒  |
|  [1260](https://leetcode-cn.com/problems/shift-2d-grid)  |  [二维网格迁移](/solution/1200-1299/1260.Shift%202D%20Grid/README.md)  |  `数组`  |  简单  |    |
|  [1261](https://leetcode-cn.com/problems/find-elements-in-a-contaminated-binary-tree)  |  [在受污染的二叉树中查找元素](/solution/1200-1299/1261.Find%20Elements%20in%20a%20Contaminated%20Binary%20Tree/README.md)  |  `树`,`哈希表`  |  中等  |    |
|  [1262](https://leetcode-cn.com/problems/greatest-sum-divisible-by-three)  |  [可被三整除的最大和](/solution/1200-1299/1262.Greatest%20Sum%20Divisible%20by%20Three/README.md)  |  `动态规划`  |  中等  |    |
|  [1263](https://leetcode-cn.com/problems/minimum-moves-to-move-a-box-to-their-target-location)  |  [推箱子](/solution/1200-1299/1263.Minimum%20Moves%20to%20Move%20a%20Box%20to%20Their%20Target%20Location/README.md)  |  `广度优先搜索`  |  困难  |    |
|  [1264](https://leetcode-cn.com/problems/page-recommendations)  |  [页面推荐](/solution/1200-1299/1264.Page%20Recommendations/README.md)  |    |  中等  |  🔒  |
|  [1265](https://leetcode-cn.com/problems/print-immutable-linked-list-in-reverse)  |  [逆序打印不可变链表](/solution/1200-1299/1265.Print%20Immutable%20Linked%20List%20in%20Reverse/README.md)  |    |  中等  |  🔒  |
|  [1266](https://leetcode-cn.com/problems/minimum-time-visiting-all-points)  |  [访问所有点的最小时间](/solution/1200-1299/1266.Minimum%20Time%20Visiting%20All%20Points/README.md)  |  `几何`,`数组`  |  简单  |    |
|  [1267](https://leetcode-cn.com/problems/count-servers-that-communicate)  |  [统计参与通信的服务器](/solution/1200-1299/1267.Count%20Servers%20that%20Communicate/README.md)  |  `图`,`数组`  |  中等  |    |
|  [1268](https://leetcode-cn.com/problems/search-suggestions-system)  |  [搜索推荐系统](/solution/1200-1299/1268.Search%20Suggestions%20System/README.md)  |  `字符串`  |  中等  |    |
|  [1269](https://leetcode-cn.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps)  |  [停在原地的方案数](/solution/1200-1299/1269.Number%20of%20Ways%20to%20Stay%20in%20the%20Same%20Place%20After%20Some%20Steps/README.md)  |  `动态规划`  |  困难  |    |
|  [1270](https://leetcode-cn.com/problems/all-people-report-to-the-given-manager)  |  [向公司CEO汇报工作的所有人](/solution/1200-1299/1270.All%20People%20Report%20to%20the%20Given%20Manager/README.md)  |    |  中等  |  🔒  |
|  [1271](https://leetcode-cn.com/problems/hexspeak)  |  [十六进制魔术数字](/solution/1200-1299/1271.Hexspeak/README.md)  |  `数学`,`字符串`  |  简单  |  🔒  |
|  [1272](https://leetcode-cn.com/problems/remove-interval)  |  [删除区间](/solution/1200-1299/1272.Remove%20Interval/README.md)  |  `数学`  |  中等  |  🔒  |
|  [1273](https://leetcode-cn.com/problems/delete-tree-nodes)  |  [删除树节点](/solution/1200-1299/1273.Delete%20Tree%20Nodes/README.md)  |  `深度优先搜索`,`动态规划`  |  中等  |  🔒  |
|  [1274](https://leetcode-cn.com/problems/number-of-ships-in-a-rectangle)  |  [矩形内船只的数目](/solution/1200-1299/1274.Number%20of%20Ships%20in%20a%20Rectangle/README.md)  |  `分治算法`  |  困难  |  🔒  |
|  [1275](https://leetcode-cn.com/problems/find-winner-on-a-tic-tac-toe-game)  |  [找出井字棋的获胜者](/solution/1200-1299/1275.Find%20Winner%20on%20a%20Tic%20Tac%20Toe%20Game/README.md)  |  `数组`  |  简单  |    |
|  [1276](https://leetcode-cn.com/problems/number-of-burgers-with-no-waste-of-ingredients)  |  [不浪费原料的汉堡制作方案](/solution/1200-1299/1276.Number%20of%20Burgers%20with%20No%20Waste%20of%20Ingredients/README.md)  |  `贪心算法`,`数学`  |  中等  |    |
|  [1277](https://leetcode-cn.com/problems/count-square-submatrices-with-all-ones)  |  [统计全为 1 的正方形子矩阵](/solution/1200-1299/1277.Count%20Square%20Submatrices%20with%20All%20Ones/README.md)  |  `数组`,`动态规划`  |  中等  |    |
|  [1278](https://leetcode-cn.com/problems/palindrome-partitioning-iii)  |  [分割回文串 III](/solution/1200-1299/1278.Palindrome%20Partitioning%20III/README.md)  |  `动态规划`  |  困难  |    |
|  [1279](https://leetcode-cn.com/problems/traffic-light-controlled-intersection)  |  [红绿灯路口](/solution/1200-1299/1279.Traffic%20Light%20Controlled%20Intersection/README.md)  |    |  简单  |  🔒  |
|  [1280](https://leetcode-cn.com/problems/students-and-examinations)  |  [学生们参加各科测试的次数](/solution/1200-1299/1280.Students%20and%20Examinations/README.md)  |    |  简单  |  🔒  |
|  [1281](https://leetcode-cn.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer)  |  [整数的各位积和之差](/solution/1200-1299/1281.Subtract%20the%20Product%20and%20Sum%20of%20Digits%20of%20an%20Integer/README.md)  |  `数学`  |  简单  |    |
|  [1282](https://leetcode-cn.com/problems/group-the-people-given-the-group-size-they-belong-to)  |  [用户分组](/solution/1200-1299/1282.Group%20the%20People%20Given%20the%20Group%20Size%20They%20Belong%20To/README.md)  |  `贪心算法`  |  中等  |    |
|  [1283](https://leetcode-cn.com/problems/find-the-smallest-divisor-given-a-threshold)  |  [使结果不超过阈值的最小除数](/solution/1200-1299/1283.Find%20the%20Smallest%20Divisor%20Given%20a%20Threshold/README.md)  |  `二分查找`  |  中等  |    |
|  [1284](https://leetcode-cn.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix)  |  [转化为全零矩阵的最少反转次数](/solution/1200-1299/1284.Minimum%20Number%20of%20Flips%20to%20Convert%20Binary%20Matrix%20to%20Zero%20Matrix/README.md)  |  `广度优先搜索`  |  困难  |    |
|  [1285](https://leetcode-cn.com/problems/find-the-start-and-end-number-of-continuous-ranges)  |  [找到连续区间的开始和结束数字](/solution/1200-1299/1285.Find%20the%20Start%20and%20End%20Number%20of%20Continuous%20Ranges/README.md)  |    |  中等  |  🔒  |
|  [1286](https://leetcode-cn.com/problems/iterator-for-combination)  |  [字母组合迭代器](/solution/1200-1299/1286.Iterator%20for%20Combination/README.md)  |  `设计`,`回溯算法`  |  中等  |    |
|  [1287](https://leetcode-cn.com/problems/element-appearing-more-than-25-in-sorted-array)  |  [有序数组中出现次数超过25%的元素](/solution/1200-1299/1287.Element%20Appearing%20More%20Than%2025%25%20In%20Sorted%20Array/README.md)  |  `数组`  |  简单  |    |
|  [1288](https://leetcode-cn.com/problems/remove-covered-intervals)  |  [删除被覆盖区间](/solution/1200-1299/1288.Remove%20Covered%20Intervals/README.md)  |  `贪心算法`,`排序`  |  中等  |    |
|  [1289](https://leetcode-cn.com/problems/minimum-falling-path-sum-ii)  |  [下降路径最小和  II](/solution/1200-1299/1289.Minimum%20Falling%20Path%20Sum%20II/README.md)  |  `动态规划`  |  困难  |    |
|  [1290](https://leetcode-cn.com/problems/convert-binary-number-in-a-linked-list-to-integer)  |  [二进制链表转整数](/solution/1200-1299/1290.Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/README.md)  |  `位运算`,`链表`  |  简单  |    |
|  [1291](https://leetcode-cn.com/problems/sequential-digits)  |  [顺次数](/solution/1200-1299/1291.Sequential%20Digits/README.md)  |  `回溯算法`  |  中等  |    |
|  [1292](https://leetcode-cn.com/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold)  |  [元素和小于等于阈值的正方形的最大边长](/solution/1200-1299/1292.Maximum%20Side%20Length%20of%20a%20Square%20with%20Sum%20Less%20than%20or%20Equal%20to%20Threshold/README.md)  |  `数组`,`二分查找`  |  中等  |    |
|  [1293](https://leetcode-cn.com/problems/shortest-path-in-a-grid-with-obstacles-elimination)  |  [网格中的最短路径](/solution/1200-1299/1293.Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination/README.md)  |  `广度优先搜索`  |  困难  |    |
|  [1294](https://leetcode-cn.com/problems/weather-type-in-each-country)  |  [不同国家的天气类型](/solution/1200-1299/1294.Weather%20Type%20in%20Each%20Country/README.md)  |    |  简单  |  🔒  |
|  [1295](https://leetcode-cn.com/problems/find-numbers-with-even-number-of-digits)  |  [统计位数为偶数的数字](/solution/1200-1299/1295.Find%20Numbers%20with%20Even%20Number%20of%20Digits/README.md)  |  `数组`  |  简单  |    |
|  [1296](https://leetcode-cn.com/problems/divide-array-in-sets-of-k-consecutive-numbers)  |  [划分数组为连续数字的集合](/solution/1200-1299/1296.Divide%20Array%20in%20Sets%20of%20K%20Consecutive%20Numbers/README.md)  |  `贪心算法`,`数组`  |  中等  |    |
|  [1297](https://leetcode-cn.com/problems/maximum-number-of-occurrences-of-a-substring)  |  [子串的最大出现次数](/solution/1200-1299/1297.Maximum%20Number%20of%20Occurrences%20of%20a%20Substring/README.md)  |  `位运算`,`字符串`  |  中等  |    |
|  [1298](https://leetcode-cn.com/problems/maximum-candies-you-can-get-from-boxes)  |  [你能从盒子里获得的最大糖果数](/solution/1200-1299/1298.Maximum%20Candies%20You%20Can%20Get%20from%20Boxes/README.md)  |  `广度优先搜索`  |  困难  |    |
|  [1299](https://leetcode-cn.com/problems/replace-elements-with-greatest-element-on-right-side)  |  [将每个元素替换为右侧最大元素](/solution/1200-1299/1299.Replace%20Elements%20with%20Greatest%20Element%20on%20Right%20Side/README.md)  |  `数组`  |  简单  |    |
|  [1300](https://leetcode-cn.com/problems/sum-of-mutated-array-closest-to-target)  |  [转变数组后最接近目标值的数组和](/solution/1300-1399/1300.Sum%20of%20Mutated%20Array%20Closest%20to%20Target/README.md)  |  `数组`,`二分查找`  |  中等  |    |
|  [1301](https://leetcode-cn.com/problems/number-of-paths-with-max-score)  |  [最大得分的路径数目](/solution/1300-1399/1301.Number%20of%20Paths%20with%20Max%20Score/README.md)  |  `动态规划`  |  困难  |    |
|  [1302](https://leetcode-cn.com/problems/deepest-leaves-sum)  |  [层数最深叶子节点的和](/solution/1300-1399/1302.Deepest%20Leaves%20Sum/README.md)  |  `树`,`深度优先搜索`  |  中等  |    |
|  [1303](https://leetcode-cn.com/problems/find-the-team-size)  |  [求团队人数](/solution/1300-1399/1303.Find%20the%20Team%20Size/README.md)  |    |  简单  |  🔒  |
|  [1304](https://leetcode-cn.com/problems/find-n-unique-integers-sum-up-to-zero)  |  [和为零的N个唯一整数](/solution/1300-1399/1304.Find%20N%20Unique%20Integers%20Sum%20up%20to%20Zero/README.md)  |  `数组`  |  简单  |    |
|  [1305](https://leetcode-cn.com/problems/all-elements-in-two-binary-search-trees)  |  [两棵二叉搜索树中的所有元素](/solution/1300-1399/1305.All%20Elements%20in%20Two%20Binary%20Search%20Trees/README.md)  |  `排序`,`树`  |  中等  |    |
|  [1306](https://leetcode-cn.com/problems/jump-game-iii)  |  [跳跃游戏 III](/solution/1300-1399/1306.Jump%20Game%20III/README.md)  |  `深度优先搜索`,`广度优先搜索`,`递归`  |  中等  |    |
|  [1307](https://leetcode-cn.com/problems/verbal-arithmetic-puzzle)  |  [口算难题](/solution/1300-1399/1307.Verbal%20Arithmetic%20Puzzle/README.md)  |  `数学`,`回溯算法`  |  困难  |    |
|  [1308](https://leetcode-cn.com/problems/running-total-for-different-genders)  |  [不同性别每日分数总计](/solution/1300-1399/1308.Running%20Total%20for%20Different%20Genders/README.md)  |    |  中等  |  🔒  |
|  [1309](https://leetcode-cn.com/problems/decrypt-string-from-alphabet-to-integer-mapping)  |  [解码字母到整数映射](/solution/1300-1399/1309.Decrypt%20String%20from%20Alphabet%20to%20Integer%20Mapping/README.md)  |  `字符串`  |  简单  |    |
|  [1310](https://leetcode-cn.com/problems/xor-queries-of-a-subarray)  |  [子数组异或查询](/solution/1300-1399/1310.XOR%20Queries%20of%20a%20Subarray/README.md)  |  `位运算`  |  中等  |    |
|  [1311](https://leetcode-cn.com/problems/get-watched-videos-by-your-friends)  |  [获取你好友已观看的视频](/solution/1300-1399/1311.Get%20Watched%20Videos%20by%20Your%20Friends/README.md)  |  `广度优先搜索`,`哈希表`,`字符串`  |  中等  |    |
|  [1312](https://leetcode-cn.com/problems/minimum-insertion-steps-to-make-a-string-palindrome)  |  [让字符串成为回文串的最少插入次数](/solution/1300-1399/1312.Minimum%20Insertion%20Steps%20to%20Make%20a%20String%20Palindrome/README.md)  |  `动态规划`  |  困难  |    |
|  [1313](https://leetcode-cn.com/problems/decompress-run-length-encoded-list)  |  [解压缩编码列表](/solution/1300-1399/1313.Decompress%20Run-Length%20Encoded%20List/README.md)  |  `数组`  |  简单  |    |
|  [1314](https://leetcode-cn.com/problems/matrix-block-sum)  |  [矩阵区域和](/solution/1300-1399/1314.Matrix%20Block%20Sum/README.md)  |  `动态规划`  |  中等  |    |
|  [1315](https://leetcode-cn.com/problems/sum-of-nodes-with-even-valued-grandparent)  |  [祖父节点值为偶数的节点和](/solution/1300-1399/1315.Sum%20of%20Nodes%20with%20Even-Valued%20Grandparent/README.md)  |  `树`,`深度优先搜索`  |  中等  |    |
|  [1316](https://leetcode-cn.com/problems/distinct-echo-substrings)  |  [不同的循环子字符串](/solution/1300-1399/1316.Distinct%20Echo%20Substrings/README.md)  |  `字符串`  |  困难  |    |
|  [1317](https://leetcode-cn.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers)  |  [将整数转换为两个无零整数的和](/solution/1300-1399/1317.Convert%20Integer%20to%20the%20Sum%20of%20Two%20No-Zero%20Integers/README.md)  |  `数学`  |  简单  |    |
|  [1318](https://leetcode-cn.com/problems/minimum-flips-to-make-a-or-b-equal-to-c)  |  [或运算的最小翻转次数](/solution/1300-1399/1318.Minimum%20Flips%20to%20Make%20a%20OR%20b%20Equal%20to%20c/README.md)  |  `位运算`  |  中等  |    |
|  [1319](https://leetcode-cn.com/problems/number-of-operations-to-make-network-connected)  |  [连通网络的操作次数](/solution/1300-1399/1319.Number%20of%20Operations%20to%20Make%20Network%20Connected/README.md)  |  `深度优先搜索`,`广度优先搜索`,`并查集`  |  中等  |    |
|  [1320](https://leetcode-cn.com/problems/minimum-distance-to-type-a-word-using-two-fingers)  |  [二指输入的的最小距离](/solution/1300-1399/1320.Minimum%20Distance%20to%20Type%20a%20Word%20Using%20Two%20Fingers/README.md)  |  `动态规划`  |  困难  |    |
|  [1321](https://leetcode-cn.com/problems/restaurant-growth)  |  [餐馆营业额变化增长](/solution/1300-1399/1321.Restaurant%20Growth/README.md)  |    |  中等  |  🔒  |
|  [1322](https://leetcode-cn.com/problems/ads-performance)  |  [广告效果](/solution/1300-1399/1322.Ads%20Performance/README.md)  |    |  简单  |  🔒  |
|  [1323](https://leetcode-cn.com/problems/maximum-69-number)  |  [6 和 9 组成的最大数字](/solution/1300-1399/1323.Maximum%2069%20Number/README.md)  |  `数学`  |  简单  |    |
|  [1324](https://leetcode-cn.com/problems/print-words-vertically)  |  [竖直打印单词](/solution/1300-1399/1324.Print%20Words%20Vertically/README.md)  |  `字符串`  |  中等  |    |
|  [1325](https://leetcode-cn.com/problems/delete-leaves-with-a-given-value)  |  [删除给定值的叶子节点](/solution/1300-1399/1325.Delete%20Leaves%20With%20a%20Given%20Value/README.md)  |  `树`  |  中等  |    |
|  [1326](https://leetcode-cn.com/problems/minimum-number-of-taps-to-open-to-water-a-garden)  |  [灌溉花园的最少水龙头数目](/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README.md)  |  `贪心算法`,`动态规划`  |  困难  |    |
|  [1327](https://leetcode-cn.com/problems/list-the-products-ordered-in-a-period)  |  [列出指定时间段内所有的下单产品](/solution/1300-1399/1327.List%20the%20Products%20Ordered%20in%20a%20Period/README.md)  |    |  简单  |  🔒  |
|  [1328](https://leetcode-cn.com/problems/break-a-palindrome)  |  [破坏回文串](/solution/1300-1399/1328.Break%20a%20Palindrome/README.md)  |  `字符串`  |  中等  |    |
|  [1329](https://leetcode-cn.com/problems/sort-the-matrix-diagonally)  |  [将矩阵按对角线排序](/solution/1300-1399/1329.Sort%20the%20Matrix%20Diagonally/README.md)  |  `排序`,`数组`  |  中等  |    |
|  [1330](https://leetcode-cn.com/problems/reverse-subarray-to-maximize-array-value)  |  [翻转子数组得到最大的数组值](/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README.md)  |  `数组`,`数学`  |  困难  |    |
|  [1331](https://leetcode-cn.com/problems/rank-transform-of-an-array)  |  [数组序号转换](/solution/1300-1399/1331.Rank%20Transform%20of%20an%20Array/README.md)  |  `数组`  |  简单  |    |
|  [1332](https://leetcode-cn.com/problems/remove-palindromic-subsequences)  |  [删除回文子序列](/solution/1300-1399/1332.Remove%20Palindromic%20Subsequences/README.md)  |  `字符串`  |  简单  |    |
|  [1333](https://leetcode-cn.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance)  |  [餐厅过滤器](/solution/1300-1399/1333.Filter%20Restaurants%20by%20Vegan-Friendly%2C%20Price%20and%20Distance/README.md)  |  `排序`,`数组`  |  中等  |    |
|  [1334](https://leetcode-cn.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance)  |  [阈值距离内邻居最少的城市](/solution/1300-1399/1334.Find%20the%20City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance/README.md)  |  `图`  |  中等  |    |
|  [1335](https://leetcode-cn.com/problems/minimum-difficulty-of-a-job-schedule)  |  [工作计划的最低难度](/solution/1300-1399/1335.Minimum%20Difficulty%20of%20a%20Job%20Schedule/README.md)  |  `动态规划`  |  困难  |    |
|  [1336](https://leetcode-cn.com/problems/number-of-transactions-per-visit)  |  [每次访问的交易次数](/solution/1300-1399/1336.Number%20of%20Transactions%20per%20Visit/README.md)  |    |  困难  |  🔒  |
|  [1337](https://leetcode-cn.com/problems/the-k-weakest-rows-in-a-matrix)  |  [矩阵中战斗力最弱的 K 行](/solution/1300-1399/1337.The%20K%20Weakest%20Rows%20in%20a%20Matrix/README.md)  |  `数组`,`二分查找`  |  简单  |    |
|  [1338](https://leetcode-cn.com/problems/reduce-array-size-to-the-half)  |  [数组大小减半](/solution/1300-1399/1338.Reduce%20Array%20Size%20to%20The%20Half/README.md)  |  `贪心算法`,`数组`  |  中等  |    |
|  [1339](https://leetcode-cn.com/problems/maximum-product-of-splitted-binary-tree)  |  [分裂二叉树的最大乘积](/solution/1300-1399/1339.Maximum%20Product%20of%20Splitted%20Binary%20Tree/README.md)  |  `树`,`动态规划`  |  中等  |    |
|  [1340](https://leetcode-cn.com/problems/jump-game-v)  |  [跳跃游戏 V](/solution/1300-1399/1340.Jump%20Game%20V/README.md)  |  `动态规划`  |  困难  |    |
|  [1341](https://leetcode-cn.com/problems/movie-rating)  |  [电影评分](/solution/1300-1399/1341.Movie%20Rating/README.md)  |    |  中等  |  🔒  |
|  [1342](https://leetcode-cn.com/problems/number-of-steps-to-reduce-a-number-to-zero)  |  [将数字变成 0 的操作次数](/solution/1300-1399/1342.Number%20of%20Steps%20to%20Reduce%20a%20Number%20to%20Zero/README.md)  |  `位运算`  |  简单  |    |
|  [1343](https://leetcode-cn.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold)  |  [大小为 K 且平均值大于等于阈值的子数组数目](/solution/1300-1399/1343.Number%20of%20Sub-arrays%20of%20Size%20K%20and%20Average%20Greater%20than%20or%20Equal%20to%20Threshold/README.md)  |  `数组`  |  中等  |    |
|  [1344](https://leetcode-cn.com/problems/angle-between-hands-of-a-clock)  |  [时钟指针的夹角](/solution/1300-1399/1344.Angle%20Between%20Hands%20of%20a%20Clock/README.md)  |  `数学`  |  中等  |    |
|  [1345](https://leetcode-cn.com/problems/jump-game-iv)  |  [跳跃游戏 IV](/solution/1300-1399/1345.Jump%20Game%20IV/README.md)  |  `广度优先搜索`  |  困难  |    |
|  [1346](https://leetcode-cn.com/problems/check-if-n-and-its-double-exist)  |  [检查整数及其两倍数是否存在](/solution/1300-1399/1346.Check%20If%20N%20and%20Its%20Double%20Exist/README.md)  |  `数组`  |  简单  |    |
|  [1347](https://leetcode-cn.com/problems/minimum-number-of-steps-to-make-two-strings-anagram)  |  [制造字母异位词的最小步骤数](/solution/1300-1399/1347.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram/README.md)  |  `字符串`  |  中等  |    |
|  [1348](https://leetcode-cn.com/problems/tweet-counts-per-frequency)  |  [推文计数](/solution/1300-1399/1348.Tweet%20Counts%20Per%20Frequency/README.md)  |  `设计`  |  中等  |    |
|  [1349](https://leetcode-cn.com/problems/maximum-students-taking-exam)  |  [参加考试的最大学生数](/solution/1300-1399/1349.Maximum%20Students%20Taking%20Exam/README.md)  |  `动态规划`  |  困难  |    |
|  [1350](https://leetcode-cn.com/problems/students-with-invalid-departments)  |  [院系无效的学生](/solution/1300-1399/1350.Students%20With%20Invalid%20Departments/README.md)  |    |  简单  |  🔒  |
|  [1351](https://leetcode-cn.com/problems/count-negative-numbers-in-a-sorted-matrix)  |  [统计有序矩阵中的负数](/solution/1300-1399/1351.Count%20Negative%20Numbers%20in%20a%20Sorted%20Matrix/README.md)  |  `数组`,`二分查找`  |  简单  |    |
|  [1352](https://leetcode-cn.com/problems/product-of-the-last-k-numbers)  |  [最后 K 个数的乘积](/solution/1300-1399/1352.Product%20of%20the%20Last%20K%20Numbers/README.md)  |  `设计`,`数组`  |  中等  |    |
|  [1353](https://leetcode-cn.com/problems/maximum-number-of-events-that-can-be-attended)  |  [最多可以参加的会议数目](/solution/1300-1399/1353.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended/README.md)  |  `贪心算法`,`排序`,`线段树`  |  中等  |    |
|  [1354](https://leetcode-cn.com/problems/construct-target-array-with-multiple-sums)  |  [多次求和构造目标数组](/solution/1300-1399/1354.Construct%20Target%20Array%20With%20Multiple%20Sums/README.md)  |  `贪心算法`  |  困难  |    |
|  [1355](https://leetcode-cn.com/problems/activity-participants)  |  [活动参与者](/solution/1300-1399/1355.Activity%20Participants/README.md)  |    |  中等  |  🔒  |
|  [1356](https://leetcode-cn.com/problems/sort-integers-by-the-number-of-1-bits)  |  [根据数字二进制下 1 的数目排序](/solution/1300-1399/1356.Sort%20Integers%20by%20The%20Number%20of%201%20Bits/README.md)  |  `排序`,`位运算`  |  简单  |    |
|  [1357](https://leetcode-cn.com/problems/apply-discount-every-n-orders)  |  [每隔 n 个顾客打折](/solution/1300-1399/1357.Apply%20Discount%20Every%20n%20Orders/README.md)  |  `设计`  |  中等  |    |
|  [1358](https://leetcode-cn.com/problems/number-of-substrings-containing-all-three-characters)  |  [包含所有三种字符的子字符串数目](/solution/1300-1399/1358.Number%20of%20Substrings%20Containing%20All%20Three%20Characters/README.md)  |  `字符串`  |  中等  |    |
|  [1359](https://leetcode-cn.com/problems/count-all-valid-pickup-and-delivery-options)  |  [有效的快递序列数目](/solution/1300-1399/1359.Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/README.md)  |  `数学`,`动态规划`  |  困难  |    |
|  [1360](https://leetcode-cn.com/problems/number-of-days-between-two-dates)  |  [日期之间隔几天](/solution/1300-1399/1360.Number%20of%20Days%20Between%20Two%20Dates/README.md)  |    |  简单  |    |
|  [1361](https://leetcode-cn.com/problems/validate-binary-tree-nodes)  |  [验证二叉树](/solution/1300-1399/1361.Validate%20Binary%20Tree%20Nodes/README.md)  |  `图`  |  中等  |    |
|  [1362](https://leetcode-cn.com/problems/closest-divisors)  |  [最接近的因数](/solution/1300-1399/1362.Closest%20Divisors/README.md)  |  `数学`  |  中等  |    |
|  [1363](https://leetcode-cn.com/problems/largest-multiple-of-three)  |  [形成三的最大倍数](/solution/1300-1399/1363.Largest%20Multiple%20of%20Three/README.md)  |  `数学`,`动态规划`  |  困难  |    |
|  [1364](https://leetcode-cn.com/problems/number-of-trusted-contacts-of-a-customer)  |  [顾客的可信联系人数量](/solution/1300-1399/1364.Number%20of%20Trusted%20Contacts%20of%20a%20Customer/README.md)  |    |  中等  |  🔒  |
|  [1365](https://leetcode-cn.com/problems/how-many-numbers-are-smaller-than-the-current-number)  |  [有多少小于当前数字的数字](/solution/1300-1399/1365.How%20Many%20Numbers%20Are%20Smaller%20Than%20the%20Current%20Number/README.md)  |  `数组`,`哈希表`  |  简单  |    |
|  [1366](https://leetcode-cn.com/problems/rank-teams-by-votes)  |  [通过投票对团队排名](/solution/1300-1399/1366.Rank%20Teams%20by%20Votes/README.md)  |  `排序`,`数组`  |  中等  |    |
|  [1367](https://leetcode-cn.com/problems/linked-list-in-binary-tree)  |  [二叉树中的列表](/solution/1300-1399/1367.Linked%20List%20in%20Binary%20Tree/README.md)  |  `树`,`链表`,`动态规划`  |  中等  |    |
|  [1368](https://leetcode-cn.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid)  |  [使网格图至少有一条有效路径的最小代价](/solution/1300-1399/1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/README.md)  |  `广度优先搜索`  |  困难  |    |
|  [1369](https://leetcode-cn.com/problems/get-the-second-most-recent-activity)  |  [获取最近第二次的活动](/solution/1300-1399/1369.Get%20the%20Second%20Most%20Recent%20Activity/README.md)  |    |  困难  |  🔒  |
|  [1370](https://leetcode-cn.com/problems/increasing-decreasing-string)  |  [上升下降字符串](/solution/1300-1399/1370.Increasing%20Decreasing%20String/README.md)  |  `排序`,`字符串`  |  简单  |    |
|  [1371](https://leetcode-cn.com/problems/find-the-longest-substring-containing-vowels-in-even-counts)  |  [每个元音包含偶数次的最长子字符串](/solution/1300-1399/1371.Find%20the%20Longest%20Substring%20Containing%20Vowels%20in%20Even%20Counts/README.md)  |  `字符串`  |  中等  |    |
|  [1372](https://leetcode-cn.com/problems/longest-zigzag-path-in-a-binary-tree)  |  [二叉树中的最长交错路径](/solution/1300-1399/1372.Longest%20ZigZag%20Path%20in%20a%20Binary%20Tree/README.md)  |  `树`,`动态规划`  |  中等  |    |
|  [1373](https://leetcode-cn.com/problems/maximum-sum-bst-in-binary-tree)  |  [二叉搜索子树的最大键值和](/solution/1300-1399/1373.Maximum%20Sum%20BST%20in%20Binary%20Tree/README.md)  |  `二叉搜索树`,`动态规划`  |  困难  |    |
|  [1374](https://leetcode-cn.com/problems/generate-a-string-with-characters-that-have-odd-counts)  |  [生成每种字符都是奇数个的字符串](/solution/1300-1399/1374.Generate%20a%20String%20With%20Characters%20That%20Have%20Odd%20Counts/README.md)  |  `字符串`  |  简单  |    |
|  [1375](https://leetcode-cn.com/problems/bulb-switcher-iii)  |  [灯泡开关 III](/solution/1300-1399/1375.Bulb%20Switcher%20III/README.md)  |  `数组`  |  中等  |    |
|  [1376](https://leetcode-cn.com/problems/time-needed-to-inform-all-employees)  |  [通知所有员工所需的时间](/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README.md)  |  `深度优先搜索`  |  中等  |    |
|  [1377](https://leetcode-cn.com/problems/frog-position-after-t-seconds)  |  [T 秒后青蛙的位置](/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README.md)  |  `深度优先搜索`  |  困难  |    |
|  [1378](https://leetcode-cn.com/problems/replace-employee-id-with-the-unique-identifier)  |  [使用唯一标识码替换员工ID](/solution/1300-1399/1378.Replace%20Employee%20ID%20With%20The%20Unique%20Identifier/README.md)  |    |  简单  |  🔒  |
|  [1379](https://leetcode-cn.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree)  |  [找出克隆二叉树中的相同节点](/solution/1300-1399/1379.Find%20a%20Corresponding%20Node%20of%20a%20Binary%20Tree%20in%20a%20Clone%20of%20That%20Tree/README.md)  |  `树`,`深度优先搜索`,`广度优先搜索`,`递归`  |  中等  |    |
|  [1380](https://leetcode-cn.com/problems/lucky-numbers-in-a-matrix)  |  [矩阵中的幸运数](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README.md)  |  `数组`  |  简单  |    |
|  [1381](https://leetcode-cn.com/problems/design-a-stack-with-increment-operation)  |  [设计一个支持增量操作的栈](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README.md)  |  `栈`,`设计`  |  中等  |    |
|  [1382](https://leetcode-cn.com/problems/balance-a-binary-search-tree)  |  [将二叉搜索树变平衡](/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README.md)  |  `二叉搜索树`  |  中等  |    |
|  [1383](https://leetcode-cn.com/problems/maximum-performance-of-a-team)  |  [最大的团队表现值](/solution/1300-1399/1383.Maximum%20Performance%20of%20a%20Team/README.md)  |  `贪心算法`,`排序`  |  困难  |    |
|  [1384](https://leetcode-cn.com/problems/total-sales-amount-by-year)  |  [按年度列出销售总额](/solution/1300-1399/1384.Total%20Sales%20Amount%20by%20Year/README.md)  |    |  困难  |  🔒  |
|  [1385](https://leetcode-cn.com/problems/find-the-distance-value-between-two-arrays)  |  [两个数组间的距离值](/solution/1300-1399/1385.Find%20the%20Distance%20Value%20Between%20Two%20Arrays/README.md)  |  `数组`  |  简单  |    |
|  [1386](https://leetcode-cn.com/problems/cinema-seat-allocation)  |  [安排电影院座位](/solution/1300-1399/1386.Cinema%20Seat%20Allocation/README.md)  |  `贪心算法`,`数组`  |  中等  |    |
|  [1387](https://leetcode-cn.com/problems/sort-integers-by-the-power-value)  |  [将整数按权重排序](/solution/1300-1399/1387.Sort%20Integers%20by%20The%20Power%20Value/README.md)  |  `排序`,`图`  |  中等  |    |
|  [1388](https://leetcode-cn.com/problems/pizza-with-3n-slices)  |  [3n 块披萨](/solution/1300-1399/1388.Pizza%20With%203n%20Slices/README.md)  |  `动态规划`  |  困难  |    |
|  [1389](https://leetcode-cn.com/problems/create-target-array-in-the-given-order)  |  [按既定顺序创建目标数组](/solution/1300-1399/1389.Create%20Target%20Array%20in%20the%20Given%20Order/README.md)  |  `数组`  |  简单  |    |
|  [1390](https://leetcode-cn.com/problems/four-divisors)  |  [四因数](/solution/1300-1399/1390.Four%20Divisors/README.md)  |  `数学`  |  中等  |    |
|  [1391](https://leetcode-cn.com/problems/check-if-there-is-a-valid-path-in-a-grid)  |  [检查网格中是否存在有效路径](/solution/1300-1399/1391.Check%20if%20There%20is%20a%20Valid%20Path%20in%20a%20Grid/README.md)  |  `深度优先搜索`,`广度优先搜索`  |  中等  |    |
|  [1392](https://leetcode-cn.com/problems/longest-happy-prefix)  |  [最长快乐前缀](/solution/1300-1399/1392.Longest%20Happy%20Prefix/README.md)  |  `字符串`  |  困难  |    |
|  [1393](https://leetcode-cn.com/problems/capital-gainloss)  |  [股票的资本损益](/solution/1300-1399/1393.Capital%20GainLoss/README.md)  |    |  中等  |  🔒  |
|  [1394](https://leetcode-cn.com/problems/find-lucky-integer-in-an-array)  |  [找出数组中的幸运数](/solution/1300-1399/1394.Find%20Lucky%20Integer%20in%20an%20Array/README.md)  |  `数组`  |  简单  |    |
|  [1395](https://leetcode-cn.com/problems/count-number-of-teams)  |  [统计作战单位数](/solution/1300-1399/1395.Count%20Number%20of%20Teams/README.md)  |  `数组`  |  中等  |    |
|  [1396](https://leetcode-cn.com/problems/design-underground-system)  |  [设计地铁系统](/solution/1300-1399/1396.Design%20Underground%20System/README.md)  |  `设计`  |  中等  |    |
|  [1397](https://leetcode-cn.com/problems/find-all-good-strings)  |  [找到所有好字符串](/solution/1300-1399/1397.Find%20All%20Good%20Strings/README.md)  |  `动态规划`  |  困难  |    |
|  [1398](https://leetcode-cn.com/problems/customers-who-bought-products-a-and-b-but-not-c)  |  [购买了产品 A 和产品 B 却没有购买产品 C 的顾客](/solution/1300-1399/1398.Customers%20Who%20Bought%20Products%20A%20and%20B%20but%20Not%20C/README.md)  |    |  中等  |  🔒  |
|  [1399](https://leetcode-cn.com/problems/count-largest-group)  |  [统计最大组的数目](/solution/1300-1399/1399.Count%20Largest%20Group/README.md)  |  `数组`  |  简单  |    |
|  [1400](https://leetcode-cn.com/problems/construct-k-palindrome-strings)  |  [构造 K 个回文字符串](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README.md)  |  `贪心算法`  |  中等  |    |
|  [1401](https://leetcode-cn.com/problems/circle-and-rectangle-overlapping)  |  [圆和矩形是否有重叠](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README.md)  |  `几何`  |  中等  |    |
|  [1402](https://leetcode-cn.com/problems/reducing-dishes)  |  [做菜顺序](/solution/1400-1499/1402.Reducing%20Dishes/README.md)  |  `动态规划`  |  困难  |    |
|  [1403](https://leetcode-cn.com/problems/minimum-subsequence-in-non-increasing-order)  |  [非递增顺序的最小子序列](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README.md)  |  `贪心算法`,`排序`  |  简单  |    |
|  [1404](https://leetcode-cn.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one)  |  [将二进制表示减到 1 的步骤数](/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README.md)  |  `位运算`,`字符串`  |  中等  |    |
|  [1405](https://leetcode-cn.com/problems/longest-happy-string)  |  [最长快乐字符串](/solution/1400-1499/1405.Longest%20Happy%20String/README.md)  |  `贪心算法`,`动态规划`  |  中等  |    |
|  [1406](https://leetcode-cn.com/problems/stone-game-iii)  |  [石子游戏 III](/solution/1400-1499/1406.Stone%20Game%20III/README.md)  |  `动态规划`  |  困难  |    |
|  [1407](https://leetcode-cn.com/problems/top-travellers)  |  [排名靠前的旅行者](/solution/1400-1499/1407.Top%20Travellers/README.md)  |    |  简单  |  🔒  |
|  [1408](https://leetcode-cn.com/problems/string-matching-in-an-array)  |  [数组中的字符串匹配](/solution/1400-1499/1408.String%20Matching%20in%20an%20Array/README.md)  |  `字符串`  |  简单  |    |
|  [1409](https://leetcode-cn.com/problems/queries-on-a-permutation-with-key)  |  [查询带键的排列](/solution/1400-1499/1409.Queries%20on%20a%20Permutation%20With%20Key/README.md)  |  `数组`  |  中等  |    |
|  [1410](https://leetcode-cn.com/problems/html-entity-parser)  |  [HTML 实体解析器](/solution/1400-1499/1410.HTML%20Entity%20Parser/README.md)  |  `栈`,`字符串`  |  中等  |    |
|  [1411](https://leetcode-cn.com/problems/number-of-ways-to-paint-n-3-grid)  |  [给 N x 3 网格图涂色的方案数](/solution/1400-1499/1411.Number%20of%20Ways%20to%20Paint%20N%20%C3%97%203%20Grid/README.md)  |  `动态规划`  |  困难  |    |
|  [1412](https://leetcode-cn.com/problems/find-the-quiet-students-in-all-exams)  |  [查找成绩处于中游的学生](/solution/1400-1499/1412.Find%20the%20Quiet%20Students%20in%20All%20Exams/README.md)  |    |  困难  |  🔒  |
|  [1413](https://leetcode-cn.com/problems/minimum-value-to-get-positive-step-by-step-sum)  |  [逐步求和得到正数的最小值](/solution/1400-1499/1413.Minimum%20Value%20to%20Get%20Positive%20Step%20by%20Step%20Sum/README.md)  |  `数组`  |  简单  |    |
|  [1414](https://leetcode-cn.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k)  |  [和为 K 的最少斐波那契数字数目](/solution/1400-1499/1414.Find%20the%20Minimum%20Number%20of%20Fibonacci%20Numbers%20Whose%20Sum%20Is%20K/README.md)  |  `贪心算法`,`数组`  |  中等  |    |
|  [1415](https://leetcode-cn.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n)  |  [长度为 n 的开心字符串中字典序第 k 小的字符串](/solution/1400-1499/1415.The%20k-th%20Lexicographical%20String%20of%20All%20Happy%20Strings%20of%20Length%20n/README.md)  |  `回溯算法`  |  中等  |    |
|  [1416](https://leetcode-cn.com/problems/restore-the-array)  |  [恢复数组](/solution/1400-1499/1416.Restore%20The%20Array/README.md)  |  `动态规划`  |  困难  |    |
|  [1417](https://leetcode-cn.com/problems/reformat-the-string)  |  [重新格式化字符串](/solution/1400-1499/1417.Reformat%20The%20String/README.md)  |  `字符串`  |  简单  |    |
|  [1418](https://leetcode-cn.com/problems/display-table-of-food-orders-in-a-restaurant)  |  [点菜展示表](/solution/1400-1499/1418.Display%20Table%20of%20Food%20Orders%20in%20a%20Restaurant/README.md)  |  `哈希表`  |  中等  |    |
|  [1419](https://leetcode-cn.com/problems/minimum-number-of-frogs-croaking)  |  [数青蛙](/solution/1400-1499/1419.Minimum%20Number%20of%20Frogs%20Croaking/README.md)  |  `字符串`  |  中等  |    |
|  [1420](https://leetcode-cn.com/problems/build-array-where-you-can-find-the-maximum-exactly-k-comparisons)  |  [生成数组](/solution/1400-1499/1420.Build%20Array%20Where%20You%20Can%20Find%20The%20Maximum%20Exactly%20K%20Comparisons/README.md)  |  `动态规划`  |  困难  |    |
|  [1421](https://leetcode-cn.com/problems/npv-queries)  |  [净现值查询](/solution/1400-1499/1421.NPV%20Queries/README.md)  |    |  中等  |  🔒  |
|  [1422](https://leetcode-cn.com/problems/maximum-score-after-splitting-a-string)  |  [分割字符串的最大得分](/solution/1400-1499/1422.Maximum%20Score%20After%20Splitting%20a%20String/README.md)  |  `字符串`  |  简单  |    |
|  [1423](https://leetcode-cn.com/problems/maximum-points-you-can-obtain-from-cards)  |  [可获得的最大点数](/solution/1400-1499/1423.Maximum%20Points%20You%20Can%20Obtain%20from%20Cards/README.md)  |  `数组`,`动态规划`  |  中等  |    |
|  [1424](https://leetcode-cn.com/problems/diagonal-traverse-ii)  |  [对角线遍历 II](/solution/1400-1499/1424.Diagonal%20Traverse%20II/README.md)  |  `排序`,`数组`  |  中等  |    |
|  [1425](https://leetcode-cn.com/problems/constrained-subsequence-sum)  |  [带限制的子序列和](/solution/1400-1499/1425.Constrained%20Subsequence%20Sum/README.md)  |  `动态规划`  |  困难  |    |
|  [1426](https://leetcode-cn.com/problems/counting-elements)  |  [数元素](/solution/1400-1499/1426.Counting%20Elements/README.md)  |  `数组`  |  简单  |  🔒  |
|  [1427](https://leetcode-cn.com/problems/perform-string-shifts)  |  [字符串的左右移](/solution/1400-1499/1427.Perform%20String%20Shifts/README.md)  |  `数组`,`数学`  |  简单  |  🔒  |
|  [1428](https://leetcode-cn.com/problems/leftmost-column-with-at-least-a-one)  |  [至少有一个 1 的最左端列](/solution/1400-1499/1428.Leftmost%20Column%20with%20at%20Least%20a%20One/README.md)  |  `数组`  |  中等  |  🔒  |
|  [1429](https://leetcode-cn.com/problems/first-unique-number)  |  [第一个唯一数字](/solution/1400-1499/1429.First%20Unique%20Number/README.md)  |  `设计`,`哈希表`  |  中等  |  🔒  |
|  [1430](https://leetcode-cn.com/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree)  |  [判断给定的序列是否是二叉树从根到叶的路径](/solution/1400-1499/1430.Check%20If%20a%20String%20Is%20a%20Valid%20Sequence%20from%20Root%20to%20Leaves%20Path%20in%20a%20Binary%20Tree/README.md)  |  `树`  |  中等  |  🔒  |
|  [1431](https://leetcode-cn.com/problems/kids-with-the-greatest-number-of-candies)  |  [拥有最多糖果的孩子](/solution/1400-1499/1431.Kids%20With%20the%20Greatest%20Number%20of%20Candies/README.md)  |  `数组`  |  简单  |    |
|  [1432](https://leetcode-cn.com/problems/max-difference-you-can-get-from-changing-an-integer)  |  [改变一个整数能得到的最大差值](/solution/1400-1499/1432.Max%20Difference%20You%20Can%20Get%20From%20Changing%20an%20Integer/README.md)  |  `字符串`  |  中等  |    |
|  [1433](https://leetcode-cn.com/problems/check-if-a-string-can-break-another-string)  |  [检查一个字符串是否可以打破另一个字符串](/solution/1400-1499/1433.Check%20If%20a%20String%20Can%20Break%20Another%20String/README.md)  |  `贪心算法`,`字符串`  |  中等  |    |
|  [1434](https://leetcode-cn.com/problems/number-of-ways-to-wear-different-hats-to-each-other)  |  [每个人戴不同帽子的方案数](/solution/1400-1499/1434.Number%20of%20Ways%20to%20Wear%20Different%20Hats%20to%20Each%20Other/README.md)  |  `位运算`,`动态规划`  |  困难  |    |
|  [1435](https://leetcode-cn.com/problems/create-a-session-bar-chart)  |  [制作会话柱状图](/solution/1400-1499/1435.Create%20a%20Session%20Bar%20Chart/README.md)  |    |  简单  |  🔒  |
|  [1436](https://leetcode-cn.com/problems/destination-city)  |  [旅行终点站](/solution/1400-1499/1436.Destination%20City/README.md)  |  `字符串`  |  简单  |    |
|  [1437](https://leetcode-cn.com/problems/check-if-all-1s-are-at-least-length-k-places-away)  |  [是否所有 1 都至少相隔 k 个元素](/solution/1400-1499/1437.Check%20If%20All%201%27s%20Are%20at%20Least%20Length%20K%20Places%20Away/README.md)  |  `数组`  |  简单  |    |
|  [1438](https://leetcode-cn.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit)  |  [绝对差不超过限制的最长连续子数组](/solution/1400-1499/1438.Longest%20Continuous%20Subarray%20With%20Absolute%20Diff%20Less%20Than%20or%20Equal%20to%20Limit/README.md)  |  `数组`  |  中等  |    |
|  [1439](https://leetcode-cn.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows)  |  [有序矩阵中的第 k 个最小数组和](/solution/1400-1499/1439.Find%20the%20Kth%20Smallest%20Sum%20of%20a%20Matrix%20With%20Sorted%20Rows/README.md)  |  `堆`  |  困难  |    |
|  [1440](https://leetcode-cn.com/problems/evaluate-boolean-expression)  |  [计算布尔表达式的值](/solution/1400-1499/1440.Evaluate%20Boolean%20Expression/README.md)  |    |  中等  |  🔒  |
|  [1441](https://leetcode-cn.com/problems/build-an-array-with-stack-operations)  |  [用栈操作构建数组](/solution/1400-1499/1441.Build%20an%20Array%20With%20Stack%20Operations/README.md)  |  `栈`  |  简单  |    |
|  [1442](https://leetcode-cn.com/problems/count-triplets-that-can-form-two-arrays-of-equal-xor)  |  [形成两个异或相等数组的三元组数目](/solution/1400-1499/1442.Count%20Triplets%20That%20Can%20Form%20Two%20Arrays%20of%20Equal%20XOR/README.md)  |  `位运算`,`数组`,`数学`  |  中等  |    |
|  [1443](https://leetcode-cn.com/problems/minimum-time-to-collect-all-apples-in-a-tree)  |  [收集树上所有苹果的最少时间](/solution/1400-1499/1443.Minimum%20Time%20to%20Collect%20All%20Apples%20in%20a%20Tree/README.md)  |  `树`,`深度优先搜索`  |  中等  |    |
|  [1444](https://leetcode-cn.com/problems/number-of-ways-of-cutting-a-pizza)  |  [切披萨的方案数](/solution/1400-1499/1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza/README.md)  |  `动态规划`  |  困难  |    |
|  [1445](https://leetcode-cn.com/problems/apples-oranges)  |  [苹果和桔子](/solution/1400-1499/1445.Apples%20%26%20Oranges/README.md)  |    |  中等  |  🔒  |
|  [1446](https://leetcode-cn.com/problems/consecutive-characters)  |  [连续字符](/solution/1400-1499/1446.Consecutive%20Characters/README.md)  |  `字符串`  |  简单  |    |
|  [1447](https://leetcode-cn.com/problems/simplified-fractions)  |  [最简分数](/solution/1400-1499/1447.Simplified%20Fractions/README.md)  |  `数学`  |  中等  |    |
|  [1448](https://leetcode-cn.com/problems/count-good-nodes-in-binary-tree)  |  [统计二叉树中好节点的数目](/solution/1400-1499/1448.Count%20Good%20Nodes%20in%20Binary%20Tree/README.md)  |  `树`,`深度优先搜索`  |  中等  |    |
|  [1449](https://leetcode-cn.com/problems/form-largest-integer-with-digits-that-add-up-to-target)  |  [数位成本和为目标值的最大数字](/solution/1400-1499/1449.Form%20Largest%20Integer%20With%20Digits%20That%20Add%20up%20to%20Target/README.md)  |  `字符串`,`动态规划`  |  困难  |    |
|  [1450](https://leetcode-cn.com/problems/number-of-students-doing-homework-at-a-given-time)  |  [在既定时间做作业的学生人数](/solution/1400-1499/1450.Number%20of%20Students%20Doing%20Homework%20at%20a%20Given%20Time/README.md)  |  `数组`  |  简单  |    |
|  [1451](https://leetcode-cn.com/problems/rearrange-words-in-a-sentence)  |  [重新排列句子中的单词](/solution/1400-1499/1451.Rearrange%20Words%20in%20a%20Sentence/README.md)  |  `排序`,`字符串`  |  中等  |    |
|  [1452](https://leetcode-cn.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list)  |  [收藏清单](/solution/1400-1499/1452.People%20Whose%20List%20of%20Favorite%20Companies%20Is%20Not%20a%20Subset%20of%20Another%20List/README.md)  |  `排序`,`字符串`  |  中等  |    |
|  [1453](https://leetcode-cn.com/problems/maximum-number-of-darts-inside-of-a-circular-dartboard)  |  [圆形靶内的最大飞镖数量](/solution/1400-1499/1453.Maximum%20Number%20of%20Darts%20Inside%20of%20a%20Circular%20Dartboard/README.md)  |  `几何`  |  困难  |    |
|  [1454](https://leetcode-cn.com/problems/active-users)  |  [活跃用户](/solution/1400-1499/1454.Active%20Users/README.md)  |    |  中等  |  🔒  |
|  [1455](https://leetcode-cn.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence)  |  [检查单词是否为句中其他单词的前缀](/solution/1400-1499/1455.Check%20If%20a%20Word%20Occurs%20As%20a%20Prefix%20of%20Any%20Word%20in%20a%20Sentence/README.md)  |  `字符串`  |  简单  |    |
|  [1456](https://leetcode-cn.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length)  |  [定长子串中元音的最大数目](/solution/1400-1499/1456.Maximum%20Number%20of%20Vowels%20in%20a%20Substring%20of%20Given%20Length/README.md)  |  `字符串`  |  中等  |    |
|  [1457](https://leetcode-cn.com/problems/pseudo-palindromic-paths-in-a-binary-tree)  |  [二叉树中的伪回文路径](/solution/1400-1499/1457.Pseudo-Palindromic%20Paths%20in%20a%20Binary%20Tree/README.md)  |  `位运算`,`树`,`深度优先搜索`  |  中等  |    |
|  [1458](https://leetcode-cn.com/problems/max-dot-product-of-two-subsequences)  |  [两个子序列的最大点积](/solution/1400-1499/1458.Max%20Dot%20Product%20of%20Two%20Subsequences/README.md)  |  `动态规划`  |  困难  |    |
|  [1459](https://leetcode-cn.com/problems/rectangles-area)  |  [矩形面积](/solution/1400-1499/1459.Rectangles%20Area/README.md)  |    |  中等  |  🔒  |
|  [1460](https://leetcode-cn.com/problems/make-two-arrays-equal-by-reversing-sub-arrays)  |  [通过翻转子数组使两个数组相等](/solution/1400-1499/1460.Make%20Two%20Arrays%20Equal%20by%20Reversing%20Sub-arrays/README.md)  |  `数组`  |  简单  |    |
|  [1461](https://leetcode-cn.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k)  |  [检查一个字符串是否包含所有长度为 K 的二进制子串](/solution/1400-1499/1461.Check%20If%20a%20String%20Contains%20All%20Binary%20Codes%20of%20Size%20K/README.md)  |  `位运算`,`字符串`  |  中等  |    |
|  [1462](https://leetcode-cn.com/problems/course-schedule-iv)  |  [课程表 IV](/solution/1400-1499/1462.Course%20Schedule%20IV/README.md)  |  `图`  |  中等  |    |
|  [1463](https://leetcode-cn.com/problems/cherry-pickup-ii)  |  [摘樱桃 II](/solution/1400-1499/1463.Cherry%20Pickup%20II/README.md)  |  `动态规划`  |  困难  |    |
|  [1464](https://leetcode-cn.com/problems/maximum-product-of-two-elements-in-an-array)  |  [数组中两元素的最大乘积](/solution/1400-1499/1464.Maximum%20Product%20of%20Two%20Elements%20in%20an%20Array/README.md)  |  `数组`  |  简单  |    |
|  [1465](https://leetcode-cn.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts)  |  [切割后面积最大的蛋糕](/solution/1400-1499/1465.Maximum%20Area%20of%20a%20Piece%20of%20Cake%20After%20Horizontal%20and%20Vertical%20Cuts/README.md)  |  `数组`  |  中等  |    |
|  [1466](https://leetcode-cn.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero)  |  [重新规划路线](/solution/1400-1499/1466.Reorder%20Routes%20to%20Make%20All%20Paths%20Lead%20to%20the%20City%20Zero/README.md)  |  `树`,`深度优先搜索`  |  中等  |    |
|  [1467](https://leetcode-cn.com/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls)  |  [两个盒子中球的颜色数相同的概率](/solution/1400-1499/1467.Probability%20of%20a%20Two%20Boxes%20Having%20The%20Same%20Number%20of%20Distinct%20Balls/README.md)  |  `数学`,`回溯算法`  |  困难  |    |
|  [1468](https://leetcode-cn.com/problems/calculate-salaries)  |  [计算税后工资](/solution/1400-1499/1468.Calculate%20Salaries/README.md)  |    |  中等  |  🔒  |
|  [1469](https://leetcode-cn.com/problems/find-all-the-lonely-nodes)  |  [寻找所有的独生节点](/solution/1400-1499/1469.Find%20All%20The%20Lonely%20Nodes/README.md)  |  `树`,`深度优先搜索`  |  简单  |  🔒  |
|  [1470](https://leetcode-cn.com/problems/shuffle-the-array)  |  [重新排列数组](/solution/1400-1499/1470.Shuffle%20the%20Array/README.md)  |  `数组`  |  简单  |    |
|  [1471](https://leetcode-cn.com/problems/the-k-strongest-values-in-an-array)  |  [数组中的 k 个最强值](/solution/1400-1499/1471.The%20k%20Strongest%20Values%20in%20an%20Array/README.md)  |  `排序`,`数组`  |  中等  |    |
|  [1472](https://leetcode-cn.com/problems/design-browser-history)  |  [设计浏览器历史记录](/solution/1400-1499/1472.Design%20Browser%20History/README.md)  |  `设计`  |  中等  |    |
|  [1473](https://leetcode-cn.com/problems/paint-house-iii)  |  [粉刷房子 III](/solution/1400-1499/1473.Paint%20House%20III/README.md)  |  `动态规划`  |  困难  |    |
|  [1474](https://leetcode-cn.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list)  |  [删除链表 M 个节点之后的 N 个节点](/solution/1400-1499/1474.Delete%20N%20Nodes%20After%20M%20Nodes%20of%20a%20Linked%20List/README.md)  |  `链表`  |  简单  |  🔒  |
|  [1475](https://leetcode-cn.com/problems/final-prices-with-a-special-discount-in-a-shop)  |  [商品折扣后的最终价格](/solution/1400-1499/1475.Final%20Prices%20With%20a%20Special%20Discount%20in%20a%20Shop/README.md)  |  `数组`  |  简单  |    |
|  [1476](https://leetcode-cn.com/problems/subrectangle-queries)  |  [子矩形查询](/solution/1400-1499/1476.Subrectangle%20Queries/README.md)  |  `数组`  |  中等  |    |
|  [1477](https://leetcode-cn.com/problems/find-two-non-overlapping-sub-arrays-each-with-target-sum)  |  [找两个和为目标值且不重叠的子数组](/solution/1400-1499/1477.Find%20Two%20Non-overlapping%20Sub-arrays%20Each%20With%20Target%20Sum/README.md)  |  `动态规划`  |  中等  |    |
|  [1478](https://leetcode-cn.com/problems/allocate-mailboxes)  |  [安排邮筒](/solution/1400-1499/1478.Allocate%20Mailboxes/README.md)  |  `数学`,`动态规划`  |  困难  |    |
|  [1479](https://leetcode-cn.com/problems/sales-by-day-of-the-week)  |  [周内每天的销售情况](/solution/1400-1499/1479.Sales%20by%20Day%20of%20the%20Week/README.md)  |    |  困难  |  🔒  |
|  [1480](https://leetcode-cn.com/problems/running-sum-of-1d-array)  |  [一维数组的动态和](/solution/1400-1499/1480.Running%20Sum%20of%201d%20Array/README.md)  |  `数组`  |  简单  |    |
|  [1481](https://leetcode-cn.com/problems/least-number-of-unique-integers-after-k-removals)  |  [不同整数的最少数目](/solution/1400-1499/1481.Least%20Number%20of%20Unique%20Integers%20after%20K%20Removals/README.md)  |  `排序`,`数组`  |  中等  |    |
|  [1482](https://leetcode-cn.com/problems/minimum-number-of-days-to-make-m-bouquets)  |  [制作 m 束花所需的最少天数](/solution/1400-1499/1482.Minimum%20Number%20of%20Days%20to%20Make%20m%20Bouquets/README.md)  |  `数组`,`二分查找`  |  中等  |    |
|  [1483](https://leetcode-cn.com/problems/kth-ancestor-of-a-tree-node)  |  [树节点的第 K 个祖先](/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README.md)  |  `动态规划`  |  困难  |    |
|  [1484](https://leetcode-cn.com/problems/group-sold-products-by-the-date)  |  [按日期分组销售产品](/solution/1400-1499/1484.Group%20Sold%20Products%20By%20The%20Date/README.md)  |    |  简单  |  🔒  |
|  [1485](https://leetcode-cn.com/problems/clone-binary-tree-with-random-pointer)  |  [克隆含随机指针的二叉树](/solution/1400-1499/1485.Clone%20Binary%20Tree%20With%20Random%20Pointer/README.md)  |  `树`,`深度优先搜索`  |  中等  |  🔒  |
|  [1486](https://leetcode-cn.com/problems/xor-operation-in-an-array)  |  [数组异或操作](/solution/1400-1499/1486.XOR%20Operation%20in%20an%20Array/README.md)  |  `位运算`,`数组`  |  简单  |    |
|  [1487](https://leetcode-cn.com/problems/making-file-names-unique)  |  [保证文件名唯一](/solution/1400-1499/1487.Making%20File%20Names%20Unique/README.md)  |  `哈希表`,`字符串`  |  中等  |    |
|  [1488](https://leetcode-cn.com/problems/avoid-flood-in-the-city)  |  [避免洪水泛滥](/solution/1400-1499/1488.Avoid%20Flood%20in%20The%20City/README.md)  |  `数组`,`哈希表`  |  中等  |    |
|  [1489](https://leetcode-cn.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree)  |  [找到最小生成树里的关键边和伪关键边](/solution/1400-1499/1489.Find%20Critical%20and%20Pseudo-Critical%20Edges%20in%20Minimum%20Spanning%20Tree/README.md)  |  `深度优先搜索`,`并查集`  |  困难  |    |
|  [1490](https://leetcode-cn.com/problems/clone-n-ary-tree)  |  [克隆 N 叉树](/solution/1400-1499/1490.Clone%20N-ary%20Tree/README.md)  |  `树`,`深度优先搜索`,`广度优先搜索`,`哈希表`  |  中等  |  🔒  |
|  [1491](https://leetcode-cn.com/problems/average-salary-excluding-the-minimum-and-maximum-salary)  |  [去掉最低工资和最高工资后的工资平均值](/solution/1400-1499/1491.Average%20Salary%20Excluding%20the%20Minimum%20and%20Maximum%20Salary/README.md)  |  `排序`,`数组`  |  简单  |    |
|  [1492](https://leetcode-cn.com/problems/the-kth-factor-of-n)  |  [n 的第 k 个因子](/solution/1400-1499/1492.The%20kth%20Factor%20of%20n/README.md)  |  `数学`  |  中等  |    |
|  [1493](https://leetcode-cn.com/problems/longest-subarray-of-1s-after-deleting-one-element)  |  [删掉一个元素以后全为 1 的最长子数组](/solution/1400-1499/1493.Longest%20Subarray%20of%201%27s%20After%20Deleting%20One%20Element/README.md)  |  `数组`  |  中等  |    |
|  [1494](https://leetcode-cn.com/problems/parallel-courses-ii)  |  [并行课程 II](/solution/1400-1499/1494.Parallel%20Courses%20II/README.md)  |  `图`  |  困难  |    |
|  [1495](https://leetcode-cn.com/problems/friendly-movies-streamed-last-month)  |  [上月播放的儿童适宜电影](/solution/1400-1499/1495.Friendly%20Movies%20Streamed%20Last%20Month/README.md)  |    |  简单  |  🔒  |
|  [1496](https://leetcode-cn.com/problems/path-crossing)  |  [判断路径是否相交](/solution/1400-1499/1496.Path%20Crossing/README.md)  |  `字符串`  |  简单  |    |
|  [1497](https://leetcode-cn.com/problems/check-if-array-pairs-are-divisible-by-k)  |  [检查数组对是否可以被 k 整除](/solution/1400-1499/1497.Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/README.md)  |  `贪心算法`,`数组`,`数学`  |  中等  |    |
|  [1498](https://leetcode-cn.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition)  |  [满足条件的子序列数目](/solution/1400-1499/1498.Number%20of%20Subsequences%20That%20Satisfy%20the%20Given%20Sum%20Condition/README.md)  |  `排序`  |  中等  |    |
|  [1499](https://leetcode-cn.com/problems/max-value-of-equation)  |  [满足不等式的最大值](/solution/1400-1499/1499.Max%20Value%20of%20Equation/README.md)  |  `数组`  |  困难  |    |
|  [1500](https://leetcode-cn.com/problems/design-a-file-sharing-system)  |  [设计文件分享系统](/solution/1500-1599/1500.Design%20a%20File%20Sharing%20System/README.md)  |  `设计`,`数组`  |  中等  |  🔒  |
|  [1501](https://leetcode-cn.com/problems/countries-you-can-safely-invest-in)  |  [可以放心投资的国家](/solution/1500-1599/1501.Countries%20You%20Can%20Safely%20Invest%20In/README.md)  |    |  中等  |  🔒  |
|  [1502](https://leetcode-cn.com/problems/can-make-arithmetic-progression-from-sequence)  |  [判断能否形成等差数列](/solution/1500-1599/1502.Can%20Make%20Arithmetic%20Progression%20From%20Sequence/README.md)  |  `排序`,`数组`  |  简单  |    |
|  [1503](https://leetcode-cn.com/problems/last-moment-before-all-ants-fall-out-of-a-plank)  |  [所有蚂蚁掉下来前的最后一刻](/solution/1500-1599/1503.Last%20Moment%20Before%20All%20Ants%20Fall%20Out%20of%20a%20Plank/README.md)  |  `脑筋急转弯`,`数组`  |  中等  |    |
|  [1504](https://leetcode-cn.com/problems/count-submatrices-with-all-ones)  |  [统计全 1 子矩形](/solution/1500-1599/1504.Count%20Submatrices%20With%20All%20Ones/README.md)  |  `动态规划`  |  中等  |    |
|  [1505](https://leetcode-cn.com/problems/minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits)  |  [最多 K 次交换相邻数位后得到的最小整数](/solution/1500-1599/1505.Minimum%20Possible%20Integer%20After%20at%20Most%20K%20Adjacent%20Swaps%20On%20Digits/README.md)  |  `贪心算法`  |  困难  |    |
|  [1506](https://leetcode-cn.com/problems/find-root-of-n-ary-tree)  |  [找到 N 叉树的根节点](/solution/1500-1599/1506.Find%20Root%20of%20N-Ary%20Tree/README.md)  |    |  中等  |  🔒  |
|  [1507](https://leetcode-cn.com/problems/reformat-date)  |  [转变日期格式](/solution/1500-1599/1507.Reformat%20Date/README.md)  |  `字符串`  |  简单  |    |
|  [1508](https://leetcode-cn.com/problems/range-sum-of-sorted-subarray-sums)  |  [子数组和排序后的区间和](/solution/1500-1599/1508.Range%20Sum%20of%20Sorted%20Subarray%20Sums/README.md)  |  `排序`,`数组`  |  中等  |    |
|  [1509](https://leetcode-cn.com/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves)  |  [三次操作后最大值与最小值的最小差](/solution/1500-1599/1509.Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/README.md)  |  `排序`,`数组`  |  中等  |    |
|  [1510](https://leetcode-cn.com/problems/stone-game-iv)  |  [石子游戏 IV](/solution/1500-1599/1510.Stone%20Game%20IV/README.md)  |  `动态规划`  |  困难  |    |
|  [1511](https://leetcode-cn.com/problems/customer-order-frequency)  |  [消费者下单频率](/solution/1500-1599/1511.Customer%20Order%20Frequency/README.md)  |    |  简单  |  🔒  |
|  [1512](https://leetcode-cn.com/problems/number-of-good-pairs)  |  [好数对的数目](/solution/1500-1599/1512.Number%20of%20Good%20Pairs/README.md)  |  `数组`,`哈希表`,`数学`  |  简单  |    |
|  [1513](https://leetcode-cn.com/problems/number-of-substrings-with-only-1s)  |  [仅含 1 的子串数](/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README.md)  |  `数学`,`字符串`  |  中等  |    |
|  [1514](https://leetcode-cn.com/problems/path-with-maximum-probability)  |  [概率最大的路径](/solution/1500-1599/1514.Path%20with%20Maximum%20Probability/README.md)  |  `图`  |  中等  |    |
|  [1515](https://leetcode-cn.com/problems/best-position-for-a-service-centre)  |  [服务中心的最佳位置](/solution/1500-1599/1515.Best%20Position%20for%20a%20Service%20Centre/README.md)  |  `几何`  |  困难  |    |
|  [1516](https://leetcode-cn.com/problems/move-sub-tree-of-n-ary-tree)  |  [移动 N 叉树的子树](/solution/1500-1599/1516.Move%20Sub-Tree%20of%20N-Ary%20Tree/README.md)  |  `树`  |  困难  |  🔒  |
|  [1517](https://leetcode-cn.com/problems/find-users-with-valid-e-mails)  |  [查找拥有有效邮箱的用户](/solution/1500-1599/1517.Find%20Users%20With%20Valid%20E-Mails/README.md)  |    |  简单  |  🔒  |
|  [1518](https://leetcode-cn.com/problems/water-bottles)  |  [换酒问题](/solution/1500-1599/1518.Water%20Bottles/README.md)  |  `贪心算法`  |  简单  |    |
|  [1519](https://leetcode-cn.com/problems/number-of-nodes-in-the-sub-tree-with-the-same-label)  |  [子树中标签相同的节点数](/solution/1500-1599/1519.Number%20of%20Nodes%20in%20the%20Sub-Tree%20With%20the%20Same%20Label/README.md)  |  `深度优先搜索`,`广度优先搜索`  |  中等  |    |
|  [1520](https://leetcode-cn.com/problems/maximum-number-of-non-overlapping-substrings)  |  [最多的不重叠子字符串](/solution/1500-1599/1520.Maximum%20Number%20of%20Non-Overlapping%20Substrings/README.md)  |  `贪心算法`  |  困难  |    |
|  [1521](https://leetcode-cn.com/problems/find-a-value-of-a-mysterious-function-closest-to-target)  |  [找到最接近目标值的函数值](/solution/1500-1599/1521.Find%20a%20Value%20of%20a%20Mysterious%20Function%20Closest%20to%20Target/README.md)  |  `位运算`,`线段树`,`二分查找`  |  困难  |    |
|  [1522](https://leetcode-cn.com/problems/diameter-of-n-ary-tree)  |  [N 叉树的直径](/solution/1500-1599/1522.Diameter%20of%20N-Ary%20Tree/README.md)  |    |  中等  |  🔒  |
|  [1523](https://leetcode-cn.com/problems/count-odd-numbers-in-an-interval-range)  |  [在区间范围内统计奇数数目](/solution/1500-1599/1523.Count%20Odd%20Numbers%20in%20an%20Interval%20Range/README.md)  |  `数学`  |  简单  |    |
|  [1524](https://leetcode-cn.com/problems/number-of-sub-arrays-with-odd-sum)  |  [和为奇数的子数组数目](/solution/1500-1599/1524.Number%20of%20Sub-arrays%20With%20Odd%20Sum/README.md)  |  `数组`,`数学`  |  中等  |    |
|  [1525](https://leetcode-cn.com/problems/number-of-good-ways-to-split-a-string)  |  [字符串的好分割数目](/solution/1500-1599/1525.Number%20of%20Good%20Ways%20to%20Split%20a%20String/README.md)  |  `位运算`,`字符串`  |  中等  |    |
|  [1526](https://leetcode-cn.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array)  |  [形成目标数组的子数组最少增加次数](/solution/1500-1599/1526.Minimum%20Number%20of%20Increments%20on%20Subarrays%20to%20Form%20a%20Target%20Array/README.md)  |  `线段树`  |  困难  |    |
|  [1527](https://leetcode-cn.com/problems/patients-with-a-condition)  |  [患某种疾病的患者](/solution/1500-1599/1527.Patients%20With%20a%20Condition/README.md)  |    |  简单  |  🔒  |
|  [1528](https://leetcode-cn.com/problems/shuffle-string)  |  [重新排列字符串](/solution/1500-1599/1528.Shuffle%20String/README.md)  |  `排序`  |  简单  |    |
|  [1529](https://leetcode-cn.com/problems/bulb-switcher-iv)  |  [灯泡开关 IV](/solution/1500-1599/1529.Bulb%20Switcher%20IV/README.md)  |  `字符串`  |  中等  |    |
|  [1530](https://leetcode-cn.com/problems/number-of-good-leaf-nodes-pairs)  |  [好叶子节点对的数量](/solution/1500-1599/1530.Number%20of%20Good%20Leaf%20Nodes%20Pairs/README.md)  |  `树`,`深度优先搜索`  |  中等  |    |
|  [1531](https://leetcode-cn.com/problems/string-compression-ii)  |  [压缩字符串 II](/solution/1500-1599/1531.String%20Compression%20II/README.md)  |  `字符串`,`动态规划`  |  困难  |    |
|  [1532](https://leetcode-cn.com/problems/the-most-recent-three-orders)  |  [最近的三笔订单](/solution/1500-1599/1532.The%20Most%20Recent%20Three%20Orders/README.md)  |    |  中等  |  🔒  |
|  [1533](https://leetcode-cn.com/problems/find-the-index-of-the-large-integer)  |  [找到最大整数的索引](/solution/1500-1599/1533.Find%20the%20Index%20of%20the%20Large%20Integer/README.md)  |  `二分查找`  |  中等  |  🔒  |
|  [1534](https://leetcode-cn.com/problems/count-good-triplets)  |  [统计好三元组](/solution/1500-1599/1534.Count%20Good%20Triplets/README.md)  |  `数组`  |  简单  |    |
|  [1535](https://leetcode-cn.com/problems/find-the-winner-of-an-array-game)  |  [找出数组游戏的赢家](/solution/1500-1599/1535.Find%20the%20Winner%20of%20an%20Array%20Game/README.md)  |  `数组`  |  中等  |    |
|  [1536](https://leetcode-cn.com/problems/minimum-swaps-to-arrange-a-binary-grid)  |  [排布二进制网格的最少交换次数](/solution/1500-1599/1536.Minimum%20Swaps%20to%20Arrange%20a%20Binary%20Grid/README.md)  |  `贪心算法`  |  中等  |    |
|  [1537](https://leetcode-cn.com/problems/get-the-maximum-score)  |  [最大得分](/solution/1500-1599/1537.Get%20the%20Maximum%20Score/README.md)  |  `动态规划`  |  困难  |    |
|  [1538](https://leetcode-cn.com/problems/guess-the-majority-in-a-hidden-array)  |  [找出隐藏数组中出现次数最多的元素](/solution/1500-1599/1538.Guess%20the%20Majority%20in%20a%20Hidden%20Array/README.md)  |    |  中等  |  🔒  |
|  [1539](https://leetcode-cn.com/problems/kth-missing-positive-number)  |  [第 k 个缺失的正整数](/solution/1500-1599/1539.Kth%20Missing%20Positive%20Number/README.md)  |  `数组`,`哈希表`  |  简单  |    |
|  [1540](https://leetcode-cn.com/problems/can-convert-string-in-k-moves)  |  [K 次操作转变字符串](/solution/1500-1599/1540.Can%20Convert%20String%20in%20K%20Moves/README.md)  |  `贪心算法`,`字符串`  |  中等  |    |
|  [1541](https://leetcode-cn.com/problems/minimum-insertions-to-balance-a-parentheses-string)  |  [平衡括号字符串的最少插入次数](/solution/1500-1599/1541.Minimum%20Insertions%20to%20Balance%20a%20Parentheses%20String/README.md)  |  `栈`,`字符串`  |  中等  |    |
|  [1542](https://leetcode-cn.com/problems/find-longest-awesome-substring)  |  [找出最长的超赞子字符串](/solution/1500-1599/1542.Find%20Longest%20Awesome%20Substring/README.md)  |  `位运算`,`字符串`  |  困难  |    |
|  [1543](https://leetcode-cn.com/problems/fix-product-name-format)  |  [产品名称格式修复](/solution/1500-1599/1543.Fix%20Product%20Name%20Format/README.md)  |    |  简单  |  🔒  |
|  [1544](https://leetcode-cn.com/problems/make-the-string-great)  |  [整理字符串](/solution/1500-1599/1544.Make%20The%20String%20Great/README.md)  |  `栈`,`字符串`  |  简单  |    |
|  [1545](https://leetcode-cn.com/problems/find-kth-bit-in-nth-binary-string)  |  [找出第 N 个二进制字符串中的第 K 位](/solution/1500-1599/1545.Find%20Kth%20Bit%20in%20Nth%20Binary%20String/README.md)  |  `字符串`  |  中等  |    |
|  [1546](https://leetcode-cn.com/problems/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target)  |  [和为目标值且不重叠的非空子数组的最大数目](/solution/1500-1599/1546.Maximum%20Number%20of%20Non-Overlapping%20Subarrays%20With%20Sum%20Equals%20Target/README.md)  |  `动态规划`  |  中等  |    |
|  [1547](https://leetcode-cn.com/problems/minimum-cost-to-cut-a-stick)  |  [切棍子的最小成本](/solution/1500-1599/1547.Minimum%20Cost%20to%20Cut%20a%20Stick/README.md)  |  `动态规划`  |  困难  |    |
|  [1548](https://leetcode-cn.com/problems/the-most-similar-path-in-a-graph)  |  [图中最相似的路径](/solution/1500-1599/1548.The%20Most%20Similar%20Path%20in%20a%20Graph/README.md)  |  `图`,`动态规划`  |  困难  |  🔒  |
|  [1549](https://leetcode-cn.com/problems/the-most-recent-orders-for-each-product)  |  [每件商品的最新订单](/solution/1500-1599/1549.The%20Most%20Recent%20Orders%20for%20Each%20Product/README.md)  |    |  中等  |  🔒  |
|  [1550](https://leetcode-cn.com/problems/three-consecutive-odds)  |  [存在连续三个奇数的数组](/solution/1500-1599/1550.Three%20Consecutive%20Odds/README.md)  |  `数组`  |  简单  |    |
|  [1551](https://leetcode-cn.com/problems/minimum-operations-to-make-array-equal)  |  [使数组中所有元素相等的最小操作数](/solution/1500-1599/1551.Minimum%20Operations%20to%20Make%20Array%20Equal/README.md)  |  `数学`  |  中等  |    |
|  [1552](https://leetcode-cn.com/problems/magnetic-force-between-two-balls)  |  [两球之间的磁力](/solution/1500-1599/1552.Magnetic%20Force%20Between%20Two%20Balls/README.md)  |  `数组`,`二分查找`  |  中等  |    |
|  [1553](https://leetcode-cn.com/problems/minimum-number-of-days-to-eat-n-oranges)  |  [吃掉 N 个橘子的最少天数](/solution/1500-1599/1553.Minimum%20Number%20of%20Days%20to%20Eat%20N%20Oranges/README.md)  |  `动态规划`  |  困难  |    |
|  [1554](https://leetcode-cn.com/problems/strings-differ-by-one-character)  |  [只有一个不同字符的字符串](/solution/1500-1599/1554.Strings%20Differ%20by%20One%20Character/README.md)  |    |  中等  |  🔒  |
|  [1555](https://leetcode-cn.com/problems/bank-account-summary)  |  [银行账户概要](/solution/1500-1599/1555.Bank%20Account%20Summary/README.md)  |    |  中等  |  🔒  |
|  [1556](https://leetcode-cn.com/problems/thousand-separator)  |  [千位分隔数](/solution/1500-1599/1556.Thousand%20Separator/README.md)  |  `字符串`  |  简单  |    |
|  [1557](https://leetcode-cn.com/problems/minimum-number-of-vertices-to-reach-all-nodes)  |  [可以到达所有点的最少点数目](/solution/1500-1599/1557.Minimum%20Number%20of%20Vertices%20to%20Reach%20All%20Nodes/README.md)  |  `图`  |  中等  |    |
|  [1558](https://leetcode-cn.com/problems/minimum-numbers-of-function-calls-to-make-target-array)  |  [得到目标数组的最少函数调用次数](/solution/1500-1599/1558.Minimum%20Numbers%20of%20Function%20Calls%20to%20Make%20Target%20Array/README.md)  |  `贪心算法`  |  中等  |    |
|  [1559](https://leetcode-cn.com/problems/detect-cycles-in-2d-grid)  |  [二维网格图中探测环](/solution/1500-1599/1559.Detect%20Cycles%20in%202D%20Grid/README.md)  |  `深度优先搜索`  |  困难  |    |
|  [1560](https://leetcode-cn.com/problems/most-visited-sector-in-a-circular-track)  |  [圆形赛道上经过次数最多的扇区](/solution/1500-1599/1560.Most%20Visited%20Sector%20in%20%20a%20Circular%20Track/README.md)  |  `数组`  |  简单  |    |
|  [1561](https://leetcode-cn.com/problems/maximum-number-of-coins-you-can-get)  |  [你可以获得的最大硬币数目](/solution/1500-1599/1561.Maximum%20Number%20of%20Coins%20You%20Can%20Get/README.md)  |  `排序`  |  中等  |    |
|  [1562](https://leetcode-cn.com/problems/find-latest-group-of-size-m)  |  [查找大小为 M 的最新分组](/solution/1500-1599/1562.Find%20Latest%20Group%20of%20Size%20M/README.md)  |  `二分查找`  |  中等  |    |
|  [1563](https://leetcode-cn.com/problems/stone-game-v)  |  [石子游戏 V](/solution/1500-1599/1563.Stone%20Game%20V/README.md)  |  `动态规划`  |  困难  |    |
|  [1564](https://leetcode-cn.com/problems/put-boxes-into-the-warehouse-i)  |  [把箱子放进仓库里 I](/solution/1500-1599/1564.Put%20Boxes%20Into%20the%20Warehouse%20I/README.md)  |  `贪心算法`  |  中等  |  🔒  |
|  [1565](https://leetcode-cn.com/problems/unique-orders-and-customers-per-month)  |  [按月统计订单数与顾客数](/solution/1500-1599/1565.Unique%20Orders%20and%20Customers%20Per%20Month/README.md)  |    |  简单  |  🔒  |
|  [1566](https://leetcode-cn.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times)  |  [重复至少 K 次且长度为 M 的模式](/solution/1500-1599/1566.Detect%20Pattern%20of%20Length%20M%20Repeated%20K%20or%20More%20Times/README.md)  |  `数组`  |  简单  |    |
|  [1567](https://leetcode-cn.com/problems/maximum-length-of-subarray-with-positive-product)  |  [乘积为正数的最长子数组长度](/solution/1500-1599/1567.Maximum%20Length%20of%20Subarray%20With%20Positive%20Product/README.md)  |  `贪心算法`  |  中等  |    |
|  [1568](https://leetcode-cn.com/problems/minimum-number-of-days-to-disconnect-island)  |  [使陆地分离的最少天数](/solution/1500-1599/1568.Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/README.md)  |  `贪心算法`  |  困难  |    |
|  [1569](https://leetcode-cn.com/problems/number-of-ways-to-reorder-array-to-get-same-bst)  |  [将子数组重新排序得到同一个二叉查找树的方案数](/solution/1500-1599/1569.Number%20of%20Ways%20to%20Reorder%20Array%20to%20Get%20Same%20BST/README.md)  |  `动态规划`  |  困难  |    |
|  [1570](https://leetcode-cn.com/problems/dot-product-of-two-sparse-vectors)  |  [两个稀疏向量的点积](/solution/1500-1599/1570.Dot%20Product%20of%20Two%20Sparse%20Vectors/README.md)  |  `数组`,`哈希表`,`双指针`  |  中等  |  🔒  |
|  [1571](https://leetcode-cn.com/problems/warehouse-manager)  |  [仓库经理](/solution/1500-1599/1571.Warehouse%20Manager/README.md)  |    |  简单  |  🔒  |
|  [1572](https://leetcode-cn.com/problems/matrix-diagonal-sum)  |  [矩阵对角线元素的和](/solution/1500-1599/1572.Matrix%20Diagonal%20Sum/README.md)  |  `数组`  |  简单  |    |
|  [1573](https://leetcode-cn.com/problems/number-of-ways-to-split-a-string)  |  [分割字符串的方案数](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README.md)  |  `字符串`  |  中等  |    |
|  [1574](https://leetcode-cn.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted)  |  [删除最短的子数组使剩余数组有序](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README.md)  |  `数组`,`二分查找`  |  中等  |    |
|  [1575](https://leetcode-cn.com/problems/count-all-possible-routes)  |  [统计所有可行路径](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README.md)  |  `动态规划`  |  困难  |    |
|  [1576](https://leetcode-cn.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters)  |  [替换所有的问号](/solution/1500-1599/1576.Replace%20All%20%27s%20to%20Avoid%20Consecutive%20Repeating%20Characters/README.md)  |  `字符串`  |  简单  |    |
|  [1577](https://leetcode-cn.com/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers)  |  [数的平方等于两数乘积的方法数](/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README.md)  |  `哈希表`,`数学`  |  中等  |    |
|  [1578](https://leetcode-cn.com/problems/minimum-deletion-cost-to-avoid-repeating-letters)  |  [避免重复字母的最小删除成本](/solution/1500-1599/1578.Minimum%20Deletion%20Cost%20to%20Avoid%20Repeating%20Letters/README.md)  |  `贪心算法`  |  中等  |    |
|  [1579](https://leetcode-cn.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable)  |  [保证图可完全遍历](/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README.md)  |  `并查集`  |  困难  |    |
|  [1580](https://leetcode-cn.com/problems/put-boxes-into-the-warehouse-ii)  |  [把箱子放进仓库里 II](/solution/1500-1599/1580.Put%20Boxes%20Into%20the%20Warehouse%20II/README.md)  |  `贪心算法`  |  中等  |  🔒  |
|  [1581](https://leetcode-cn.com/problems/customer-who-visited-but-did-not-make-any-transactions)  |  [进店却未进行过交易的顾客](/solution/1500-1599/1581.Customer%20Who%20Visited%20but%20Did%20Not%20Make%20Any%20Transactions/README.md)  |    |  简单  |  🔒  |
|  [1582](https://leetcode-cn.com/problems/special-positions-in-a-binary-matrix)  |  [二进制矩阵中的特殊位置](/solution/1500-1599/1582.Special%20Positions%20in%20a%20Binary%20Matrix/README.md)  |  `数组`  |  简单  |    |
|  [1583](https://leetcode-cn.com/problems/count-unhappy-friends)  |  [统计不开心的朋友](/solution/1500-1599/1583.Count%20Unhappy%20Friends/README.md)  |  `数组`  |  中等  |    |
|  [1584](https://leetcode-cn.com/problems/min-cost-to-connect-all-points)  |  [连接所有点的最小费用](/solution/1500-1599/1584.Min%20Cost%20to%20Connect%20All%20Points/README.md)  |  `并查集`  |  中等  |    |
|  [1585](https://leetcode-cn.com/problems/check-if-string-is-transformable-with-substring-sort-operations)  |  [检查字符串是否可以通过排序子字符串得到另一个字符串](/solution/1500-1599/1585.Check%20If%20String%20Is%20Transformable%20With%20Substring%20Sort%20Operations/README.md)  |  `贪心算法`,`字符串`  |  困难  |    |
|  [1586](https://leetcode-cn.com/problems/binary-search-tree-iterator-ii)  |  [二叉搜索树迭代器 II](/solution/1500-1599/1586.Binary%20Search%20Tree%20Iterator%20II/README.md)  |  `树`,`设计`  |  中等  |  🔒  |
|  [1587](https://leetcode-cn.com/problems/bank-account-summary-ii)  |  [银行账户概要 II](/solution/1500-1599/1587.Bank%20Account%20Summary%20II/README.md)  |    |  简单  |  🔒  |
|  [1588](https://leetcode-cn.com/problems/sum-of-all-odd-length-subarrays)  |  [所有奇数长度子数组的和](/solution/1500-1599/1588.Sum%20of%20All%20Odd%20Length%20Subarrays/README.md)  |  `数组`  |  简单  |    |
|  [1589](https://leetcode-cn.com/problems/maximum-sum-obtained-of-any-permutation)  |  [所有排列中的最大和](/solution/1500-1599/1589.Maximum%20Sum%20Obtained%20of%20Any%20Permutation/README.md)  |  `贪心算法`  |  中等  |    |
|  [1590](https://leetcode-cn.com/problems/make-sum-divisible-by-p)  |  [使数组和能被 P 整除](/solution/1500-1599/1590.Make%20Sum%20Divisible%20by%20P/README.md)  |  `数组`,`哈希表`,`数学`,`二分查找`  |  中等  |    |
|  [1591](https://leetcode-cn.com/problems/strange-printer-ii)  |  [奇怪的打印机 II](/solution/1500-1599/1591.Strange%20Printer%20II/README.md)  |  `贪心算法`  |  困难  |    |
|  [1592](https://leetcode-cn.com/problems/rearrange-spaces-between-words)  |  [重新排列单词间的空格](/solution/1500-1599/1592.Rearrange%20Spaces%20Between%20Words/README.md)  |  `字符串`  |  简单  |    |
|  [1593](https://leetcode-cn.com/problems/split-a-string-into-the-max-number-of-unique-substrings)  |  [拆分字符串使唯一子字符串的数目最大](/solution/1500-1599/1593.Split%20a%20String%20Into%20the%20Max%20Number%20of%20Unique%20Substrings/README.md)  |  `回溯算法`  |  中等  |    |
|  [1594](https://leetcode-cn.com/problems/maximum-non-negative-product-in-a-matrix)  |  [矩阵的最大非负积](/solution/1500-1599/1594.Maximum%20Non%20Negative%20Product%20in%20a%20Matrix/README.md)  |  `贪心算法`,`动态规划`  |  中等  |    |
|  [1595](https://leetcode-cn.com/problems/minimum-cost-to-connect-two-groups-of-points)  |  [连通两组点的最小成本](/solution/1500-1599/1595.Minimum%20Cost%20to%20Connect%20Two%20Groups%20of%20Points/README.md)  |  `图`,`动态规划`  |  困难  |    |
|  [1596](https://leetcode-cn.com/problems/the-most-frequently-ordered-products-for-each-customer)  |  [每位顾客最经常订购的商品](/solution/1500-1599/1596.The%20Most%20Frequently%20Ordered%20Products%20for%20Each%20Customer/README.md)  |    |  中等  |  🔒  |
|  [1597](https://leetcode-cn.com/problems/build-binary-expression-tree-from-infix-expression)  |  [根据中缀表达式构造二叉表达式树](/solution/1500-1599/1597.Build%20Binary%20Expression%20Tree%20From%20Infix%20Expression/README.md)  |  `树`,`字符串`  |  困难  |  🔒  |
|  [1598](https://leetcode-cn.com/problems/crawler-log-folder)  |  [文件夹操作日志搜集器](/solution/1500-1599/1598.Crawler%20Log%20Folder/README.md)  |  `栈`  |  简单  |    |
|  [1599](https://leetcode-cn.com/problems/maximum-profit-of-operating-a-centennial-wheel)  |  [经营摩天轮的最大利润](/solution/1500-1599/1599.Maximum%20Profit%20of%20Operating%20a%20Centennial%20Wheel/README.md)  |  `贪心算法`  |  中等  |    |
|  [1600](https://leetcode-cn.com/problems/throne-inheritance)  |  [皇位继承顺序](/solution/1600-1699/1600.Throne%20Inheritance/README.md)  |  `树`,`设计`  |  中等  |    |
|  [1601](https://leetcode-cn.com/problems/maximum-number-of-achievable-transfer-requests)  |  [最多可达成的换楼请求数目](/solution/1600-1699/1601.Maximum%20Number%20of%20Achievable%20Transfer%20Requests/README.md)  |  `动态规划`  |  困难  |    |
|  [1602](https://leetcode-cn.com/problems/find-nearest-right-node-in-binary-tree)  |  [找到二叉树中最近的右侧节点](/solution/1600-1699/1602.Find%20Nearest%20Right%20Node%20in%20Binary%20Tree/README.md)  |  `树`,`广度优先搜索`  |  中等  |  🔒  |
|  [1603](https://leetcode-cn.com/problems/design-parking-system)  |  [设计停车系统](/solution/1600-1699/1603.Design%20Parking%20System/README.md)  |  `设计`  |  简单  |    |
|  [1604](https://leetcode-cn.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period)  |  [警告一小时内使用相同员工卡大于等于三次的人](/solution/1600-1699/1604.Alert%20Using%20Same%20Key-Card%20Three%20or%20More%20Times%20in%20a%20One%20Hour%20Period/README.md)  |  `字符串`  |  中等  |    |
|  [1605](https://leetcode-cn.com/problems/find-valid-matrix-given-row-and-column-sums)  |  [给定行和列的和求可行矩阵](/solution/1600-1699/1605.Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums/README.md)  |  `贪心算法`  |  中等  |    |
|  [1606](https://leetcode-cn.com/problems/find-servers-that-handled-most-number-of-requests)  |  [找到处理最多请求的服务器](/solution/1600-1699/1606.Find%20Servers%20That%20Handled%20Most%20Number%20of%20Requests/README.md)  |    |  困难  |    |
|  [1607](https://leetcode-cn.com/problems/sellers-with-no-sales)  |  [没有卖出的卖家](/solution/1600-1699/1607.Sellers%20With%20No%20Sales/README.md)  |    |  简单  |  🔒  |
|  [1608](https://leetcode-cn.com/problems/special-array-with-x-elements-greater-than-or-equal-x)  |  [特殊数组的特征值](/solution/1600-1699/1608.Special%20Array%20With%20X%20Elements%20Greater%20Than%20or%20Equal%20X/README.md)  |  `数组`  |  简单  |    |
|  [1609](https://leetcode-cn.com/problems/even-odd-tree)  |  [奇偶树](/solution/1600-1699/1609.Even%20Odd%20Tree/README.md)  |  `树`  |  中等  |    |
|  [1610](https://leetcode-cn.com/problems/maximum-number-of-visible-points)  |  [可见点的最大数目](/solution/1600-1699/1610.Maximum%20Number%20of%20Visible%20Points/README.md)  |  `几何`,`双指针`  |  困难  |    |
|  [1611](https://leetcode-cn.com/problems/minimum-one-bit-operations-to-make-integers-zero)  |  [使整数变为 0 的最少操作次数](/solution/1600-1699/1611.Minimum%20One%20Bit%20Operations%20to%20Make%20Integers%20Zero/README.md)  |  `位运算`,`动态规划`  |  困难  |    |
|  [1612](https://leetcode-cn.com/problems/check-if-two-expression-trees-are-equivalent)  |  [检查两棵二叉表达式树是否等价](/solution/1600-1699/1612.Check%20If%20Two%20Expression%20Trees%20are%20Equivalent/README.md)  |  `树`,`哈希表`  |  中等  |  🔒  |
|  [1613](https://leetcode-cn.com/problems/find-the-missing-ids)  |  [找到遗失的ID](/solution/1600-1699/1613.Find%20the%20Missing%20IDs/README.md)  |    |  中等  |  🔒  |
|  [1614](https://leetcode-cn.com/problems/maximum-nesting-depth-of-the-parentheses)  |  [括号的最大嵌套深度](/solution/1600-1699/1614.Maximum%20Nesting%20Depth%20of%20the%20Parentheses/README.md)  |  `字符串`  |  简单  |    |
|  [1615](https://leetcode-cn.com/problems/maximal-network-rank)  |  [最大网络秩](/solution/1600-1699/1615.Maximal%20Network%20Rank/README.md)  |  `图`  |  中等  |    |
|  [1616](https://leetcode-cn.com/problems/split-two-strings-to-make-palindrome)  |  [分割两个字符串得到回文串](/solution/1600-1699/1616.Split%20Two%20Strings%20to%20Make%20Palindrome/README.md)  |  `贪心算法`,`双指针`,`字符串`  |  中等  |    |
|  [1617](https://leetcode-cn.com/problems/count-subtrees-with-max-distance-between-cities)  |  [统计子树中城市之间最大距离](/solution/1600-1699/1617.Count%20Subtrees%20With%20Max%20Distance%20Between%20Cities/README.md)  |  `回溯算法`  |  困难  |    |
|  [1618](https://leetcode-cn.com/problems/maximum-font-to-fit-a-sentence-in-a-screen)  |  [找出适应屏幕的最大字号](/solution/1600-1699/1618.Maximum%20Font%20to%20Fit%20a%20Sentence%20in%20a%20Screen/README.md)  |  `字符串`,`二分查找`  |  中等  |  🔒  |
|  [1619](https://leetcode-cn.com/problems/mean-of-array-after-removing-some-elements)  |  [删除某些元素后的数组均值](/solution/1600-1699/1619.Mean%20of%20Array%20After%20Removing%20Some%20Elements/README.md)  |  `数组`  |  简单  |    |
|  [1620](https://leetcode-cn.com/problems/coordinate-with-maximum-network-quality)  |  [网络信号最好的坐标](/solution/1600-1699/1620.Coordinate%20With%20Maximum%20Network%20Quality/README.md)  |  `贪心算法`  |  中等  |    |
|  [1621](https://leetcode-cn.com/problems/number-of-sets-of-k-non-overlapping-line-segments)  |  [大小为 K 的不重叠线段的数目](/solution/1600-1699/1621.Number%20of%20Sets%20of%20K%20Non-Overlapping%20Line%20Segments/README.md)  |  `动态规划`  |  中等  |    |
|  [1622](https://leetcode-cn.com/problems/fancy-sequence)  |  [奇妙序列](/solution/1600-1699/1622.Fancy%20Sequence/README.md)  |  `设计`,`数学`  |  困难  |    |
|  [1623](https://leetcode-cn.com/problems/all-valid-triplets-that-can-represent-a-country)  |  [三人国家代表队](/solution/1600-1699/1623.All%20Valid%20Triplets%20That%20Can%20Represent%20a%20Country/README.md)  |    |  简单  |  🔒  |
|  [1624](https://leetcode-cn.com/problems/largest-substring-between-two-equal-characters)  |  [两个相同字符之间的最长子字符串](/solution/1600-1699/1624.Largest%20Substring%20Between%20Two%20Equal%20Characters/README.md)  |  `字符串`  |  简单  |    |
|  [1625](https://leetcode-cn.com/problems/lexicographically-smallest-string-after-applying-operations)  |  [执行操作后字典序最小的字符串](/solution/1600-1699/1625.Lexicographically%20Smallest%20String%20After%20Applying%20Operations/README.md)  |  `深度优先搜索`,`广度优先搜索`  |  中等  |    |
|  [1626](https://leetcode-cn.com/problems/best-team-with-no-conflicts)  |  [无矛盾的最佳球队](/solution/1600-1699/1626.Best%20Team%20With%20No%20Conflicts/README.md)  |  `动态规划`  |  中等  |    |
|  [1627](https://leetcode-cn.com/problems/graph-connectivity-with-threshold)  |  [带阈值的图连通性](/solution/1600-1699/1627.Graph%20Connectivity%20With%20Threshold/README.md)  |  `并查集`,`数学`  |  困难  |    |
|  [1628](https://leetcode-cn.com/problems/design-an-expression-tree-with-evaluate-function)  |  [设计带解析函数的表达式树](/solution/1600-1699/1628.Design%20an%20Expression%20Tree%20With%20Evaluate%20Function/README.md)  |  `树`,`设计`  |  中等  |  🔒  |
|  [1629](https://leetcode-cn.com/problems/slowest-key)  |  [按键持续时间最长的键](/solution/1600-1699/1629.Slowest%20Key/README.md)  |  `数组`  |  简单  |    |
|  [1630](https://leetcode-cn.com/problems/arithmetic-subarrays)  |  [等差子数组](/solution/1600-1699/1630.Arithmetic%20Subarrays/README.md)  |  `排序`  |  中等  |    |
|  [1631](https://leetcode-cn.com/problems/path-with-minimum-effort)  |  [最小体力消耗路径](/solution/1600-1699/1631.Path%20With%20Minimum%20Effort/README.md)  |  `深度优先搜索`,`并查集`,`图`,`二分查找`  |  中等  |    |
|  [1632](https://leetcode-cn.com/problems/rank-transform-of-a-matrix)  |  [矩阵转换后的秩](/solution/1600-1699/1632.Rank%20Transform%20of%20a%20Matrix/README.md)  |  `贪心算法`,`并查集`  |  困难  |    |
|  [1633](https://leetcode-cn.com/problems/percentage-of-users-attended-a-contest)  |  [各赛事的用户注册率](/solution/1600-1699/1633.Percentage%20of%20Users%20Attended%20a%20Contest/README.md)  |    |  简单  |  🔒  |
|  [1634](https://leetcode-cn.com/problems/add-two-polynomials-represented-as-linked-lists)  |  [求两个多项式链表的和](/solution/1600-1699/1634.Add%20Two%20Polynomials%20Represented%20as%20Linked%20Lists/README.md)  |  `链表`  |  中等  |  🔒  |
|  [1635](https://leetcode-cn.com/problems/hopper-company-queries-i)  |  [Hopper 公司查询 I](/solution/1600-1699/1635.Hopper%20Company%20Queries%20I/README.md)  |    |  困难  |  🔒  |
|  [1636](https://leetcode-cn.com/problems/sort-array-by-increasing-frequency)  |  [按照频率将数组升序排序](/solution/1600-1699/1636.Sort%20Array%20by%20Increasing%20Frequency/README.md)  |  `排序`,`数组`  |  简单  |    |
|  [1637](https://leetcode-cn.com/problems/widest-vertical-area-between-two-points-containing-no-points)  |  [两点之间不包含任何点的最宽垂直面积](/solution/1600-1699/1637.Widest%20Vertical%20Area%20Between%20Two%20Points%20Containing%20No%20Points/README.md)  |  `排序`  |  中等  |    |
|  [1638](https://leetcode-cn.com/problems/count-substrings-that-differ-by-one-character)  |  [统计只差一个字符的子串数目](/solution/1600-1699/1638.Count%20Substrings%20That%20Differ%20by%20One%20Character/README.md)  |  `字典树`,`哈希表`,`字符串`  |  中等  |    |
|  [1639](https://leetcode-cn.com/problems/number-of-ways-to-form-a-target-string-given-a-dictionary)  |  [通过给定词典构造目标字符串的方案数](/solution/1600-1699/1639.Number%20of%20Ways%20to%20Form%20a%20Target%20String%20Given%20a%20Dictionary/README.md)  |  `动态规划`  |  困难  |    |
|  [1640](https://leetcode-cn.com/problems/check-array-formation-through-concatenation)  |  [能否连接形成数组](/solution/1600-1699/1640.Check%20Array%20Formation%20Through%20Concatenation/README.md)  |  `排序`,`数组`,`哈希表`  |  简单  |    |
|  [1641](https://leetcode-cn.com/problems/count-sorted-vowel-strings)  |  [统计字典序元音字符串的数目](/solution/1600-1699/1641.Count%20Sorted%20Vowel%20Strings/README.md)  |  `数学`,`动态规划`,`回溯算法`  |  中等  |    |
|  [1642](https://leetcode-cn.com/problems/furthest-building-you-can-reach)  |  [可以到达的最远建筑](/solution/1600-1699/1642.Furthest%20Building%20You%20Can%20Reach/README.md)  |  `堆`,`二分查找`  |  中等  |    |
|  [1643](https://leetcode-cn.com/problems/kth-smallest-instructions)  |  [第 K 条最小指令](/solution/1600-1699/1643.Kth%20Smallest%20Instructions/README.md)  |  `动态规划`  |  困难  |    |
|  [1644](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree-ii)  |  [二叉树的最近公共祖先 II](/solution/1600-1699/1644.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20II/README.md)  |  `树`  |  中等  |  🔒  |
|  [1645](https://leetcode-cn.com/problems/hopper-company-queries-ii)  |  [Hopper Company Queries II](/solution/1600-1699/1645.Hopper%20Company%20Queries%20II/README.md)  |    |  困难  |  🔒  |
|  [1646](https://leetcode-cn.com/problems/get-maximum-in-generated-array)  |  [获取生成数组中的最大值](/solution/1600-1699/1646.Get%20Maximum%20in%20Generated%20Array/README.md)  |  `数组`  |  简单  |    |
|  [1647](https://leetcode-cn.com/problems/minimum-deletions-to-make-character-frequencies-unique)  |  [字符频次唯一的最小删除次数](/solution/1600-1699/1647.Minimum%20Deletions%20to%20Make%20Character%20Frequencies%20Unique/README.md)  |  `贪心算法`,`排序`  |  中等  |    |
|  [1648](https://leetcode-cn.com/problems/sell-diminishing-valued-colored-balls)  |  [销售价值减少的颜色球](/solution/1600-1699/1648.Sell%20Diminishing-Valued%20Colored%20Balls/README.md)  |  `贪心算法`,`排序`,`数学`  |  中等  |    |
|  [1649](https://leetcode-cn.com/problems/create-sorted-array-through-instructions)  |  [通过指令创建有序数组](/solution/1600-1699/1649.Create%20Sorted%20Array%20through%20Instructions/README.md)  |  `树状数组`,`线段树`,`二分查找`  |  困难  |    |
|  [1650](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree-iii)  |  [二叉树的最近公共祖先 III](/solution/1600-1699/1650.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20III/README.md)  |  `树`  |  中等  |  🔒  |
|  [1651](https://leetcode-cn.com/problems/hopper-company-queries-iii)  |  [Hopper Company Queries III](/solution/1600-1699/1651.Hopper%20Company%20Queries%20III/README.md)  |    |  困难  |  🔒  |
|  [1652](https://leetcode-cn.com/problems/defuse-the-bomb)  |  [拆炸弹](/solution/1600-1699/1652.Defuse%20the%20Bomb/README.md)  |  `数组`  |  简单  |    |
|  [1653](https://leetcode-cn.com/problems/minimum-deletions-to-make-string-balanced)  |  [使字符串平衡的最少删除次数](/solution/1600-1699/1653.Minimum%20Deletions%20to%20Make%20String%20Balanced/README.md)  |  `贪心算法`,`字符串`  |  中等  |    |
|  [1654](https://leetcode-cn.com/problems/minimum-jumps-to-reach-home)  |  [到家的最少跳跃次数](/solution/1600-1699/1654.Minimum%20Jumps%20to%20Reach%20Home/README.md)  |  `广度优先搜索`,`动态规划`  |  中等  |    |
|  [1655](https://leetcode-cn.com/problems/distribute-repeating-integers)  |  [分配重复整数](/solution/1600-1699/1655.Distribute%20Repeating%20Integers/README.md)  |  `动态规划`,`回溯算法`  |  困难  |    |
|  [1656](https://leetcode-cn.com/problems/design-an-ordered-stream)  |  [设计有序流](/solution/1600-1699/1656.Design%20an%20Ordered%20Stream/README.md)  |  `设计`,`数组`  |  简单  |    |
|  [1657](https://leetcode-cn.com/problems/determine-if-two-strings-are-close)  |  [确定两个字符串是否接近](/solution/1600-1699/1657.Determine%20if%20Two%20Strings%20Are%20Close/README.md)  |  `贪心算法`  |  中等  |    |
|  [1658](https://leetcode-cn.com/problems/minimum-operations-to-reduce-x-to-zero)  |  [将 x 减到 0 的最小操作数](/solution/1600-1699/1658.Minimum%20Operations%20to%20Reduce%20X%20to%20Zero/README.md)  |  `贪心算法`,`双指针`,`二分查找`  |  中等  |    |
|  [1659](https://leetcode-cn.com/problems/maximize-grid-happiness)  |  [最大化网格幸福感](/solution/1600-1699/1659.Maximize%20Grid%20Happiness/README.md)  |  `动态规划`,`回溯算法`  |  困难  |    |
|  [1660](https://leetcode-cn.com/problems/correct-a-binary-tree)  |  [纠正二叉树](/solution/1600-1699/1660.Correct%20a%20Binary%20Tree/README.md)  |  `树`  |  中等  |  🔒  |
|  [1661](https://leetcode-cn.com/problems/average-time-of-process-per-machine)  |  [每台机器的进程平均运行时间](/solution/1600-1699/1661.Average%20Time%20of%20Process%20per%20Machine/README.md)  |    |  简单  |  🔒  |
|  [1662](https://leetcode-cn.com/problems/check-if-two-string-arrays-are-equivalent)  |  [检查两个字符串数组是否相等](/solution/1600-1699/1662.Check%20If%20Two%20String%20Arrays%20are%20Equivalent/README.md)  |  `字符串`  |  简单  |    |
|  [1663](https://leetcode-cn.com/problems/smallest-string-with-a-given-numeric-value)  |  [具有给定数值的最小字符串](/solution/1600-1699/1663.Smallest%20String%20With%20A%20Given%20Numeric%20Value/README.md)  |  `贪心算法`  |  中等  |    |
|  [1664](https://leetcode-cn.com/problems/ways-to-make-a-fair-array)  |  [生成平衡数组的方案数](/solution/1600-1699/1664.Ways%20to%20Make%20a%20Fair%20Array/README.md)  |  `贪心算法`,`动态规划`  |  中等  |    |
|  [1665](https://leetcode-cn.com/problems/minimum-initial-energy-to-finish-tasks)  |  [完成所有任务的最少初始能量](/solution/1600-1699/1665.Minimum%20Initial%20Energy%20to%20Finish%20Tasks/README.md)  |  `贪心算法`  |  困难  |    |
|  [1666](https://leetcode-cn.com/problems/change-the-root-of-a-binary-tree)  |  [改变二叉树的根节点](/solution/1600-1699/1666.Change%20the%20Root%20of%20a%20Binary%20Tree/README.md)  |  `树`,`深度优先搜索`  |  中等  |  🔒  |
|  [1667](https://leetcode-cn.com/problems/fix-names-in-a-table)  |  [修复表中的名字](/solution/1600-1699/1667.Fix%20Names%20in%20a%20Table/README.md)  |    |  简单  |  🔒  |
|  [1668](https://leetcode-cn.com/problems/maximum-repeating-substring)  |  [最大重复子字符串](/solution/1600-1699/1668.Maximum%20Repeating%20Substring/README.md)  |  `字符串`  |  简单  |    |
|  [1669](https://leetcode-cn.com/problems/merge-in-between-linked-lists)  |  [合并两个链表](/solution/1600-1699/1669.Merge%20In%20Between%20Linked%20Lists/README.md)  |  `链表`  |  中等  |    |
|  [1670](https://leetcode-cn.com/problems/design-front-middle-back-queue)  |  [设计前中后队列](/solution/1600-1699/1670.Design%20Front%20Middle%20Back%20Queue/README.md)  |  `设计`,`链表`  |  中等  |    |
|  [1671](https://leetcode-cn.com/problems/minimum-number-of-removals-to-make-mountain-array)  |  [得到山形数组的最少删除次数](/solution/1600-1699/1671.Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/README.md)  |  `动态规划`  |  困难  |    |
|  [1672](https://leetcode-cn.com/problems/richest-customer-wealth)  |  [最富有客户的资产总量](/solution/1600-1699/1672.Richest%20Customer%20Wealth/README.md)  |  `数组`  |  简单  |    |
|  [1673](https://leetcode-cn.com/problems/find-the-most-competitive-subsequence)  |  [找出最具竞争力的子序列](/solution/1600-1699/1673.Find%20the%20Most%20Competitive%20Subsequence/README.md)  |  `栈`,`堆`,`贪心算法`,`队列`  |  中等  |    |
|  [1674](https://leetcode-cn.com/problems/minimum-moves-to-make-array-complementary)  |  [使数组互补的最少操作次数](/solution/1600-1699/1674.Minimum%20Moves%20to%20Make%20Array%20Complementary/README.md)  |  `贪心算法`  |  中等  |    |
|  [1675](https://leetcode-cn.com/problems/minimize-deviation-in-array)  |  [数组的最小偏移量](/solution/1600-1699/1675.Minimize%20Deviation%20in%20Array/README.md)  |  `堆`  |  困难  |    |
|  [1676](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree-iv)  |  [二叉树的最近公共祖先 IV](/solution/1600-1699/1676.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20IV/README.md)  |  `树`,`深度优先搜索`  |  中等  |  🔒  |
|  [1677](https://leetcode-cn.com/problems/products-worth-over-invoices)  |  [发票中的产品金额](/solution/1600-1699/1677.Product%27s%20Worth%20Over%20Invoices/README.md)  |    |  简单  |  🔒  |
|  [1678](https://leetcode-cn.com/problems/goal-parser-interpretation)  |  [设计 Goal 解析器](/solution/1600-1699/1678.Goal%20Parser%20Interpretation/README.md)  |  `字符串`  |  简单  |    |
|  [1679](https://leetcode-cn.com/problems/max-number-of-k-sum-pairs)  |  [K 和数对的最大数目](/solution/1600-1699/1679.Max%20Number%20of%20K-Sum%20Pairs/README.md)  |  `哈希表`  |  中等  |    |
|  [1680](https://leetcode-cn.com/problems/concatenation-of-consecutive-binary-numbers)  |  [连接连续二进制数字](/solution/1600-1699/1680.Concatenation%20of%20Consecutive%20Binary%20Numbers/README.md)  |  `数学`  |  中等  |    |
|  [1681](https://leetcode-cn.com/problems/minimum-incompatibility)  |  [最小不兼容性](/solution/1600-1699/1681.Minimum%20Incompatibility/README.md)  |  `贪心算法`,`回溯算法`  |  困难  |    |
|  [1682](https://leetcode-cn.com/problems/longest-palindromic-subsequence-ii)  |  [最长回文子序列 II](/solution/1600-1699/1682.Longest%20Palindromic%20Subsequence%20II/README.md)  |  `字符串`,`动态规划`  |  中等  |  🔒  |
|  [1683](https://leetcode-cn.com/problems/invalid-tweets)  |  [无效的推文](/solution/1600-1699/1683.Invalid%20Tweets/README.md)  |    |  简单  |  🔒  |
|  [1684](https://leetcode-cn.com/problems/count-the-number-of-consistent-strings)  |  [统计一致字符串的数目](/solution/1600-1699/1684.Count%20the%20Number%20of%20Consistent%20Strings/README.md)  |  `字符串`  |  简单  |    |
|  [1685](https://leetcode-cn.com/problems/sum-of-absolute-differences-in-a-sorted-array)  |  [有序数组中差绝对值之和](/solution/1600-1699/1685.Sum%20of%20Absolute%20Differences%20in%20a%20Sorted%20Array/README.md)  |  `贪心算法`,`数学`  |  中等  |    |
|  [1686](https://leetcode-cn.com/problems/stone-game-vi)  |  [石子游戏 VI](/solution/1600-1699/1686.Stone%20Game%20VI/README.md)  |  `贪心算法`  |  中等  |    |
|  [1687](https://leetcode-cn.com/problems/delivering-boxes-from-storage-to-ports)  |  [从仓库到码头运输箱子](/solution/1600-1699/1687.Delivering%20Boxes%20from%20Storage%20to%20Ports/README.md)  |  `线段树`,`双指针`,`动态规划`  |  困难  |    |
|  [1688](https://leetcode-cn.com/problems/count-of-matches-in-tournament)  |  [比赛中的配对次数](/solution/1600-1699/1688.Count%20of%20Matches%20in%20Tournament/README.md)  |  `回溯算法`  |  简单  |    |
|  [1689](https://leetcode-cn.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers)  |  [十-二进制数的最少数目](/solution/1600-1699/1689.Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers/README.md)  |  `贪心算法`  |  中等  |    |
|  [1690](https://leetcode-cn.com/problems/stone-game-vii)  |  [石子游戏 VII](/solution/1600-1699/1690.Stone%20Game%20VII/README.md)  |  `动态规划`  |  中等  |    |
|  [1691](https://leetcode-cn.com/problems/maximum-height-by-stacking-cuboids)  |  [堆叠长方体的最大高度](/solution/1600-1699/1691.Maximum%20Height%20by%20Stacking%20Cuboids/README.md)  |  `排序`,`动态规划`  |  困难  |    |
|  [1692](https://leetcode-cn.com/problems/count-ways-to-distribute-candies)  |  [计算分配糖果的不同方式](/solution/1600-1699/1692.Count%20Ways%20to%20Distribute%20Candies/README.md)  |  `动态规划`  |  困难  |  🔒  |
|  [1693](https://leetcode-cn.com/problems/daily-leads-and-partners)  |  [每天的领导和合伙人](/solution/1600-1699/1693.Daily%20Leads%20and%20Partners/README.md)  |    |  简单  |  🔒  |
|  [1694](https://leetcode-cn.com/problems/reformat-phone-number)  |  [重新格式化电话号码](/solution/1600-1699/1694.Reformat%20Phone%20Number/README.md)  |  `字符串`  |  简单  |    |
|  [1695](https://leetcode-cn.com/problems/maximum-erasure-value)  |  [删除子数组的最大得分](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README.md)  |  `双指针`  |  中等  |    |
|  [1696](https://leetcode-cn.com/problems/jump-game-vi)  |  [跳跃游戏 VI](/solution/1600-1699/1696.Jump%20Game%20VI/README.md)  |    |  中等  |    |
|  [1697](https://leetcode-cn.com/problems/checking-existence-of-edge-length-limited-paths)  |  [检查边长度限制的路径是否存在](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README.md)  |  `排序`,`并查集`  |  困难  |    |
|  [1698](https://leetcode-cn.com/problems/number-of-distinct-substrings-in-a-string)  |  [字符串的不同子字符串个数](/solution/1600-1699/1698.Number%20of%20Distinct%20Substrings%20in%20a%20String/README.md)  |  `字典树`,`字符串`  |  中等  |  🔒  |
|  [1699](https://leetcode-cn.com/problems/number-of-calls-between-two-persons)  |  [两人之间的通话次数](/solution/1600-1699/1699.Number%20of%20Calls%20Between%20Two%20Persons/README.md)  |    |  中等  |  🔒  |
|  [1700](https://leetcode-cn.com/problems/number-of-students-unable-to-eat-lunch)  |  [无法吃午餐的学生数量](/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README.md)  |  `数组`  |  简单  |    |
|  [1701](https://leetcode-cn.com/problems/average-waiting-time)  |  [平均等待时间](/solution/1700-1799/1701.Average%20Waiting%20Time/README.md)  |  `数组`  |  中等  |    |
|  [1702](https://leetcode-cn.com/problems/maximum-binary-string-after-change)  |  [修改后的最大二进制字符串](/solution/1700-1799/1702.Maximum%20Binary%20String%20After%20Change/README.md)  |  `贪心算法`  |  中等  |    |
|  [1703](https://leetcode-cn.com/problems/minimum-adjacent-swaps-for-k-consecutive-ones)  |  [得到连续 K 个 1 的最少相邻交换次数](/solution/1700-1799/1703.Minimum%20Adjacent%20Swaps%20for%20K%20Consecutive%20Ones/README.md)  |  `栈`  |  困难  |    |
|  [1704](https://leetcode-cn.com/problems/determine-if-string-halves-are-alike)  |  [判断字符串的两半是否相似](/solution/1700-1799/1704.Determine%20if%20String%20Halves%20Are%20Alike/README.md)  |  `字符串`  |  简单  |    |
|  [1705](https://leetcode-cn.com/problems/maximum-number-of-eaten-apples)  |  [吃苹果的最大数目](/solution/1700-1799/1705.Maximum%20Number%20of%20Eaten%20Apples/README.md)  |  `堆`,`贪心算法`  |  中等  |    |
|  [1706](https://leetcode-cn.com/problems/where-will-the-ball-fall)  |  [球会落何处](/solution/1700-1799/1706.Where%20Will%20the%20Ball%20Fall/README.md)  |  `动态规划`  |  中等  |    |
|  [1707](https://leetcode-cn.com/problems/maximum-xor-with-an-element-from-array)  |  [与数组中元素的最大异或值](/solution/1700-1799/1707.Maximum%20XOR%20With%20an%20Element%20From%20Array/README.md)  |  `位运算`,`字典树`  |  困难  |    |
|  [1708](https://leetcode-cn.com/problems/largest-subarray-length-k)  |  [长度为 K 的最大子数组](/solution/1700-1799/1708.Largest%20Subarray%20Length%20K/README.md)  |  `贪心算法`,`数组`  |  简单  |  🔒  |
|  [1709](https://leetcode-cn.com/problems/biggest-window-between-visits)  |  [访问日期之间最大的空档期](/solution/1700-1799/1709.Biggest%20Window%20Between%20Visits/README.md)  |    |  中等  |  🔒  |
|  [1710](https://leetcode-cn.com/problems/maximum-units-on-a-truck)  |  [卡车上的最大单元数](/solution/1700-1799/1710.Maximum%20Units%20on%20a%20Truck/README.md)  |  `贪心算法`,`排序`  |  简单  |    |
|  [1711](https://leetcode-cn.com/problems/count-good-meals)  |  [大餐计数](/solution/1700-1799/1711.Count%20Good%20Meals/README.md)  |  `数组`,`哈希表`,`双指针`  |  中等  |    |
|  [1712](https://leetcode-cn.com/problems/ways-to-split-array-into-three-subarrays)  |  [将数组分成三个子数组的方案数](/solution/1700-1799/1712.Ways%20to%20Split%20Array%20Into%20Three%20Subarrays/README.md)  |  `双指针`,`二分查找`  |  中等  |    |
|  [1713](https://leetcode-cn.com/problems/minimum-operations-to-make-a-subsequence)  |  [得到子序列的最少操作次数](/solution/1700-1799/1713.Minimum%20Operations%20to%20Make%20a%20Subsequence/README.md)  |  `贪心算法`  |  困难  |    |
|  [1714](https://leetcode-cn.com/problems/sum-of-special-evenly-spaced-elements-in-array)  |  [数组中特殊等间距元素的和](/solution/1700-1799/1714.Sum%20Of%20Special%20Evenly-Spaced%20Elements%20In%20Array/README.md)  |    |  困难  |  🔒  |
|  [1715](https://leetcode-cn.com/problems/count-apples-and-oranges)  |  [苹果和橘子的个数](/solution/1700-1799/1715.Count%20Apples%20and%20Oranges/README.md)  |    |  中等  |  🔒  |
|  [1716](https://leetcode-cn.com/problems/calculate-money-in-leetcode-bank)  |  [计算力扣银行的钱](/solution/1700-1799/1716.Calculate%20Money%20in%20Leetcode%20Bank/README.md)  |  `贪心算法`,`数学`  |  简单  |    |
|  [1717](https://leetcode-cn.com/problems/maximum-score-from-removing-substrings)  |  [删除子字符串的最大得分](/solution/1700-1799/1717.Maximum%20Score%20From%20Removing%20Substrings/README.md)  |  `贪心算法`  |  中等  |    |
|  [1718](https://leetcode-cn.com/problems/construct-the-lexicographically-largest-valid-sequence)  |  [构建字典序最大的可行序列](/solution/1700-1799/1718.Construct%20the%20Lexicographically%20Largest%20Valid%20Sequence/README.md)  |  `递归`,`回溯算法`  |  中等  |    |
|  [1719](https://leetcode-cn.com/problems/number-of-ways-to-reconstruct-a-tree)  |  [重构一棵树的方案数](/solution/1700-1799/1719.Number%20Of%20Ways%20To%20Reconstruct%20A%20Tree/README.md)  |  `树`,`图`  |  困难  |    |
|  [1720](https://leetcode-cn.com/problems/decode-xored-array)  |  [解码异或后的数组](/solution/1700-1799/1720.Decode%20XORed%20Array/README.md)  |  `位运算`  |  简单  |    |
|  [1721](https://leetcode-cn.com/problems/swapping-nodes-in-a-linked-list)  |  [交换链表中的节点](/solution/1700-1799/1721.Swapping%20Nodes%20in%20a%20Linked%20List/README.md)  |  `链表`  |  中等  |    |
|  [1722](https://leetcode-cn.com/problems/minimize-hamming-distance-after-swap-operations)  |  [执行交换操作后的最小汉明距离](/solution/1700-1799/1722.Minimize%20Hamming%20Distance%20After%20Swap%20Operations/README.md)  |  `贪心算法`,`深度优先搜索`,`并查集`  |  中等  |    |
|  [1723](https://leetcode-cn.com/problems/find-minimum-time-to-finish-all-jobs)  |  [完成所有工作的最短时间](/solution/1700-1799/1723.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs/README.md)  |  `递归`,`回溯算法`  |  困难  |    |
|  [1724](https://leetcode-cn.com/problems/checking-existence-of-edge-length-limited-paths-ii)  |  [检查边长度限制的路径是否存在 II](/solution/1700-1799/1724.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths%20II/README.md)  |  `并查集`,`图`,`动态规划`  |  困难  |  🔒  |
|  [1725](https://leetcode-cn.com/problems/number-of-rectangles-that-can-form-the-largest-square)  |  [可以形成最大正方形的矩形数目](/solution/1700-1799/1725.Number%20Of%20Rectangles%20That%20Can%20Form%20The%20Largest%20Square/README.md)  |  `贪心算法`  |  简单  |    |
|  [1726](https://leetcode-cn.com/problems/tuple-with-same-product)  |  [同积元组](/solution/1700-1799/1726.Tuple%20with%20Same%20Product/README.md)  |  `数组`,`哈希表`  |  中等  |    |
|  [1727](https://leetcode-cn.com/problems/largest-submatrix-with-rearrangements)  |  [重新排列后的最大子矩阵](/solution/1700-1799/1727.Largest%20Submatrix%20With%20Rearrangements/README.md)  |  `贪心算法`,`排序`  |  中等  |    |
|  [1728](https://leetcode-cn.com/problems/cat-and-mouse-ii)  |  [猫和老鼠 II](/solution/1700-1799/1728.Cat%20and%20Mouse%20II/README.md)  |  `动态规划`  |  困难  |    |
|  [1729](https://leetcode-cn.com/problems/find-followers-count)  |  [求关注者的数量](/solution/1700-1799/1729.Find%20Followers%20Count/README.md)  |    |  简单  |  🔒  |
|  [1730](https://leetcode-cn.com/problems/shortest-path-to-get-food)  |  [获取食物的最短路径](/solution/1700-1799/1730.Shortest%20Path%20to%20Get%20Food/README.md)  |  `深度优先搜索`,`广度优先搜索`,`图`  |  中等  |  🔒  |
|  [1731](https://leetcode-cn.com/problems/the-number-of-employees-which-report-to-each-employee)  |  [每位经理的下属员工数量](/solution/1700-1799/1731.The%20Number%20of%20Employees%20Which%20Report%20to%20Each%20Employee/README.md)  |    |  简单  |  🔒  |
|  [1732](https://leetcode-cn.com/problems/find-the-highest-altitude)  |  [找到最高海拔](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README.md)  |  `数组`  |  简单  |    |
|  [1733](https://leetcode-cn.com/problems/minimum-number-of-people-to-teach)  |  [需要教语言的最少人数](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README.md)  |  `贪心算法`,`数组`  |  中等  |    |
|  [1734](https://leetcode-cn.com/problems/decode-xored-permutation)  |  [解码异或后的排列](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README.md)  |  `位运算`  |  中等  |    |
|  [1735](https://leetcode-cn.com/problems/count-ways-to-make-array-with-product)  |  [生成乘积数组的方案数](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README.md)  |  `数学`  |  困难  |    |
|  [1736](https://leetcode-cn.com/problems/latest-time-by-replacing-hidden-digits)  |  [替换隐藏数字得到的最晚时间](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README.md)  |  `贪心算法`,`字符串`  |  简单  |    |
|  [1737](https://leetcode-cn.com/problems/change-minimum-characters-to-satisfy-one-of-three-conditions)  |  [满足三条件之一需改变的最少字符数](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README.md)  |  `贪心算法`,`字符串`  |  中等  |    |
|  [1738](https://leetcode-cn.com/problems/find-kth-largest-xor-coordinate-value)  |  [找出第 K 大的异或坐标值](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README.md)  |  `数组`  |  中等  |    |
|  [1739](https://leetcode-cn.com/problems/building-boxes)  |  [放置盒子](/solution/1700-1799/1739.Building%20Boxes/README.md)  |  `数学`,`二分查找`  |  困难  |    |
|  [1740](https://leetcode-cn.com/problems/find-distance-in-a-binary-tree)  |  [找到二叉树中的距离](/solution/1700-1799/1740.Find%20Distance%20in%20a%20Binary%20Tree/README.md)  |  `树`,`深度优先搜索`,`广度优先搜索`  |  中等  |  🔒  |
|  [1741](https://leetcode-cn.com/problems/find-total-time-spent-by-each-employee)  |  [查找每个员工花费的总时间](/solution/1700-1799/1741.Find%20Total%20Time%20Spent%20by%20Each%20Employee/README.md)  |    |  简单  |  🔒  |
|  [1742](https://leetcode-cn.com/problems/maximum-number-of-balls-in-a-box)  |  [盒子中小球的最大数量](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README.md)  |  `数组`  |  简单  |    |
|  [1743](https://leetcode-cn.com/problems/restore-the-array-from-adjacent-pairs)  |  [从相邻元素对还原数组](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README.md)  |  `贪心算法`  |  中等  |    |
|  [1744](https://leetcode-cn.com/problems/can-you-eat-your-favorite-candy-on-your-favorite-day)  |  [你能在你最喜欢的那天吃到你最喜欢的糖果吗？](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README.md)  |  `数学`  |  中等  |    |
|  [1745](https://leetcode-cn.com/problems/palindrome-partitioning-iv)  |  [回文串分割 IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README.md)  |  `字符串`,`动态规划`  |  困难  |    |
|  [1746](https://leetcode-cn.com/problems/maximum-subarray-sum-after-one-operation)  |  [经过一次操作后的最大子数组和](/solution/1700-1799/1746.Maximum%20Subarray%20Sum%20After%20One%20Operation/README.md)  |  `动态规划`  |  中等  |  🔒  |
|  [1747](https://leetcode-cn.com/problems/leetflex-banned-accounts)  |  [应该被禁止的Leetflex账户](/solution/1700-1799/1747.Leetflex%20Banned%20Accounts/README.md)  |    |  中等  |  🔒  |
|  [1748](https://leetcode-cn.com/problems/sum-of-unique-elements)  |  [唯一元素的和](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README.md)  |  `数组`,`哈希表`  |  简单  |    |
|  [1749](https://leetcode-cn.com/problems/maximum-absolute-sum-of-any-subarray)  |  [任意子数组和的绝对值的最大值](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README.md)  |  `贪心算法`  |  中等  |    |
|  [1750](https://leetcode-cn.com/problems/minimum-length-of-string-after-deleting-similar-ends)  |  [删除字符串两端相同字符后的最短长度](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README.md)  |  `双指针`  |  中等  |    |
|  [1751](https://leetcode-cn.com/problems/maximum-number-of-events-that-can-be-attended-ii)  |  [最多可以参加的会议数目 II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md)  |  `二分查找`,`动态规划`  |  困难  |    |
|  [1752](https://leetcode-cn.com/problems/check-if-array-is-sorted-and-rotated)  |  [检查数组是否经排序和轮转得到](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README.md)  |  `数组`  |  简单  |    |
|  [1753](https://leetcode-cn.com/problems/maximum-score-from-removing-stones)  |  [移除石子的最大得分](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README.md)  |  `堆`,`数学`  |  中等  |    |
|  [1754](https://leetcode-cn.com/problems/largest-merge-of-two-strings)  |  [构造字典序最大的合并字符串](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README.md)  |  `贪心算法`  |  中等  |    |
|  [1755](https://leetcode-cn.com/problems/closest-subsequence-sum)  |  [最接近目标值的子序列和](/solution/1700-1799/1755.Closest%20Subsequence%20Sum/README.md)  |  `分治算法`  |  困难  |    |
|  [1756](https://leetcode-cn.com/problems/design-most-recently-used-queue)  |  [设计最近使用（MRU）队列](/solution/1700-1799/1756.Design%20Most%20Recently%20Used%20Queue/README.md)  |  `设计`,`数组`  |  中等  |  🔒  |
|  [1757](https://leetcode-cn.com/problems/recyclable-and-low-fat-products)  |  [可回收且低脂的产品](/solution/1700-1799/1757.Recyclable%20and%20Low%20Fat%20Products/README.md)  |    |  简单  |  🔒  |
|  [1758](https://leetcode-cn.com/problems/minimum-changes-to-make-alternating-binary-string)  |  [生成交替二进制字符串的最少操作数](/solution/1700-1799/1758.Minimum%20Changes%20To%20Make%20Alternating%20Binary%20String/README.md)  |  `贪心算法`,`数组`  |  简单  |    |
|  [1759](https://leetcode-cn.com/problems/count-number-of-homogenous-substrings)  |  [统计同构子字符串的数目](/solution/1700-1799/1759.Count%20Number%20of%20Homogenous%20Substrings/README.md)  |  `贪心算法`,`字符串`  |  中等  |    |
|  [1760](https://leetcode-cn.com/problems/minimum-limit-of-balls-in-a-bag)  |  [袋子里最少数目的球](/solution/1700-1799/1760.Minimum%20Limit%20of%20Balls%20in%20a%20Bag/README.md)  |  `堆`,`二分查找`  |  中等  |    |
|  [1761](https://leetcode-cn.com/problems/minimum-degree-of-a-connected-trio-in-a-graph)  |  [一个图中连通三元组的最小度数](/solution/1700-1799/1761.Minimum%20Degree%20of%20a%20Connected%20Trio%20in%20a%20Graph/README.md)  |  `图`  |  困难  |    |
|  [1762](https://leetcode-cn.com/problems/buildings-with-an-ocean-view)  |  [能看到海景的建筑物](/solution/1700-1799/1762.Buildings%20With%20an%20Ocean%20View/README.md)  |  `贪心算法`  |  中等  |  🔒  |
|  [1763](https://leetcode-cn.com/problems/longest-nice-substring)  |  [最长的美好子字符串](/solution/1700-1799/1763.Longest%20Nice%20Substring/README.md)  |  `字符串`  |  简单  |    |
|  [1764](https://leetcode-cn.com/problems/form-array-by-concatenating-subarrays-of-another-array)  |  [通过连接另一个数组的子数组得到一个数组](/solution/1700-1799/1764.Form%20Array%20by%20Concatenating%20Subarrays%20of%20Another%20Array/README.md)  |  `贪心算法`,`数组`  |  中等  |    |
|  [1765](https://leetcode-cn.com/problems/map-of-highest-peak)  |  [地图中的最高点](/solution/1700-1799/1765.Map%20of%20Highest%20Peak/README.md)  |  `广度优先搜索`,`图`  |  中等  |    |
|  [1766](https://leetcode-cn.com/problems/tree-of-coprimes)  |  [互质树](/solution/1700-1799/1766.Tree%20of%20Coprimes/README.md)  |  `树`,`深度优先搜索`,`广度优先搜索`,`数学`  |  困难  |    |
|  [1767](https://leetcode-cn.com/problems/find-the-subtasks-that-did-not-execute)  |  [寻找没有被执行的任务对](/solution/1700-1799/1767.Find%20the%20Subtasks%20That%20Did%20Not%20Execute/README.md)  |    |  困难  |  🔒  |
|  [1768](https://leetcode-cn.com/problems/merge-strings-alternately)  |  [交替合并字符串](/solution/1700-1799/1768.Merge%20Strings%20Alternately/README.md)  |  `字符串`  |  简单  |    |
|  [1769](https://leetcode-cn.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box)  |  [移动所有球到每个盒子所需的最小操作数](/solution/1700-1799/1769.Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/README.md)  |  `贪心算法`,`数组`  |  中等  |    |
|  [1770](https://leetcode-cn.com/problems/maximum-score-from-performing-multiplication-operations)  |  [执行乘法运算的最大分数](/solution/1700-1799/1770.Maximum%20Score%20from%20Performing%20Multiplication%20Operations/README.md)  |  `动态规划`  |  中等  |    |
|  [1771](https://leetcode-cn.com/problems/maximize-palindrome-length-from-subsequences)  |  [由子序列构造的最长回文串的长度](/solution/1700-1799/1771.Maximize%20Palindrome%20Length%20From%20Subsequences/README.md)  |  `动态规划`  |  困难  |    |
|  [1772](https://leetcode-cn.com/problems/sort-features-by-popularity)  |  [按受欢迎程度排列功能](/solution/1700-1799/1772.Sort%20Features%20by%20Popularity/README.md)  |  `排序`,`哈希表`  |  中等  |  🔒  |
|  [1773](https://leetcode-cn.com/problems/count-items-matching-a-rule)  |  [统计匹配检索规则的物品数量](/solution/1700-1799/1773.Count%20Items%20Matching%20a%20Rule/README.md)  |  `数组`,`字符串`  |  简单  |    |
|  [1774](https://leetcode-cn.com/problems/closest-dessert-cost)  |  [最接近目标价格的甜点成本](/solution/1700-1799/1774.Closest%20Dessert%20Cost/README.md)  |  `贪心算法`  |  中等  |    |
|  [1775](https://leetcode-cn.com/problems/equal-sum-arrays-with-minimum-number-of-operations)  |  [通过最少操作次数使数组的和相等](/solution/1700-1799/1775.Equal%20Sum%20Arrays%20With%20Minimum%20Number%20of%20Operations/README.md)  |  `贪心算法`  |  中等  |    |
|  [1776](https://leetcode-cn.com/problems/car-fleet-ii)  |  [车队 II](/solution/1700-1799/1776.Car%20Fleet%20II/README.md)  |  `数学`  |  困难  |    |
|  [1777](https://leetcode-cn.com/problems/products-price-for-each-store)  |  [每家商店的产品价格](/solution/1700-1799/1777.Product%27s%20Price%20for%20Each%20Store/README.md)  |    |  简单  |  🔒  |
|  [1778](https://leetcode-cn.com/problems/shortest-path-in-a-hidden-grid)  |  [Shortest Path in a Hidden Grid](/solution/1700-1799/1778.Shortest%20Path%20in%20a%20Hidden%20Grid/README.md)  |  `深度优先搜索`,`广度优先搜索`,`图`  |  中等  |  🔒  |
|  [1779](https://leetcode-cn.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate)  |  [找到最近的有相同 X 或 Y 坐标的点](/solution/1700-1799/1779.Find%20Nearest%20Point%20That%20Has%20the%20Same%20X%20or%20Y%20Coordinate/README.md)  |  `数组`  |  简单  |    |
|  [1780](https://leetcode-cn.com/problems/check-if-number-is-a-sum-of-powers-of-three)  |  [判断一个数字是否可以表示成三的幂的和](/solution/1700-1799/1780.Check%20if%20Number%20is%20a%20Sum%20of%20Powers%20of%20Three/README.md)  |  `递归`,`数学`,`回溯算法`  |  中等  |    |
|  [1781](https://leetcode-cn.com/problems/sum-of-beauty-of-all-substrings)  |  [所有子字符串美丽值之和](/solution/1700-1799/1781.Sum%20of%20Beauty%20of%20All%20Substrings/README.md)  |  `哈希表`,`字符串`  |  中等  |    |
|  [1782](https://leetcode-cn.com/problems/count-pairs-of-nodes)  |  [统计点对的数目](/solution/1700-1799/1782.Count%20Pairs%20Of%20Nodes/README.md)  |  `图`  |  困难  |    |
|  [1783](https://leetcode-cn.com/problems/grand-slam-titles)  |  [大满贯数量](/solution/1700-1799/1783.Grand%20Slam%20Titles/README.md)  |    |  中等  |  🔒  |
|  [1784](https://leetcode-cn.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones)  |  [检查二进制字符串字段](/solution/1700-1799/1784.Check%20if%20Binary%20String%20Has%20at%20Most%20One%20Segment%20of%20Ones/README.md)  |  `贪心算法`  |  简单  |    |
|  [1785](https://leetcode-cn.com/problems/minimum-elements-to-add-to-form-a-given-sum)  |  [构成特定和需要添加的最少元素](/solution/1700-1799/1785.Minimum%20Elements%20to%20Add%20to%20Form%20a%20Given%20Sum/README.md)  |  `贪心算法`  |  中等  |    |
|  [1786](https://leetcode-cn.com/problems/number-of-restricted-paths-from-first-to-last-node)  |  [从第一个节点出发到最后一个节点的受限路径数](/solution/1700-1799/1786.Number%20of%20Restricted%20Paths%20From%20First%20to%20Last%20Node/README.md)  |  `图`,`动态规划`  |  中等  |    |
|  [1787](https://leetcode-cn.com/problems/make-the-xor-of-all-segments-equal-to-zero)  |  [使所有区间的异或结果为零](/solution/1700-1799/1787.Make%20the%20XOR%20of%20All%20Segments%20Equal%20to%20Zero/README.md)  |  `动态规划`  |  困难  |    |
|  [1788](https://leetcode-cn.com/problems/maximize-the-beauty-of-the-garden)  |  [最大化花园的美观度](/solution/1700-1799/1788.Maximize%20the%20Beauty%20of%20the%20Garden/README.md)  |  `贪心算法`  |  困难  |  🔒  |
|  [1789](https://leetcode-cn.com/problems/primary-department-for-each-employee)  |  [员工的直属部门](/solution/1700-1799/1789.Primary%20Department%20for%20Each%20Employee/README.md)  |    |  简单  |  🔒  |
|  [1790](https://leetcode-cn.com/problems/check-if-one-string-swap-can-make-strings-equal)  |  [仅执行一次字符串交换能否使两个字符串相等](/solution/1700-1799/1790.Check%20if%20One%20String%20Swap%20Can%20Make%20Strings%20Equal/README.md)  |  `字符串`  |  简单  |    |
|  [1791](https://leetcode-cn.com/problems/find-center-of-star-graph)  |  [找出星型图的中心节点](/solution/1700-1799/1791.Find%20Center%20of%20Star%20Graph/README.md)  |  `图`  |  中等  |    |
|  [1792](https://leetcode-cn.com/problems/maximum-average-pass-ratio)  |  [最大平均通过率](/solution/1700-1799/1792.Maximum%20Average%20Pass%20Ratio/README.md)  |  `堆`  |  中等  |    |
|  [1793](https://leetcode-cn.com/problems/maximum-score-of-a-good-subarray)  |  [好子数组的最大分数](/solution/1700-1799/1793.Maximum%20Score%20of%20a%20Good%20Subarray/README.md)  |  `贪心算法`  |  困难  |    |
|  [1794](https://leetcode-cn.com/problems/count-pairs-of-equal-substrings-with-minimum-difference)  |  [统计距离最小的子串对个数](/solution/1700-1799/1794.Count%20Pairs%20of%20Equal%20Substrings%20With%20Minimum%20Difference/README.md)  |  `贪心算法`,`字符串`  |  中等  |  🔒  |
|  [1795](https://leetcode-cn.com/problems/rearrange-products-table)  |  [每个产品在不同商店的价格](/solution/1700-1799/1795.Rearrange%20Products%20Table/README.md)  |    |  简单  |  🔒  |
|  [1796](https://leetcode-cn.com/problems/second-largest-digit-in-a-string)  |  [字符串中第二大的数字](/solution/1700-1799/1796.Second%20Largest%20Digit%20in%20a%20String/README.md)  |  `字符串`  |  简单  |    |
|  [1797](https://leetcode-cn.com/problems/design-authentication-manager)  |  [设计一个验证系统](/solution/1700-1799/1797.Design%20Authentication%20Manager/README.md)  |  `设计`,`哈希表`  |  中等  |    |
|  [1798](https://leetcode-cn.com/problems/maximum-number-of-consecutive-values-you-can-make)  |  [你能构造出连续值的最大数目](/solution/1700-1799/1798.Maximum%20Number%20of%20Consecutive%20Values%20You%20Can%20Make/README.md)  |  `贪心算法`  |  中等  |    |
|  [1799](https://leetcode-cn.com/problems/maximize-score-after-n-operations)  |  [N 次操作后的最大分数和](/solution/1700-1799/1799.Maximize%20Score%20After%20N%20Operations/README.md)  |  `递归`,`动态规划`,`回溯算法`  |  困难  |    |
|  [1800](https://leetcode-cn.com/problems/maximum-ascending-subarray-sum)  |  [最大升序子数组和](/solution/1800-1899/1800.Maximum%20Ascending%20Subarray%20Sum/README.md)  |  `双指针`  |  简单  |    |
|  [1801](https://leetcode-cn.com/problems/number-of-orders-in-the-backlog)  |  [积压订单中的订单总数](/solution/1800-1899/1801.Number%20of%20Orders%20in%20the%20Backlog/README.md)  |  `堆`,`贪心算法`  |  中等  |    |
|  [1802](https://leetcode-cn.com/problems/maximum-value-at-a-given-index-in-a-bounded-array)  |  [有界数组中指定下标处的最大值](/solution/1800-1899/1802.Maximum%20Value%20at%20a%20Given%20Index%20in%20a%20Bounded%20Array/README.md)  |  `贪心算法`,`二分查找`  |  中等  |    |
|  [1803](https://leetcode-cn.com/problems/count-pairs-with-xor-in-a-range)  |  [统计异或值在范围内的数对有多少](/solution/1800-1899/1803.Count%20Pairs%20With%20XOR%20in%20a%20Range/README.md)  |  `字典树`  |  困难  |    |
|  [1804](https://leetcode-cn.com/problems/implement-trie-ii-prefix-tree)  |  [实现 Trie （前缀树） II](/solution/1800-1899/1804.Implement%20Trie%20II%20%28Prefix%20Tree%29/README.md)  |  `字典树`,`字符串`  |  中等  |  🔒  |
|  [1805](https://leetcode-cn.com/problems/number-of-different-integers-in-a-string)  |  [字符串中不同整数的数目](/solution/1800-1899/1805.Number%20of%20Different%20Integers%20in%20a%20String/README.md)  |  `字符串`  |  简单  |    |
|  [1806](https://leetcode-cn.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation)  |  [还原排列的最少操作步数](/solution/1800-1899/1806.Minimum%20Number%20of%20Operations%20to%20Reinitialize%20a%20Permutation/README.md)  |  `贪心算法`,`数组`  |  中等  |    |
|  [1807](https://leetcode-cn.com/problems/evaluate-the-bracket-pairs-of-a-string)  |  [替换字符串中的括号内容](/solution/1800-1899/1807.Evaluate%20the%20Bracket%20Pairs%20of%20a%20String/README.md)  |  `哈希表`,`字符串`  |  中等  |    |
|  [1808](https://leetcode-cn.com/problems/maximize-number-of-nice-divisors)  |  [好因子的最大数目](/solution/1800-1899/1808.Maximize%20Number%20of%20Nice%20Divisors/README.md)  |  `数学`  |  困难  |    |
|  [1809](https://leetcode-cn.com/problems/ad-free-sessions)  |  [没有广告的剧集](/solution/1800-1899/1809.Ad-Free%20Sessions/README.md)  |    |  简单  |  🔒  |
|  [1810](https://leetcode-cn.com/problems/minimum-path-cost-in-a-hidden-grid)  |  [Minimum Path Cost in a Hidden Grid](/solution/1800-1899/1810.Minimum%20Path%20Cost%20in%20a%20Hidden%20Grid/README.md)  |  `堆`,`深度优先搜索`,`图`  |  中等  |  🔒  |
|  [1811](https://leetcode-cn.com/problems/find-interview-candidates)  |  [Find Interview Candidates](/solution/1800-1899/1811.Find%20Interview%20Candidates/README.md)  |    |  中等  |  🔒  |
|  [1812](https://leetcode-cn.com/problems/determine-color-of-a-chessboard-square)  |  [判断国际象棋棋盘中一个格子的颜色](/solution/1800-1899/1812.Determine%20Color%20of%20a%20Chessboard%20Square/README.md)  |  `字符串`  |  简单  |    |
|  [1813](https://leetcode-cn.com/problems/sentence-similarity-iii)  |  [句子相似性 III](/solution/1800-1899/1813.Sentence%20Similarity%20III/README.md)  |  `字符串`  |  中等  |    |
|  [1814](https://leetcode-cn.com/problems/count-nice-pairs-in-an-array)  |  [统计一个数组中好对子的数目](/solution/1800-1899/1814.Count%20Nice%20Pairs%20in%20an%20Array/README.md)  |  `数组`,`哈希表`  |  中等  |    |
|  [1815](https://leetcode-cn.com/problems/maximum-number-of-groups-getting-fresh-donuts)  |  [得到新鲜甜甜圈的最多组数](/solution/1800-1899/1815.Maximum%20Number%20of%20Groups%20Getting%20Fresh%20Donuts/README.md)  |  `动态规划`  |  困难  |    |
|  [1816](https://leetcode-cn.com/problems/truncate-sentence)  |  [截断句子](/solution/1800-1899/1816.Truncate%20Sentence/README.md)  |  `字符串`  |  简单  |    |
|  [1817](https://leetcode-cn.com/problems/finding-the-users-active-minutes)  |  [查找用户活跃分钟数](/solution/1800-1899/1817.Finding%20the%20Users%20Active%20Minutes/README.md)  |  `哈希表`  |  中等  |    |
|  [1818](https://leetcode-cn.com/problems/minimum-absolute-sum-difference)  |  [绝对差值和](/solution/1800-1899/1818.Minimum%20Absolute%20Sum%20Difference/README.md)  |  `贪心算法`,`二分查找`  |  中等  |    |
|  [1819](https://leetcode-cn.com/problems/number-of-different-subsequences-gcds)  |  [序列中不同最大公约数的数目](/solution/1800-1899/1819.Number%20of%20Different%20Subsequences%20GCDs/README.md)  |  `数学`  |  困难  |    |
|  [1820](https://leetcode-cn.com/problems/maximum-number-of-accepted-invitations)  |  [Maximum Number of Accepted Invitations](/solution/1800-1899/1820.Maximum%20Number%20of%20Accepted%20Invitations/README.md)  |  `图`  |  中等  |  🔒  |
|  [1821](https://leetcode-cn.com/problems/find-customers-with-positive-revenue-this-year)  |  [寻找今年具有正收入的客户](/solution/1800-1899/1821.Find%20Customers%20With%20Positive%20Revenue%20this%20Year/README.md)  |    |  简单  |  🔒  |
|  [1822](https://leetcode-cn.com/problems/sign-of-the-product-of-an-array)  |  [数组元素积的符号](/solution/1800-1899/1822.Sign%20of%20the%20Product%20of%20an%20Array/README.md)  |  `数学`  |  简单  |    |
|  [1823](https://leetcode-cn.com/problems/find-the-winner-of-the-circular-game)  |  [找出游戏的获胜者](/solution/1800-1899/1823.Find%20the%20Winner%20of%20the%20Circular%20Game/README.md)  |  `数组`  |  中等  |    |
|  [1824](https://leetcode-cn.com/problems/minimum-sideway-jumps)  |  [最少侧跳次数](/solution/1800-1899/1824.Minimum%20Sideway%20Jumps/README.md)  |  `广度优先搜索`,`动态规划`  |  中等  |    |
|  [1825](https://leetcode-cn.com/problems/finding-mk-average)  |  [求出 MK 平均值](/solution/1800-1899/1825.Finding%20MK%20Average/README.md)  |  `堆`,`设计`,`队列`  |  困难  |    |
|  [1826](https://leetcode-cn.com/problems/faulty-sensor)  |  [有缺陷的传感器](/solution/1800-1899/1826.Faulty%20Sensor/README.md)  |  `数组`  |  简单  |  🔒  |
|  [1827](https://leetcode-cn.com/problems/minimum-operations-to-make-the-array-increasing)  |  [最少操作使数组递增](/solution/1800-1899/1827.Minimum%20Operations%20to%20Make%20the%20Array%20Increasing/README.md)  |  `贪心算法`,`数组`  |  简单  |    |
|  [1828](https://leetcode-cn.com/problems/queries-on-number-of-points-inside-a-circle)  |  [统计一个圆中点的数目](/solution/1800-1899/1828.Queries%20on%20Number%20of%20Points%20Inside%20a%20Circle/README.md)  |  `数学`  |  中等  |    |
|  [1829](https://leetcode-cn.com/problems/maximum-xor-for-each-query)  |  [每个查询的最大异或值](/solution/1800-1899/1829.Maximum%20XOR%20for%20Each%20Query/README.md)  |  `位运算`  |  中等  |    |
|  [1830](https://leetcode-cn.com/problems/minimum-number-of-operations-to-make-string-sorted)  |  [使字符串有序的最少操作次数](/solution/1800-1899/1830.Minimum%20Number%20of%20Operations%20to%20Make%20String%20Sorted/README.md)  |  `数学`,`字符串`  |  困难  |    |
|  [1831](https://leetcode-cn.com/problems/maximum-transaction-each-day)  |  [每天的最大交易](/solution/1800-1899/1831.Maximum%20Transaction%20Each%20Day/README.md)  |    |  中等  |  🔒  |
|  [1832](https://leetcode-cn.com/problems/check-if-the-sentence-is-pangram)  |  [判断句子是否为全字母句](/solution/1800-1899/1832.Check%20if%20the%20Sentence%20Is%20Pangram/README.md)  |  `字符串`  |  简单  |    |
|  [1833](https://leetcode-cn.com/problems/maximum-ice-cream-bars)  |  [雪糕的最大数量](/solution/1800-1899/1833.Maximum%20Ice%20Cream%20Bars/README.md)  |  `排序`,`数组`  |  中等  |    |
|  [1834](https://leetcode-cn.com/problems/single-threaded-cpu)  |  [单线程 CPU](/solution/1800-1899/1834.Single-Threaded%20CPU/README.md)  |  `堆`  |  中等  |    |
|  [1835](https://leetcode-cn.com/problems/find-xor-sum-of-all-pairs-bitwise-and)  |  [所有数对按位与结果的异或和](/solution/1800-1899/1835.Find%20XOR%20Sum%20of%20All%20Pairs%20Bitwise%20AND/README.md)  |  `数学`  |  困难  |    |
|  [1836](https://leetcode-cn.com/problems/remove-duplicates-from-an-unsorted-linked-list)  |  [Remove Duplicates From an Unsorted Linked List](/solution/1800-1899/1836.Remove%20Duplicates%20From%20an%20Unsorted%20Linked%20List/README.md)  |  `链表`  |  中等  |  🔒  |
|  [1837](https://leetcode-cn.com/problems/sum-of-digits-in-base-k)  |  [K 进制表示下的各位数字总和](/solution/1800-1899/1837.Sum%20of%20Digits%20in%20Base%20K/README.md)  |  `位运算`,`数学`  |  简单  |    |
|  [1838](https://leetcode-cn.com/problems/frequency-of-the-most-frequent-element)  |  [最高频元素的频数](/solution/1800-1899/1838.Frequency%20of%20the%20Most%20Frequent%20Element/README.md)  |  `贪心算法`  |  中等  |    |
|  [1839](https://leetcode-cn.com/problems/longest-substring-of-all-vowels-in-order)  |  [所有元音按顺序排布的最长子字符串](/solution/1800-1899/1839.Longest%20Substring%20Of%20All%20Vowels%20in%20Order/README.md)  |  `双指针`,`字符串`  |  中等  |    |
|  [1840](https://leetcode-cn.com/problems/maximum-building-height)  |  [最高建筑高度](/solution/1800-1899/1840.Maximum%20Building%20Height/README.md)  |  `贪心算法`,`二分查找`  |  困难  |    |
|  [1841](https://leetcode-cn.com/problems/league-statistics)  |  [League Statistics](/solution/1800-1899/1841.League%20Statistics/README.md)  |    |  中等  |  🔒  |
|  [1842](https://leetcode-cn.com/problems/next-palindrome-using-same-digits)  |  [Next Palindrome Using Same Digits](/solution/1800-1899/1842.Next%20Palindrome%20Using%20Same%20Digits/README.md)  |  `贪心算法`  |  困难  |  🔒  |
|  [1843](https://leetcode-cn.com/problems/suspicious-bank-accounts)  |  [Suspicious Bank Accounts](/solution/1800-1899/1843.Suspicious%20Bank%20Accounts/README.md)  |    |  中等  |  🔒  |
|  [1844](https://leetcode-cn.com/problems/replace-all-digits-with-characters)  |  [将所有数字用字符替换](/solution/1800-1899/1844.Replace%20All%20Digits%20with%20Characters/README.md)  |  `字符串`  |  简单  |    |
|  [1845](https://leetcode-cn.com/problems/seat-reservation-manager)  |  [座位预约管理系统](/solution/1800-1899/1845.Seat%20Reservation%20Manager/README.md)  |  `堆`,`设计`  |  中等  |    |
|  [1846](https://leetcode-cn.com/problems/maximum-element-after-decreasing-and-rearranging)  |  [减小和重新排列数组后的最大元素](/solution/1800-1899/1846.Maximum%20Element%20After%20Decreasing%20and%20Rearranging/README.md)  |  `贪心算法`,`排序`  |  中等  |    |
|  [1847](https://leetcode-cn.com/problems/closest-room)  |  [最近的房间](/solution/1800-1899/1847.Closest%20Room/README.md)  |  `排序`,`二分查找`  |  困难  |    |
|  [1848](https://leetcode-cn.com/problems/minimum-distance-to-the-target-element)  |  [到目标元素的最小距离](/solution/1800-1899/1848.Minimum%20Distance%20to%20the%20Target%20Element/README.md)  |  `数组`  |  简单  |    |
|  [1849](https://leetcode-cn.com/problems/splitting-a-string-into-descending-consecutive-values)  |  [将字符串拆分为递减的连续值](/solution/1800-1899/1849.Splitting%20a%20String%20Into%20Descending%20Consecutive%20Values/README.md)  |  `递归`,`字符串`,`回溯算法`  |  中等  |    |
|  [1850](https://leetcode-cn.com/problems/minimum-adjacent-swaps-to-reach-the-kth-smallest-number)  |  [邻位交换的最小次数](/solution/1800-1899/1850.Minimum%20Adjacent%20Swaps%20to%20Reach%20the%20Kth%20Smallest%20Number/README.md)  |  `贪心算法`,`字符串`  |  中等  |    |
|  [1851](https://leetcode-cn.com/problems/minimum-interval-to-include-each-query)  |  [包含每个查询的最小区间](/solution/1800-1899/1851.Minimum%20Interval%20to%20Include%20Each%20Query/README.md)  |    |  困难  |    |
|  [1852](https://leetcode-cn.com/problems/distinct-numbers-in-each-subarray)  |  [Distinct Numbers in Each Subarray](/solution/1800-1899/1852.Distinct%20Numbers%20in%20Each%20Subarray/README.md)  |  `数组`,`哈希表`  |  中等  |  🔒  |
|  [1853](https://leetcode-cn.com/problems/convert-date-format)  |  [Convert Date Format](/solution/1800-1899/1853.Convert%20Date%20Format/README.md)  |    |  简单  |  🔒  |
|  [1854](https://leetcode-cn.com/problems/maximum-population-year)  |  [人口最多的年份](/solution/1800-1899/1854.Maximum%20Population%20Year/README.md)  |  `数组`  |  简单  |    |
|  [1855](https://leetcode-cn.com/problems/maximum-distance-between-a-pair-of-values)  |  [下标对中的最大距离](/solution/1800-1899/1855.Maximum%20Distance%20Between%20a%20Pair%20of%20Values/README.md)  |  `贪心算法`,`双指针`,`二分查找`  |  中等  |    |
|  [1856](https://leetcode-cn.com/problems/maximum-subarray-min-product)  |  [子数组最小乘积的最大值](/solution/1800-1899/1856.Maximum%20Subarray%20Min-Product/README.md)  |  `排序`,`并查集`,`队列`,`二分查找`,`动态规划`  |  中等  |    |
|  [1857](https://leetcode-cn.com/problems/largest-color-value-in-a-directed-graph)  |  [有向图中最大颜色值](/solution/1800-1899/1857.Largest%20Color%20Value%20in%20a%20Directed%20Graph/README.md)  |  `拓扑排序`,`动态规划`  |  困难  |    |
|  [1858](https://leetcode-cn.com/problems/longest-word-with-all-prefixes)  |  [Longest Word With All Prefixes](/solution/1800-1899/1858.Longest%20Word%20With%20All%20Prefixes/README.md)  |  `深度优先搜索`,`字典树`,`哈希表`  |  中等  |  🔒  |
|  [1859](https://leetcode-cn.com/problems/sorting-the-sentence)  |  [将句子排序](/solution/1800-1899/1859.Sorting%20the%20Sentence/README.md)  |  `排序`,`字符串`  |  简单  |    |
|  [1860](https://leetcode-cn.com/problems/incremental-memory-leak)  |  [增长的内存泄露](/solution/1800-1899/1860.Incremental%20Memory%20Leak/README.md)  |  `数学`  |  中等  |    |
|  [1861](https://leetcode-cn.com/problems/rotating-the-box)  |  [旋转盒子](/solution/1800-1899/1861.Rotating%20the%20Box/README.md)  |  `数组`,`双指针`  |  中等  |    |
|  [1862](https://leetcode-cn.com/problems/sum-of-floored-pairs)  |  [向下取整数对和](/solution/1800-1899/1862.Sum%20of%20Floored%20Pairs/README.md)  |  `数学`  |  困难  |    |
|  [1863](https://leetcode-cn.com/problems/sum-of-all-subset-xor-totals)  |  [找出所有子集的异或总和再求和](/solution/1800-1899/1863.Sum%20of%20All%20Subset%20XOR%20Totals/README.md)  |  `递归`,`回溯算法`  |  简单  |    |
|  [1864](https://leetcode-cn.com/problems/minimum-number-of-swaps-to-make-the-binary-string-alternating)  |  [构成交替字符串需要的最小交换次数](/solution/1800-1899/1864.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20Binary%20String%20Alternating/README.md)  |  `贪心算法`  |  中等  |    |
|  [1865](https://leetcode-cn.com/problems/finding-pairs-with-a-certain-sum)  |  [找出和为指定值的下标对](/solution/1800-1899/1865.Finding%20Pairs%20With%20a%20Certain%20Sum/README.md)  |  `设计`,`哈希表`  |  中等  |    |
|  [1866](https://leetcode-cn.com/problems/number-of-ways-to-rearrange-sticks-with-k-sticks-visible)  |  [恰有 K 根木棍可以看到的排列数目](/solution/1800-1899/1866.Number%20of%20Ways%20to%20Rearrange%20Sticks%20With%20K%20Sticks%20Visible/README.md)  |  `动态规划`  |  困难  |    |
|  [1867](https://leetcode-cn.com/problems/orders-with-maximum-quantity-above-average)  |  [Orders With Maximum Quantity Above Average](/solution/1800-1899/1867.Orders%20With%20Maximum%20Quantity%20Above%20Average/README.md)  |    |  中等  |  🔒  |
|  [1868](https://leetcode-cn.com/problems/product-of-two-run-length-encoded-arrays)  |  [Product of Two Run-Length Encoded Arrays](/solution/1800-1899/1868.Product%20of%20Two%20Run-Length%20Encoded%20Arrays/README.md)  |  `双指针`  |  中等  |  🔒  |
|  [1869](https://leetcode-cn.com/problems/longer-contiguous-segments-of-ones-than-zeros)  |  [哪种连续子字符串更长](/solution/1800-1899/1869.Longer%20Contiguous%20Segments%20of%20Ones%20than%20Zeros/README.md)  |  `数组`,`双指针`  |  简单  |    |
|  [1870](https://leetcode-cn.com/problems/minimum-speed-to-arrive-on-time)  |  [准时到达的列车最小时速](/solution/1800-1899/1870.Minimum%20Speed%20to%20Arrive%20on%20Time/README.md)  |  `数学`,`二分查找`  |  中等  |    |
|  [1871](https://leetcode-cn.com/problems/jump-game-vii)  |  [跳跃游戏 VII](/solution/1800-1899/1871.Jump%20Game%20VII/README.md)  |  `贪心算法`,`广度优先搜索`  |  中等  |    |
|  [1872](https://leetcode-cn.com/problems/stone-game-viii)  |  [石子游戏 VIII](/solution/1800-1899/1872.Stone%20Game%20VIII/README.md)  |  `动态规划`  |  困难  |    |
|  [1873](https://leetcode-cn.com/problems/calculate-special-bonus)  |  [Calculate Special Bonus](/solution/1800-1899/1873.Calculate%20Special%20Bonus/README.md)  |    |  简单  |    |
|  [1874](https://leetcode-cn.com/problems/minimize-product-sum-of-two-arrays)  |  [Minimize Product Sum of Two Arrays](/solution/1800-1899/1874.Minimize%20Product%20Sum%20of%20Two%20Arrays/README.md)  |  `贪心算法`  |  中等  |  🔒  |
|  [1875](https://leetcode-cn.com/problems/group-employees-of-the-same-salary)  |  [Group Employees of the Same Salary](/solution/1800-1899/1875.Group%20Employees%20of%20the%20Same%20Salary/README.md)  |    |  中等  |    |
|  [1876](https://leetcode-cn.com/problems/substrings-of-size-three-with-distinct-characters)  |  [长度为三且各字符不同的子字符串](/solution/1800-1899/1876.Substrings%20of%20Size%20Three%20with%20Distinct%20Characters/README.md)  |  `字符串`  |  简单  |    |
|  [1877](https://leetcode-cn.com/problems/minimize-maximum-pair-sum-in-array)  |  [数组中最大数对和的最小值](/solution/1800-1899/1877.Minimize%20Maximum%20Pair%20Sum%20in%20Array/README.md)  |  `贪心算法`,`排序`  |  中等  |    |
|  [1878](https://leetcode-cn.com/problems/get-biggest-three-rhombus-sums-in-a-grid)  |  [矩阵中最大的三个菱形和](/solution/1800-1899/1878.Get%20Biggest%20Three%20Rhombus%20Sums%20in%20a%20Grid/README.md)  |  `数组`,`数学`  |  中等  |    |
|  [1879](https://leetcode-cn.com/problems/minimum-xor-sum-of-two-arrays)  |  [两个数组最小的异或值之和](/solution/1800-1899/1879.Minimum%20XOR%20Sum%20of%20Two%20Arrays/README.md)  |  `位运算`,`动态规划`  |  困难  |    |
|  [1880](https://leetcode-cn.com/problems/check-if-word-equals-summation-of-two-words)  |  [检查某单词是否等于两单词之和](/solution/1800-1899/1880.Check%20if%20Word%20Equals%20Summation%20of%20Two%20Words/README.md)  |  `字符串`  |  简单  |    |
|  [1881](https://leetcode-cn.com/problems/maximum-value-after-insertion)  |  [插入后的最大值](/solution/1800-1899/1881.Maximum%20Value%20after%20Insertion/README.md)  |  `贪心算法`  |  中等  |    |
|  [1882](https://leetcode-cn.com/problems/process-tasks-using-servers)  |  [使用服务器处理任务](/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README.md)  |  `堆`  |  中等  |    |
|  [1883](https://leetcode-cn.com/problems/minimum-skips-to-arrive-at-meeting-on-time)  |  [准时抵达会议现场的最小跳过休息次数](/solution/1800-1899/1883.Minimum%20Skips%20to%20Arrive%20at%20Meeting%20On%20Time/README.md)  |  `动态规划`  |  困难  |    |
|  [1884](https://leetcode-cn.com/problems/egg-drop-with-2-eggs-and-n-floors)  |  [鸡蛋掉落-两枚鸡蛋](/solution/1800-1899/1884.Egg%20Drop%20With%202%20Eggs%20and%20N%20Floors/README.md)  |  `数学`,`二分查找`,`动态规划`  |  中等  |    |
|  [1885](https://leetcode-cn.com/problems/count-pairs-in-two-arrays)  |  [Count Pairs in Two Arrays](/solution/1800-1899/1885.Count%20Pairs%20in%20Two%20Arrays/README.md)  |  `排序`,`树状数组`,`数组`  |  中等  |    |
|  [1886](https://leetcode-cn.com/problems/determine-whether-matrix-can-be-obtained-by-rotation)  |  [判断矩阵经轮转后是否一致](/solution/1800-1899/1886.Determine%20Whether%20Matrix%20Can%20Be%20Obtained%20By%20Rotation/README.md)  |  `数组`  |  简单  |    |
|  [1887](https://leetcode-cn.com/problems/reduction-operations-to-make-the-array-elements-equal)  |  [使数组元素相等的减少操作次数](/solution/1800-1899/1887.Reduction%20Operations%20to%20Make%20the%20Array%20Elements%20Equal/README.md)  |  `贪心算法`,`排序`  |  中等  |    |
|  [1888](https://leetcode-cn.com/problems/minimum-number-of-flips-to-make-the-binary-string-alternating)  |  [使二进制字符串字符交替的最少反转次数](/solution/1800-1899/1888.Minimum%20Number%20of%20Flips%20to%20Make%20the%20Binary%20String%20Alternating/README.md)  |  `贪心算法`,`数组`  |  中等  |    |
|  [1889](https://leetcode-cn.com/problems/minimum-space-wasted-from-packaging)  |  [装包裹的最小浪费空间](/solution/1800-1899/1889.Minimum%20Space%20Wasted%20From%20Packaging/README.md)  |  `二分查找`  |  困难  |    |
|  [1890](https://leetcode-cn.com/problems/the-latest-login-in-2020)  |  [The Latest Login in 2020](/solution/1800-1899/1890.The%20Latest%20Login%20in%202020/README.md)  |    |  简单  |    |
|  [1891](https://leetcode-cn.com/problems/cutting-ribbons)  |  [Cutting Ribbons](/solution/1800-1899/1891.Cutting%20Ribbons/README.md)  |  `二分查找`  |  中等  |  🔒  |
|  [1892](https://leetcode-cn.com/problems/page-recommendations-ii)  |  [Page Recommendations II](/solution/1800-1899/1892.Page%20Recommendations%20II/README.md)  |    |  困难  |    |
|  [1893](https://leetcode-cn.com/problems/check-if-all-the-integers-in-a-range-are-covered)  |  [检查是否区域内所有整数都被覆盖](/solution/1800-1899/1893.Check%20if%20All%20the%20Integers%20in%20a%20Range%20Are%20Covered/README.md)  |  `贪心算法`  |  简单  |    |
|  [1894](https://leetcode-cn.com/problems/find-the-student-that-will-replace-the-chalk)  |  [找到需要补充粉笔的学生编号](/solution/1800-1899/1894.Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/README.md)  |  `贪心算法`,`数组`  |  中等  |    |
|  [1895](https://leetcode-cn.com/problems/largest-magic-square)  |  [最大的幻方](/solution/1800-1899/1895.Largest%20Magic%20Square/README.md)  |  `数组`,`动态规划`  |  中等  |    |
|  [1896](https://leetcode-cn.com/problems/minimum-cost-to-change-the-final-value-of-expression)  |  [反转表达式值的最少操作次数](/solution/1800-1899/1896.Minimum%20Cost%20to%20Change%20the%20Final%20Value%20of%20Expression/README.md)  |  `栈`,`动态规划`  |  困难  |    |
|  [1897](https://leetcode-cn.com/problems/redistribute-characters-to-make-all-strings-equal)  |  [重新分配字符使所有字符串都相等](/solution/1800-1899/1897.Redistribute%20Characters%20to%20Make%20All%20Strings%20Equal/README.md)  |  `贪心算法`,`字符串`  |  简单  |    |
|  [1898](https://leetcode-cn.com/problems/maximum-number-of-removable-characters)  |  [可移除字符的最大数目](/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README.md)  |  `二分查找`  |  中等  |    |
|  [1899](https://leetcode-cn.com/problems/merge-triplets-to-form-target-triplet)  |  [合并若干三元组以形成目标三元组](/solution/1800-1899/1899.Merge%20Triplets%20to%20Form%20Target%20Triplet/README.md)  |  `贪心算法`  |  中等  |    |
|  [1900](https://leetcode-cn.com/problems/the-earliest-and-latest-rounds-where-players-compete)  |  [最佳运动员的比拼回合](/solution/1900-1999/1900.The%20Earliest%20and%20Latest%20Rounds%20Where%20Players%20Compete/README.md)  |  `动态规划`  |  困难  |    |

## 版权

著作权归 [GitHub 开源社区 Doocs](https://github.com/doocs) 所有，商业转载请联系 [@yanglbme](mailto:contact@yanglibin.info) 授权，非商业转载请注明出处。