https://github.com/hncboy/leetcode
LeetCode
https://github.com/hncboy/leetcode
algorithm java leetcod
Last synced: 25 days ago
JSON representation
LeetCode
- Host: GitHub
- URL: https://github.com/hncboy/leetcode
- Owner: hncboy
- License: apache-2.0
- Created: 2019-08-30T01:45:02.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2022-12-08T04:58:46.000Z (over 2 years ago)
- Last Synced: 2025-03-30T15:51:12.283Z (about 2 months ago)
- Topics: algorithm, java, leetcod
- Language: Java
- Size: 1.24 MB
- Stars: 12
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# [LeetCode](https://leetcode-cn.com)
| [算法](#pencil算法) | 数据库 | Shell | [多线程](#currency_exchange多线程) | [程序员面试金典](#hot_pepper程序员面试金典) | [剑指 Offer（第 2 版）](#fountain_pen剑指-offer第-2-版) | 剑指 Offer（专项突击版） |
| ------------------- | ------- | ---------------- | ---------------------------------- | ------------------------------------------- | ------------------------------------------------------- | ------------------------ |
| :pencil: | :eagle: | :aerial_tramway: | :currency_exchange: | :hot_pepper: | :fountain_pen: | 🚢 |
## :pencil:算法
| 序号 | 题名 | 难度 |
| -- | -- | -- |
| 1 | [两数之和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/TwoSum.java) | 简单 |
| 2 | [两数相加](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/AddTwoNumbers.java) | 中等 |
| 3 | [无重复字符的最长子串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LongestSubstringWithoutRepeatingCharacters.java) | 中等 |
| 4 | [寻找两个有序数组的中位数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MedianOfTwoSortedArrays.java) | 困难 |
| 5 | [最长回文子串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LongestPalindromicSubstring.java) | 中等 |
| [6](https://leetcode-cn.com/problems/zigzag-conversion/) | [Z 字形变换](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ZigZagConversion.java) | 中等 |
| 7 | [整数反转](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ReverseInteger.java) | 简单 |
| 8 | [字符串转换整数(atoi)](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/StringToIntegerAtoi.java) | 中等 |
| 9 | [回文数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PalindromeNumber.java) | 简单 |
| 10 | [正则表达式匹配](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RegularExpressionMatching.java) | 困难 |
| 11 | [盛最多水的容器](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ContainerWithMostWater.java) | 中等 |
| 12 | [整数转罗马数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/IntegerToRoman.java) | 中等 |
| 13 | [罗马数字转整数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RomanToInteger.java) | 简单 |
| 14 | [最长公共前缀](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LongestCommonPrefix.java) | 简单 |
| 15 | [三数之和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ThreeSum.java) | 中等 |
| 16 | [最接近的三数之和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ThreeSumClosest.java) | 中等 |
| 17 | [电话号码的字母组合](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LetterCombinationsOfAPhoneNumber.java) | 中等 |
| 18 | [四数之和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FourSum.java) | 中等 |
| 19 | [删除链表的倒数第N个节点](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RemoveNthNodeFromEndOfList.java) | 中等 |
| 20 | [有效的括号](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ValidParentheses.java) | 简单 |
| 21 | [合并两个有序链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MergeTwoSortedLists.java) | 简单 |
| [22](https://leetcode-cn.com/problems/generate-parentheses/) | [括号生成](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/GenerateParentheses.java) | 中等 |
| [23](https://leetcode-cn.com/problems/merge-k-sorted-lists/) | [合并K个排序链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MergeKSortedLists.java) | 困难 |
| 24 | [两两交换链表中的节点](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SwapNodesInPairs.java) | 中等 |
| 25 | [K 个一组翻转链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ReverseNodesInKGroup.java) | 困难 |
| 26 | [删除排序数组中的重复项](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RemoveDuplicatesFromSortedArray.java) | 简单 |
| 27 | [移除元素](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RemoveElement.java) | 简单 |
| 28 | [实现 strStr()](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ImplementStrstr.java) | 简单 |
| 29 | [两数相除](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DivideTwoIntegers.java) | 中等 |
| 30 | [串联所有单词的子串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SubstringWithConcatenationOfAllWords.java) | 困难 |
| 31 | [下一个排列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NextPermutation.java) | 中等 |
| 32 | [最长有效括号](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LongestValidParentheses.java) | 困难 |
| 33 | [搜索旋转排序数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SearchInRotatedSortedArray.java) | 中等 |
| 34 | [在排序数组中查找元素的第一个和最后一个位置](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindFirstAndLastPositionOfElementInSortedArray.java) | 中等 |
| 35 | [搜索插入位置](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SearchInsertPosition.java) | 简单 |
| 36 | [有效的数独](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ValidSudoku.java) | 中等 |
| 37 | [解数独](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SudokuSolver.java) | 困难 |
| 38 | [报数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CountAndSay.java) | 简单 |
| [39](https://leetcode-cn.com/problems/combination-sum/) | [组合总和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CombinationSum.java) | 中等 |
| 40 | [组合总和 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CombinationSumII.java) | 困难 |
| 41 | [缺失的第一个正数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FirstMissingPositive.java) | 困难 |
| 42 | [接雨水](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/TrappingRainWater.java) | 困难 |
| 43 | [字符串相乘](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MultiplyStrings.java) | 中等 |
| 44 | [通配符匹配](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/WildcardMatching.java) | 困难 |
| 45 | [跳跃游戏 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/JumpGameII.java) | 困难 |
| [46](https://leetcode-cn.com/problems/permutations/) | [全排列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/Permutations.java) | 中等 |
| [47](https://leetcode-cn.com/problems/permutations-ii/) | [全排列 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PermutationsII.java) | 中等 |
| 48 | [旋转图像](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RotateImage.java) | 中等 |
| 49 | [字母异位词分组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/GroupAnagrams.java) | 中等 |
| 50 | [Pow(x, n)](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PowxN.java) | 中等 |
| 51 | [N皇后](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NQueens.java) | 困难 |
| 52 | [N皇后 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NQueensII.java) | 困难 |
| 53 | [最大子序和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumSubarray.java) | 简单 |
| 54 | [螺旋矩阵](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SpiralMatrix.java) | 中等 |
| 55 | [跳跃游戏](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/JumpGame.java) | 中等 |
| [56](https://leetcode-cn.com/problems/merge-intervals/) | [合并区间](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MergeIntervals.java) | 中等 |
| 57 | [插入区间](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/InsertInterval.java) | 困难 |
| 58 | [最后一个单词的长度](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LengthOfLastWord.java) | 简单 |
| 59 | [螺旋矩阵 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SpiralMatrixII.java) | 中等 |
| 60 | [第k个排列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PermutationSequence.java) | 中等 |
| 61 | [旋转链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RotateList.java) | 中等 |
| 62 | [不同路径](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/UniquePaths.java) | 中等 |
| 63 | [不同路径 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/UniquePathsII.java) | 中等 |
| [64](https://leetcode-cn.com/problems/minimum-path-sum/) | [最小路径和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MinimumPathSum.java) | 中等 |
| 66 | [加一](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PlusOne.java) | 简单 |
| 67 | [二进制求和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/AddBinary.java) | 简单 |
| 69 | [x的平方根](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SqrtX.java) | 简单 |
| 70 | [爬楼梯](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ClimbingStairs.java) | 简单 |
| [71](https://leetcode-cn.com/problems/simplify-path/) | [简化路径](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SimplifyPath.java) | 中等 |
| 72 | [编辑距离](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/EditDistance.java) | 困难 |
| 73 | [矩阵置零](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SetMatrixZeroes.java) | 中等 |
| 74 | [搜索二维矩阵](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SearchA2dMatrix.java) | 中等 |
| 75 | [颜色分类](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SortColors.java) | 中等 |
| 76 | [最小覆盖子串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MinimumWindowSubstring.java) | 困难 |
| [77](https://leetcode-cn.com/problems/combinations/) | [组合](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/Combinations.java) | 中等 |
| [78](https://leetcode-cn.com/problems/subsets/) | [子集](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/Subsets.java) | 中等 |
| 79 | [单词搜索](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/WordSearch.java) | 中等 |
| 80 | [删除排序数组中的重复项 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RemoveDuplicatesFromSortedArrayII.java) | 中等 |
| 81 | [搜索旋转排序数组 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SearchInRotatedSortedArrayII.java) | 中等 |
| 82 | [删除排序链表中的重复元素 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RemoveDuplicatesFromSortedListII.java) | 中等 |
| 83 | [删除排序链表中的重复元素](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RemoveDuplicatesFromSortedList.java) | 简单 |
| 84 | [柱状图中最大的矩形](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LargestRectangleInHistogram.java) | 困难 |
| 85 | [最大矩形](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximalRectangle.java) | 困难 |
| 86 | [分隔链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PartitionList.java) | 中等 |
| 88 | [合并两个有序数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MergeSortedArray.java) | 简单 |
| [89](https://leetcode-cn.com/problems/gray-code/) | [格雷编码](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/GrayCode.java) | 中等 |
| 90 | [子集 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SubsetsII.java) | 中等 |
| 91 | [解码方法](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DecodeWays.java) | 中等 |
| 92 | [反转链表 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ReverseLinkedListII.java) | 中等 |
| [93](https://leetcode-cn.com/problems/restore-ip-addresses/) | [复原 IP 地址](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RestoreIpAddresses.java) | 中等 |
| 94 | [二叉树的中序遍历](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BinaryTreeInorderTraversal.java) | 中等 |
| 95 | [不同的二叉搜索树 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/UniqueBinarySearchTreesII.java) | 中等 |
| 96 | [不同的二叉搜索树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/UniqueBinarySearchTrees.java) | 中等 |
| [97](https://leetcode-cn.com/problems/interleaving-string/) | [交错字符串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/InterleavingString.java) | 中等 |
| 98 | [验证二叉搜索树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ValidateBinarySearchTree.java) | 中等 |
| [99](https://leetcode-cn.com/problems/recover-binary-search-tree/) | [恢复二叉搜索树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RecoverBinarySearchTree.java) | 中等 |
| 100 | [相同的树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SameTree.java) | 简单 |
| 101 | [对称二叉树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SymmetricTree.java) | 简单 |
| 102 | [二叉树的层次遍历](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BinaryTreeLevelOrderTraversal.java) | 中等 |
| 103 | [二叉树的锯齿形层次遍历](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BinaryTreeZigzagLevelOrderTraversal.java) | 中等 |
| 104 | [二叉树的最大深度](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumDepthOfBinaryTree.java) | 简单 |
| 105 | [从前序与中序遍历序列构造二叉树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ConstructBinaryTreeFromPreorderAndInorderTraversal.java) | 中等 |
| 106 | [从中序与后序遍历序列构造二叉树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ConstructBinaryTreeFromInorderAndPostorderTraversal.java) | 中等 |
| 107 | [二叉树的层次遍历 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BinaryTreeLevelOrderTraversalII.java) | 简单 |
| 108 | [将有序数组转换为二叉搜索树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ConvertSortedArrayToBinarySearchTree.java) | 简单 |
| 109 | [有序链表转换二叉搜索树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ConvertSortedListToBinarySearchTree.java) | 中等 |
| 110 | [平衡二叉树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BalancedBinaryTree.java) | 简单 |
| 111 | [二叉树的最小深度](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MinimumDepthOfBinaryTree.java) | 简单 |
| 112 | [路径总和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PathSum.java) | 简单 |
| 113 | [路径总和 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PathSumII.java) | 中等 |
| [115](https://leetcode-cn.com/problems/distinct-subsequences/) | [不同的子序列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DistinctSubsequences.java) | 困难 |
| 116 | [填充每个节点的下一个右侧节点指针](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PopulatingNextRightPointersInEachNode.java) | 中等 |
| 118 | [杨辉三角](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PascalsTriangle.java) | 简单 |
| 119 | [杨辉三角 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PascalsTriangleII.java) | 简单 |
| [120](https://leetcode-cn.com/problems/triangle/) | [三角形最小路径和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/Triangle.java) | 中等 |
| 121 | [买卖股票的最佳时机](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BestTimeToBuyAndSellStock.java) | 简单 |
| 122 | [买卖股票的最佳时机 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BestTimeToBuyAndSellStockII.java) | 简单 |
| 123 | [买卖股票的最佳时机 III](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BestTimeToBuyAndSellStockIII.java) | 困难 |
| 124 | [二叉树中的最大路径和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BinaryTreeMaximumPathSum.java) | 困难 |
| 125 | [验证回文串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ValidPalindrome.java) | 简单 |
| 126 | [单词接龙 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/WordLadderII.java) | 困难 |
| 127 | [单词接龙](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/WordLadder.java) | 中等 |
| [128](https://leetcode-cn.com/problems/longest-consecutive-sequence/) | [最长连续序列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LongestConsecutiveSequence.java) | 困难 |
| [129](https://leetcode-cn.com/problems/sum-root-to-leaf-numbers/) | [求根节点到叶节点数字之和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SumRootToLeafNumbers.java) | 中等 |
| 130 | [被围绕的区域](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SurroundedRegions.java) | 中等 |
| [131](https://leetcode-cn.com/problems/palindrome-partitioning/) | [分割回文串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PalindromePartitioning.java) | 中等 |
| 133 | [克隆图](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CloneGraph.java) | 中等 |
| 134 | [加油站](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/GasStation.java) | 中等 |
| 135 | [分发糖果](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/Candy.java) | 困难 |
| 136 | [只出现一次的数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SingleNumber.java) | 简单 |
| [137](https://leetcode-cn.com/problems/single-number-ii/) | [只出现一次的数字 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SingleNumberII.java) | 中等 |
| 138 | [复制带随机指针的链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CopyListWithRandomPointer.java) | 中等 |
| 139 | [单词拆分](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/WordBreak.java) | 中等 |
| 140 | [单词拆分 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/WordBreakII.java) | 困难 |
| 141 | [环形链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LinkedListCycle.java) | 简单 |
| 142 | [环形链表 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LinkedListCycleII.java) | 中等 |
| 143 | [重排链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ReorderList.java) | 中等 |
| 144 | [二叉树的前序遍历](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BinaryTreePreorderTraversal.java) | 中等 |
| 145 | [二叉树的后序遍历](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BinaryTreePostorderTraversal.java) | 困难 |
| 146 | [LRU缓存机制](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LruCache.java) | 中等 |
| 147 | [对链表进行插入排序](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/InsertionSortList.java) | 中等 |
| 148 | [排序链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SortList.java) | 中等 |
| 149 | [直线上最多的点数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaxPointsOnALine.java) | 困难 |
| 150 | [逆波兰表达式求值](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/EvaluateReversePolishNotation.java) | 中等 |
| 151 | [翻转字符串里的单词](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ReverseWordsInAString.java) | 中等 |
| 152 | [乘积最大子序列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumProductSubarray.java) | 中等 |
| 153 | [寻找旋转排序数组中的最小值](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindMinimumInRotatedSortedArray.java) | 中等 |
| 154 | [寻找旋转排序数组中的最小值 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindMinimumInRotatedSortedArrayII.java) | 困难 |
| 155 | [最小栈](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MinStack.java) | 简单 |
| 160 | [相交链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/IntersectionOfTwoLinkedLists.java) | 简单 |
| 162 | [寻找峰值](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindPeakElement.java) | 中等 |
| [166](https://leetcode-cn.com/problems/fraction-to-recurring-decimal/) | [分数到小数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindPeakElement.java) | 中等 |
| 167 | [两数之和 II - 输入有序数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/TwoSumIIInputArrayIsSorted.java) | 简单 |
| 168 | [Excel表列名称](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ExcelSheetColumnTitle.java) | 简单 |
| 169 | [求众数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/majorityElement1.java) | 简单 |
| 171 | [Excel表列序号](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ExcelSheetColumnNumber.java) | 简单 |
| [172](https://leetcode-cn.com/problems/factorial-trailing-zeroes/) | [阶乘后的零](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FactorialTrailingZeroes.java) | 简单 |
| [173](https://leetcode-cn.com/problems/binary-search-tree-iterator/) | [二叉搜索树迭代器](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BinarySearchTreeIterator.java) | 中等 |
| 179 | [最大数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LargestNumber.java) | 中等 |
| [187](https://leetcode-cn.com/problems/repeated-dna-sequences/) | [重复的DNA序列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RepeatedDnaSequences.java) | 中等 |
| 188 | [买卖股票的最佳时机 IV](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BestTimeToBuyAndSellStockIV.java) | 困难 |
| 189 | [旋转数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RotateArray.java) | 简单 |
| 190 | [[颠倒二进制位](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ReverseBits.java) | 简单 |
| 191 | [位1的个数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NumberOf1Bits.java) | 简单 |
| 198 | [打家劫舍](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/HouseRobber.java) | 简单 |
| [199](https://leetcode-cn.com/problems/binary-tree-right-side-view/) | [二叉树的右视图](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BinaryTreeRightSideView.java) | 中等 |
| 203 | [移除链表元素](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RemoveLinkedListElements.java) | 简单 |
| 204 | [计数质数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CountPrimes.java) | 简单 |
| 205 | [同构字符串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/IsomorphicStrings.java) | 简单 |
| 206 | [反转链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ReverseLinkedList.java) | 简单 |
| 207 | [课程表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CourseSchedule.java) | 中等 |
| [208](https://leetcode-cn.com/problems/implement-trie-prefix-tree/) | [实现 Trie (前缀树)](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ImplementTriePrefixTree.java) | 中等 |
| 209 | [长度最小的子数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MinimumSizeSubarraySum.java) | 中等 |
| 210 | [课程表 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CourseScheduleII.java) | 中等 |
| [211](https://leetcode-cn.com/problems/design-add-and-search-words-data-structure/) | [添加与搜索单词-数据结构设计](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DesignAddAndSearchWordsDataStructure.java) | 中等 |
| 213 | [打家劫舍 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/HouseRobberII.java) | 中等 |
| 215 | [数组中的第K个最大元素](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/KthLargestElementInAnArray.java) | 简单 |
| 216 | [组合总和 III](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CombinationSumIII.java) | 中等 |
| 217 | [存在重复元素](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ContainsDuplicate.java) | 简单 |
| [219](https://leetcode-cn.com/problems/contains-duplicate-ii/) | [存在重复元素 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ContainsDuplicateII.java) | 简单 |
| [220](https://leetcode-cn.com/problems/contains-duplicate-iii/) | [存在重复元素 III](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ContainsDuplicateIii.java) | 中等 |
| 221 | [最大正方形](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximalSquare.java) | 中等 |
| 223 | [矩形面积](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RectangleArea.java) | 中等 |
| 225 | [用队列实现栈](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ImplementStackUsingQueues.java) | 简单 |
| 226 | [翻转二叉树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/InvertBinaryTree.java) | 简单 |
| 228 | [汇总区间](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SummaryRanges.java) | 中等 |
| 229 | [求众数 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MajorityElementII.java) | 中等 |
| [230](https://leetcode-cn.com/problems/kth-smallest-element-in-a-bst/) | [二叉搜索树中第K小的元素](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/KthSmallestElementInABst.java) | 中等 |
| 231 | [2的幂](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PowerOfTwo.java) | 简单 |
| 233 | [数字 1 的个数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NumberOfDigitOne.java) | 困难 |
| 234 | [回文链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PalindromeLinkedList.java) | 简单 |
| [235](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | [二叉搜索树的最近公共祖先](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LowestCommonAncestorOfABinarySearchTree.java) | 简单 |
| [236](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/) | [二叉树的最近公共祖先](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LowestCommonAncestorOfABinaryTree.java) | 中等 |
| 237 | [删除链表中的节点](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DeleteNodeInALinkedList.java) | 简单 |
| 238 | [除自身以外数组的乘积](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ProductOfArrayExceptSelf.java) | 中等 |
| 239 | [滑动窗口最大值](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SlidingWindowMaximum.java) | 困难 |
| 240 | [搜索二维矩阵 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SearchA2dMatrixII.java) | 中等 |
| 242 | [有效的字母异位词](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ValidAnagram.java) | 简单 |
| [258](https://leetcode-cn.com/problems/add-digits/) | [各位相加](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/AddDigits.java) | 简单 |
| 263 | [丑数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/UglyNumber.java) | 简单 |
| [260](https://leetcode-cn.com/problems/single-number-iii/) | [只出现一次的数字 III](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SingleNumberIII.java) | 中等 |
| 264 | [丑数 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/UglyNumberII.java) | 中等 |
| 268 | [缺失数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MissingNumber.java) | 简单 |
| [273](https://leetcode-cn.com/problems/integer-to-english-words/) | [整数转换英文表示](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/IntegerToEnglishWords.java) | 困难 |
| 274 | [H指数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/HIndex.java) | 中等 |
| 275 | [H指数 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/HIndexII.java) | 中等 |
| 278 | [第一个错误的版本](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FirstBadVersion.java) | 简单 |
| 279 | [完全平方数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PerfectSquares.java) | 中等 |
| [282](https://leetcode-cn.com/problems/expression-add-operators/) | [给表达式添加运算符](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ExpressionAddOperators.java) | 困难 |
| 283 | [移动零](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MoveZeroes.java) | 简单 |
| [284](https://leetcode-cn.com/problems/peeking-iterator/) | [顶端迭代器](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PeekingIterator.java) | 中等 |
| 287 | [寻找重复数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindTheDuplicateNumber.java) | 中等 |
| 289 | [生命游戏](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/GameOfLife.java) | 中等 |
| 292 | [Nim 游戏](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NimGame.java) | 简单 |
| [295](https://leetcode-cn.com/problems/find-median-from-data-stream/) | [数据流的中位数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindMedianFromDataStream.java) | 困难 |
| 297 | [二叉树的序列化与反序列化](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SerializeAndDeserializeBinaryTree.java) | 困难 |
| [299](https://leetcode-cn.com/problems/bulls-and-cows/) | [猜数字游戏](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BullsAndCows.java) | 中等 |
| 300 | [最长上升子序列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LongestIncreasingSubsequence.java) | 中等 |
| [301](https://leetcode-cn.com/problems/remove-invalid-parentheses/) | [删除无效的括号](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RemoveInvalidParentheses.java) | 困难 |
| 303 | [区域和检索 - 数组不可变](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RangeSumQueryImmutable.java) | 简单 |
| [304](https://leetcode-cn.com/problems/range-sum-query-2d-immutable/) | [二维区域和检索-矩阵不可变](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RangeSumQuery2dImmutable.java) | 中等 |
| [306](https://leetcode-cn.com/problems/additive-number/) | [累加数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/AdditiveNumber.java) | 中等 |
| [307](https://leetcode-cn.com/problems/range-sum-query-mutable/) | [区域和检索 - 数组可修改](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RangeSumQueryMutable.java) | 中等 |
| 309 | [最佳买卖股票时机含冷冻期](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BestTimeToBuyAndSellStockWithCooldown.java) | 中等 |
| [310](https://leetcode-cn.com/problems/minimum-height-trees/) | [最小高度树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MinimumHeightTrees.java) | 中等 |
| 313 | [超级丑数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SuperUglyNumber.java) | 中等 |
| 316 | [去除重复字母](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RemoveDuplicateLetters.java) | 困难 |
| [318](https://leetcode-cn.com/problems/maximum-product-of-word-lengths/) | [最大单词长度乘积](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumProductOfWordLengths.java) | 中等 |
| [319](https://leetcode-cn.com/problems/bulb-switcher/) | [灯泡开关](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BulbSwitcher.java) | 中等 |
| [322](https://leetcode-cn.com/problems/coin-change/) | [零钱兑换](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CoinChange.java) | 中等 |
| 326 | [3的幂](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PowerOfThree.java) | 简单 |
| 328 | [奇偶链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/OddEvenLinkedList.java) | 中等 |
| 330 | [按要求补齐数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PatchingArray.java) | 困难 |
| 332 | [重新安排行程](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ReconstructItinerary.java) | 中等 |
| [334](https://leetcode-cn.com/problems/increasing-triplet-subsequence/) | [递增的三元子序列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/IncreasingTripletSubsequence.java) | 中等 |
| [335](https://leetcode-cn.com/problems/self-crossing/) | [路径交叉](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SelfCrossing.java) | 困难 |
| [338](https://leetcode-cn.com/problems/counting-bits/) | [比特位计数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CountingBits.java) | 简单 |
| 343 | [整数拆分](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/IntegerBreak.java) | 中等 |
| 344 | [反转字符串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ReverseString.java) | 简单 |
| [347](https://leetcode-cn.com/problems/top-k-frequent-elements/) | [前 K 个高频元素](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/TopKFrequentElements.java) | 中等 |
| 349 | [两个数组的交集](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/IntersectionOfTwoArrays.java) | 简单 |
| 350 | [两个数组的交集 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/IntersectionOfTwoArraysII.java) | 简单 |
| [352](https://leetcode-cn.com/problems/data-stream-as-disjoint-intervals/) | [将数据流变为多个不相交区间](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DataStreamAsDisjointIntervals.java) | 困难 |
| [357](https://leetcode-cn.com/problems/count-numbers-with-unique-digits/) | [统计各位数字都不同的数字个数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CountNumbersWithUniqueDigits.java) | 中等 |
| [385](https://leetcode-cn.com/problems/mini-parser/) | [迷你语法分析器](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MiniParser.java) | 中等 |
| 365 | [水壶问题](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/WaterAndJugProblem.java) | 中等 |
| 367 | [有效的完全平方数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ValidPerfectSquare.java) | 简单 |
| 371 | [两整数之和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SumOfTwoIntegers.java) | 简单 |
| [372](https://leetcode-cn.com/problems/super-pow/) | [超级次方](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SuperPow.java) | 中等 |
| [373](https://leetcode-cn.com/problems/find-k-pairs-with-smallest-sums/) | [查找和最小的K对数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindKPairsWithSmallestSums.java) | 中等 |
| 374 | [猜数字大小](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/GuessNumberHigherOrLower.java) | 简单 |
| [375](https://leetcode-cn.com/problems/guess-number-higher-or-lower-ii/) | [猜数字大小 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/GuessNumberHigherOrLowerII.java) | 中等 |
| [377](https://leetcode-cn.com/problems/combination-sum-iv/) | [组合总和 Ⅳ](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CombinationSumIv.java) | 中等 |
| [380](https://leetcode-cn.com/problems/insert-delete-getrandom-o1/) | [O(1) 时间插入、删除和获取随机元素](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/InsertDeleteGetrandomO1.java) | 中等 |
| 381 | [O(1) 时间插入、删除和获取随机元素 - 允许重复](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/InsertDeleteGetrandomO1DuplicatesAllowed.java) | 困难 |
| [382](https://leetcode-cn.com/problems/linked-list-random-node/) | [链表随机节点](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LinkedListRandomNode.java) | 中等 |
| 383 | [赎金信](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RansomNote.java) | 简单 |
| 384 | [打乱数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ShuffleAnArray.java) | 中等 |
| [386](https://leetcode-cn.com/problems/lexicographical-numbers/) | [字典序排数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LexicographicalNumbers.java) | 中等 |
| 387 | [字符串中的第一个唯一字符](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FirstUniqueCharacterInAString.java) | 简单 |
| [388](https://leetcode-cn.com/problems/longest-absolute-file-path/) | [文件的最长绝对路径](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LongestAbsoluteFilePath.java) | 中等 |
| [390](https://leetcode-cn.com/problems/elimination-game/) | [消除游戏](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/EliminationGame.java) | 中等 |
| [391](https://leetcode-cn.com/problems/perfect-rectangle/) | [完美矩形](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PerfectRectangle.java) | 困难 |
| 392 | [判断子序列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/IsSubsequence.java) | 简单 |
| [393](https://leetcode-cn.com/problems/utf-8-validation/) | [UTF-8 编码验证](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/IsSubsequence.java) | 中等 |
| [397](https://leetcode-cn.com/problems/integer-replacement/) | [整数替换](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/IntegerReplacement.java) | 中等 |
| 399 | [除法求值](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/EvaluateDivision.java) | 中等 |
| [400](https://leetcode-cn.com/problems/nth-digit/) | [第 N 位数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NthDigit.java) | 中等 |
| [401](https://leetcode-cn.com/problems/binary-watch/) | [二进制手表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BinaryWatch.java) | 简单 |
| [405](https://leetcode-cn.com/problems/convert-a-number-to-hexadecimal/) | [数字转换为十六进制数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ConvertANumberToHexadecimal.java) | 简单 |
| 406 | [根据身高重建队列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/QueueReconstructionByHeight.java) | 中等 |
| [407](https://leetcode-cn.com/problems/trapping-rain-water-ii/) | [接雨水 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/TrappingRainWaterII.java) | 困难 |
| 409 | [最长回文串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LongestPalindrome.java) | 简单 |
| 412 | [Fizz Buzz](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FizzBuzz.java) | 简单 |
| 414 | [第三大的数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ThirdMaximumNumber.java) | 简单 |
| [415](https://leetcode-cn.com/problems/add-strings/) | [字符串相加](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/AddStrings.java) | 简单 |
| [419](https://leetcode-cn.com/problems/battleships-in-a-board/) | [甲板上的战舰](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BattleshipsInABoard.java) | 中等 |
| [420](https://leetcode-cn.com/problems/strong-password-checker/) | [强密码检验器](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/StrongPasswordChecker.java) | 困难 |
| [421](https://leetcode-cn.com/problems/maximum-xor-of-two-numbers-in-an-array/) | [数组中两个数的最大异或值](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumXorOfTwoNumbersInAnArray.java) | 中等 |
| [423](https://leetcode-cn.com/problems/reconstruct-original-digits-from-english/) | [从英文中重建数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ReconstructOriginalDigitsFromEnglish.java) | 中等 |
| 430 | [扁平化多级双向链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FlattenAMultilevelDoublyLinkedList.java) | 中等 |
| [432](https://leetcode-cn.com/problems/all-oone-data-structure/) | [全 O(1) 的数据结构](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/AllOoneDataStructure.java) | 困难 |
| [433](https://leetcode-cn.com/problems/minimum-genetic-mutation/) | [最小基因变化](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MinimumGeneticMutation.java) | 中等 |
| [434](https://leetcode-cn.com/problems/number-of-segments-in-a-string/) | [字符串中的单词数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NumberOfSegmentsInAString.java) | 简单 |
| 437 | [路径总和 III](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PathSumIII.java) | 中等 |
| [438](https://leetcode-cn.com/problems/find-all-anagrams-in-a-string/) | [找到字符串中所有字母异位词](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindAllAnagramsInAString.java) | 中等 |
| [440](https://leetcode-cn.com/problems/k-th-smallest-in-lexicographical-order/) | [字典序的第K小数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/KThSmallestInLexicographicalOrder.java) | 困难 |
| 441 | [排列硬币](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ArrangingCoins.java) | 简单 |
| [442](https://leetcode-cn.com/problems/find-all-duplicates-in-an-array/) | [数组中重复的数据](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindAllDuplicatesInAnArray.java) | 中等 |
| 445 | [两数相加 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/AddTwoNumbersII.java) | 中等 |
| 448 | [找到所有数组中消失的数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindAllNumbersDisappearedInAnArray.java) | 简单 |
| [453](https://leetcode-cn.com/problems/minimum-moves-to-equal-array-elements/) | [最小操作次数使数组元素相等](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MinimumMovesToEqualArrayElements.java) | 简单 |
| 455 | [分发饼干](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/AssignCookies.java) | 简单 |
| 457 | [环形数组循环](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CircularArrayLoop.java) | 中等 |
| [458](https://leetcode-cn.com/problems/poor-pigs/) | [可怜的小猪](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PoorPigs.java) | 困难 |
| [463](https://leetcode-cn.com/problems/island-perimeter/) | [岛屿的周长](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/IslandPerimeter.java) | 简单 |
| [472](https://leetcode-cn.com/problems/concatenated-words/) | [连接词](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ConcatenatedWords.java) | 困难 |
| [475](https://leetcode-cn.com/problems/heaters/) | [供暖器](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/Heaters.java) | 中等 |
| [476](https://leetcode-cn.com/problems/number-complement/) | [数字的补数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NumberComplement.java) | 简单 |
| [479](https://leetcode-cn.com/problems/largest-palindrome-product/) | [最大回文数乘积](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LargestPalindromeProduct.java) | 困难 |
| [482](https://leetcode-cn.com/problems/license-key-formatting/) | [密钥格式化](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LicenseKeyFormatting.java) | 简单 |
| 485 | [最大连续1的个数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaxConsecutiveOnes.java) | 简单 |
| [488](https://leetcode-cn.com/problems/zuma-game/) | [祖玛游戏](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ZumaGame.java) | 困难 |
| [492](https://leetcode-cn.com/problems/construct-the-rectangle/) | [构造矩形](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ConstructTheRectangle.java) | 简单 |
| 495 | [提莫攻击](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/TeemoAttacking.java) | 中等 |
| [496](https://leetcode-cn.com/problems/next-greater-element-i/) | [下一个更大元素 I](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NextGreaterElementI.java) | 简单 |
| [500](https://leetcode-cn.com/problems/keyboard-row/) | [键盘行](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/KeyboardRow.java) | 简单 |
| [504](https://leetcode-cn.com/problems/base-7/) | [七进制数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/Base7.java) | 简单 |
| [506](https://leetcode-cn.com/problems/relative-ranks/) | [相对名次](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RelativeRanks.java) | 简单 |
| [507](https://leetcode-cn.com/problems/perfect-number/) | [完美数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PerfectNumber.java) | 简单 |
| 509 | [斐波那契数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FibonacciNumber.java) | 简单 |
| [513](https://leetcode-cn.com/problems/find-bottom-left-tree-value/) | [找树左下角的值](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindBottomLeftTreeValue.java) | 中等 |
| [515](https://leetcode-cn.com/problems/find-largest-value-in-each-tree-row/) | [在每个树行中找最大值](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindLargestValueInEachTreeRow.java) | 中等 |
| 517 | [超级洗衣机](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SuperWashingMachines.java) | 困难 |
| [519](https://leetcode-cn.com/problems/random-flip-matrix/) | [随机翻转矩阵](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RandomFlipMatrix.java) | 中等 |
| 520 | [检测大写字母](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DetectCapital.java) | 简单 |
| [521](https://leetcode-cn.com/problems/longest-uncommon-subsequence-i/) | [最长特殊序列Ⅰ](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LongestUncommonSubsequenceI.java) | 简单 |
| [525](https://leetcode-cn.com/problems/contiguous-array/) | [连续数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ContiguousArray.java) | 中等 |
| 526 | [优美的排列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BeautifulArrangement.java) | 中等 |
| [528](https://leetcode-cn.com/problems/random-pick-with-weight/) | [按权重随机选择](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RandomPickWithWeight.java) | 中等 |
| 532 | [数组中的K-diff数对](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/KDiffPairsInAnArray.java) | 简单 |
| [537](https://leetcode-cn.com/problems/complex-number-multiplication/) | [复数乘法](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ComplexNumberMultiplication.java) | 中等 |
| [538](https://leetcode-cn.com/problems/convert-bst-to-greater-tree/) | [把二叉搜索树转换为累](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ConvertBstToGreaterTree.java) | 中等 |
| [539](https://leetcode-cn.com/problems/minimum-time-difference/) | [最小时间差](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MinimumTimeDifference.java) | 中等 |
| [540](https://leetcode-cn.com/problems/single-element-in-a-sorted-array/) | [有序数组中的单一元素](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SingleElementInASortedArray.java) | 中等 |
| 543 | [二叉树的直径](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DiameterOfBinaryTree.java) | 简单 |
| [553](https://leetcode-cn.com/problems/optimal-division/) | [最优除法](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/OptimalDivision.java) | 中等 |
| [559](https://leetcode-cn.com/problems/maximum-depth-of-n-ary-tree/) | [N叉树的最大深度](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumDepthOfNAryTree.java) | 简单 |
| 560 | [和为K的子数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SubarraySumEqualsK.java) | 中等 |
| 561 | [数组拆分 I](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ArrayPartitionI.java) | 简单 |
| [563](https://leetcode-cn.com/problems/binary-tree-tilt/) | [二叉树的坡度](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BinaryTreeTilt.java) | 简单 |
| [564](https://leetcode-cn.com/problems/find-the-closest-palindrome/) | [寻找最近的回文数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindTheClosestPalindrome.java) | 困难 |
| 565 | [数组嵌套](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ArrayNesting.java) | 中等 |
| 566 | [重塑矩阵](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ReshapeTheMatrix.java) | 简单 |
| [567](https://leetcode-cn.com/problems/permutation-in-string/) | [字符串的排列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PermutationInString.java) | 中等 |
| [572](https://leetcode-cn.com/problems/subtree-of-another-tree/) | [另一棵树的子树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SubtreeOfAnotherTree.java) | 简单 |
| 575 | [分糖果](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DistributeCandies.java) | 简单 |
| 581 | [最短无序连续子数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ShortestUnsortedOntinuousSubarray.java) | 简单 |
| 583 | [两个字符串的删除操作](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DeleteOperationForTwoStrings.java) | 中等 |
| [589](https://leetcode-cn.com/problems/n-ary-tree-preorder-traversal/) | [N 叉树的前序遍历](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NAryTreePreorderTraversal.java) | 简单 |
| [590](https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal/) | [N 叉树的后序遍历](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NAryTreePostorderTraversal.java) | 简单 |
| [591](https://leetcode-cn.com/problems/tag-validator/) | [标签验证器](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/TagValidator.java) | 困难 |
| [594](https://leetcode-cn.com/problems/longest-harmonious-subsequence/) | [最长和谐子序列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LongestHarmoniousSubsequence.java) | 简单 |
| [598](https://leetcode-cn.com/problems/range-addition-ii/) | [范围求和 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RangeAdditionII.java) | 简单 |
| [599](https://leetcode-cn.com/problems/minimum-index-sum-of-two-lists/) | [两个列表的最小索引总和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MinimumIndexSumOfTwoLists.java) | 简单 |
| 605 | [种花问题](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CanPlaceFlowers.java) | 简单 |
| [606](https://leetcode-cn.com/problems/construct-string-from-binary-tree/) | [根据二叉树创建字符串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ConstructStringFromBinaryTree.java) | 简单 |
| 611 | [有效三角形的个数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ValidTriangleNumber.java) | 中等 |
| 628 | [三个数的最大乘积](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumProductOfThreeNumbers.java) | 简单 |
| [629](https://leetcode-cn.com/problems/k-inverse-pairs-array/) | [K个逆序对数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/KInversePairsArray.java) | 困难 |
| [630](https://leetcode-cn.com/problems/course-schedule-iii/) | [课程表 III](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CourseScheduleIii.java) | 困难 |
| [638](https://leetcode-cn.com/problems/shopping-offers/) | [大礼包](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ShoppingOffers.java) | 中等 |
| 639 | [解码方法 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DecodeWaysIi.java) | 困难 |
| 643 | [子数组最大平均数 I](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumAverageSubarrayI.java) | 简单 |
| [647](https://leetcode-cn.com/problems/palindromic-substrings/) | [回文子串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PalindromicSubstrings.java) | 中等 |
| [648](https://leetcode-cn.com/problems/replace-words/) | [单词替换](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ReplaceWords.java) | 中等 |
| [652](https://leetcode.cn/problems/find-duplicate-subtrees/) | [寻找重复的子树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindDuplicateSubtrees.java) | 中等 |
| [653](https://leetcode-cn.com/problems/two-sum-iv-input-is-a-bst/) | [两数之和 IV-输入 BST](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/TwoSumIvInputIsABst.java) | 简单 |
| [661](https://leetcode-cn.com/problems/image-smoother/) | [图片平滑器](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ImageSmoother.java) | 简单 |
| 665 | [非递减数列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NonDecreasingArray.java) | 简单 |
| 667 | [优美的排列 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BeautifulArrangementII.java) | 中等 |
| 670 | [最大交换](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumSwap.java) | 中等 |
| 674 | [最长连续递增序列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LongestContinuousIncreasingSubsequence.java) | 简单 |
| [676](https://leetcode-cn.com/problems/implement-magic-dictionary/) | [实现一个魔法字典](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ImplementMagicDictionary.java) | 中等 |
| [677](https://leetcode-cn.com/problems/map-sum-pairs/) | [键值映射](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MapSumPairs.java) | 中等 |
| [680](https://leetcode-cn.com/problems/valid-palindrome-ii/) | [验证回文字符串 Ⅱ](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ValidPalindromeII.java) | 简单 |
| [682](https://leetcode-cn.com/problems/baseball-game/) | [棒球比赛](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BaseballGame.java) | 简单 |
| [686](https://leetcode-cn.com/problems/repeated-string-match/) | [重复叠加字符串匹配](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RepeatedStringMatch.java) | 中等 |
| [688](https://leetcode-cn.com/problems/knight-probability-in-chessboard/) | [骑士在棋盘上的概率](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/KnightProbabilityInChessboard.java) | 中等 |
| [689](https://leetcode-cn.com/problems/maximum-sum-of-3-non-overlapping-subarrays/) | [三个无重叠子数组的最大和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumSumOf3NonOverlappingSubarrays.java) | 困难 |
| [693](https://leetcode-cn.com/problems/binary-number-with-alternating-bits/) | [交替位二进制数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BinaryNumberWithAlternatingBits.java) | 简单 |
| [695](https://leetcode-cn.com/problems/max-area-of-island/) | [岛屿的最大面积](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaxAreaOfIsland.java) | 中等 |
| 697 | [数组的度](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DegreeOfAnArray.java) | 简单 |
| [700](https://leetcode-cn.com/problems/search-in-a-binary-search-tree/) | [二叉搜索树中的搜索](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DegreeOfAnArray.java) | 简单 |
| [703](https://leetcode-cn.com/problems/kth-largest-element-in-a-stream/) | [数据流中的第 K 大元素](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/KthLargestElementInAStream.java) | 简单 |
| 704 | [二分查找](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BinarySearch.java) | 简单 |
| [709](https://leetcode-cn.com/problems/to-lower-case/) | [转换成小写字母](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ToLowerCase.java) | 简单 |
| [713](https://leetcode-cn.com/problems/subarray-product-less-than-k/) | [乘积小于K的子数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SubarrayProductLessThanK.java) | 中等 |
| 714 | [买卖股票的最佳时机含手续费](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BestTimeToBuyAndSellStockWithTransactionFee.java) | 中等 |
| [717](https://leetcode-cn.com/problems/1-bit-and-2-bit-characters/) | [1比特与2比特字符](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/OneBitAndTwoBitCharacters.java) | 简单 |
| 718 | [最长重复子数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumLengthOfRepeatedSubarray.java) | 中等 |
| [720](https://leetcode-cn.com/problems/longest-word-in-dictionary/) | [词典中最长的单词](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LongestWordInDictionary.java) | 简单 |
| 724 | [寻找数组的中心索引](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindPivotIndex.java) | 简单 |
| 725 | [分隔链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SplitLinkedListInParts.java) | 中等 |
| [728](https://leetcode-cn.com/problems/self-dividing-numbers/) | [自除数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SelfDividingNumbers.java) | 简单 |
| [729](https://leetcode-cn.com/problems/my-calendar-i/) | [我的日程安排表 I](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MyCalendarI.java) | 中等 |
| [735](https://leetcode-cn.com/problems/asteroid-collision/) | [行星碰撞](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/AsteroidCollision.java) | 中等 |
| [739](https://leetcode-cn.com/problems/daily-temperatures/) | [每日温度](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DailyTemperatures.java) | 中等 |
| 743 | [网络延迟时间](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NetworkDelayTime.java) | 中等 |
| [744](https://leetcode-cn.com/problems/find-smallest-letter-greater-than-target/) | [寻找比目标字母大的最小字母](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindSmallestLetterGreaterThanTarget.java) | 简单 |
| 746 | [使用最小花费爬楼梯](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MinCostClimbingStairs.java) | 简单 |
| 747 | [至少是其他数字两倍的最大数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LargestNumberAtLeastTwiceOfOthers.java) | 简单 |
| [748](https://leetcode-cn.com/problems/shortest-completing-word/) | [最短补全词](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ShortestCompletingWord.java) | 简单 |
| 766 | [托普利茨矩阵](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ToeplitzMatrix.java) | 简单 |
| 769 | [最多能完成排序的块](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaxChunksToMakeSorted.java) | 中等 |
| 771 | [宝石与石头](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/JewelsAndStones.java) | 简单 |
| 775 | [全局倒置与局部倒置](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/GlobalAndLocalInversions.java) | 中等 |
| [780](https://leetcode-cn.com/problems/reaching-points/) | [到达终点](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ReachingPoints.java) | 困难 |
| 783 | [二叉搜索树结点最小距离](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MinimumDistanceBetweenBstNodes.java) | 简单 |
| [786](https://leetcode-cn.com/problems/k-th-smallest-prime-fraction/) | [第 K 个最小的素数分数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/KThSmallestPrimeFraction.java) | 困难 |
| 792 | [匹配子序列的单词数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NumberOfMatchingSubsequences.java) | 中等 |
| 794 | [有效的井字游戏](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ValidTicTacToeState.java) | 中等 |
| 795 | [区间子数组个数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NumberOfSubarraysWithBoundedMaximum.java) | 中等 |
| [796](https://leetcode-cn.com/problems/rotate-string/) | [旋转字符串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RotateString.java) | 简单 |
| [798](https://leetcode-cn.com/problems/smallest-rotation-with-highest-score/) | [得分最高的最小轮调](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SmallestRotationWithHighestScore.java) | 困难 |
| [804](https://leetcode-cn.com/problems/unique-morse-code-words/) | [唯一摩尔斯密码词](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/UniqueMorseCodeWords.java) | 简单 |
| [806](https://leetcode-cn.com/problems/number-of-lines-to-write-string/) | [写字符串需要的行数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NumberOfLinesToWriteString.java) | 简单 |
| [807](https://leetcode-cn.com/problems/max-increase-to-keep-city-skyline/) | [保持城市天际线](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaxIncreaseToKeepCitySkyline.java) | 中等 |
| [814](https://leetcode-cn.com/problems/binary-tree-pruning/) | [二叉树剪枝](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BinaryTreePruning.java) | 中等 |
| [819](https://leetcode-cn.com/problems/most-common-word/) | [最常见的单词](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MostCommonWord.java) | 简单 |
| [820](https://leetcode-cn.com/problems/short-encoding-of-words/) | [单词的压缩编码](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ShortEncodingOfWords.java) | 中等 |
| [821](https://leetcode-cn.com/problems/shortest-distance-to-a-character/) | [字符的最短距离](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ShortestDistanceToACharacter.java) | 简单 |
| [825](https://leetcode-cn.com/problems/friends-of-appropriate-ages/) | [适龄的朋友](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FriendsOfAppropriateAges.java) | 中等 |
| 830 | [较大分组的位置](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PositionsOfLargeGroups.java) | 简单 |
| 832 | [翻转图像](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FlippingAnImage.java) | 简单 |
| 835 | [图像重叠](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ImageOverlap.java) | 中等 |
| 836 | [矩形重叠](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RectangleOverlap.java) | 简单 |
| [838](https://leetcode-cn.com/problems/push-dominoes/) | [推多米诺](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PushDominoes.java) | 中等 |
| 840 | [矩阵中的幻方](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MagicSquaresInGrid.java) | 简单 |
| [846](https://leetcode-cn.com/problems/hand-of-straights/) | [一手顺子](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/HandOfStraights.java) | 中等 |
| 849 | [到最近的人的最大距离](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximizeDistanceToClosestPerson.java) | 简单 |
| [851](https://leetcode-cn.com/problems/loud-and-rich/) | [喧闹和富有](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LoudAndRich.java) | 中等 |
| 852 | [山脉数组的峰顶索引](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PeakIndexInAMountainArray.java) | 简单 |
| [859](https://leetcode-cn.com/problems/buddy-strings/) | [亲密字符串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BuddyStrings.java) | 简单 |
| 861 | [翻转矩阵后的得分](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ScoreAfterFlippingMatrix.java) | 中等 |
| 867 | [转置矩阵](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/TransposeMatrix.java) | 简单 |
| [869](https://leetcode-cn.com/problems/reordered-power-of-2/) | [重新排序得到 2 的幂](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ReorderedPowerOf2.java) | 中等 |
| 870 | [优势洗牌](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/AdvantageShuffle.java) | 中等 |
| 873 | [最长的斐波那契子序列的长度](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LengthOfLongestFibonacciSubsequence.java) | 中等 |
| [875](https://leetcode-cn.com/problems/koko-eating-bananas/) | [爱吃香蕉的珂珂](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/KokoEatingBananas.java) | 中等 |
| 876 | [链表的中间结点](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MiddleOfTheLinkedList.java) | 简单 |
| [884](https://leetcode-cn.com/problems/uncommon-words-from-two-sentences/) | [两句话中的不常见单词](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/UncommonWordsFromTwoSentences.java) | 简单 |
| 888 | [公平的糖果交换](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FairCandySwap.java) | 简单 |
| 892 | [三维形体的表面积](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SurfaceAreaOf3dShapes.java) | 简单 |
| 896 | [单调数列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MonotonicArray.java) | 简单 |
| [897](https://leetcode-cn.com/problems/increasing-order-search-tree/) | [递增顺序搜索树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/IncreasingOrderSearchTree.java) | 简单 |
| 900 | [RLE 迭代器](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RLEIterator.java) | 中等 |
| 905 | [按奇偶排序数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SortArrayByParity.java) | 简单 |
| 907 | [子数组的最小值之和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SumOfSubarrayMinimums.java) | 中等 |
| [911](https://leetcode-cn.com/problems/online-election/) | [在线选举](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/OnlineElection.java) | 中等 |
| 912 | [排序数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SortAnArray.java) | 中等 |
| [913](https://leetcode-cn.com/problems/cat-and-mouse/) | [猫和老鼠](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CatAndMouse.java) | 困难 |
| 914 | [卡牌分组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/XOfAKindInADeckOfCards.java) | 简单 |
| 915 | [分割数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PartitionArrayIntoDisjointIntervals.java) | 中等 |
| [916](https://leetcode-cn.com/problems/reverse-only-letters/) | [仅仅反转字母](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ReverseOnlyLetters.java) | 简单 |
| 918 | [环形子数组的最大和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumSumCircularSubarray.java) | 中等 |
| [919](https://leetcode-cn.com/problems/complete-binary-tree-inserter/) | [完全二叉树插入器](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CompleteBinaryTreeInserter.java) | 中等 |
| 922 | [按奇偶排序数组 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SortArrayByParityII.java) | 简单 |
| 926 | [将字符串翻转到单调递增](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FlipStringToMonotoneIncreasing.java) | 中等 |
| [933](https://leetcode-cn.com/problems/number-of-recent-calls/) | [最近的请求次数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NumberOfRecentCalls.java) | 简单 |
| [937](https://leetcode-cn.com/problems/reorder-data-in-log-files/) | [重新排列日志文件](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ReorderDataInLogFiles.java) | 简单 |
| 941 | [有效的山脉数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ValidMountainArray.java) | 简单 |
| 945 | [使数组唯一的最小增量](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MinimumIncrementToMakeArrayUnique.java) | 中等 |
| [946](https://leetcode-cn.com/problems/validate-stack-sequences/) | [验证栈序列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ValidateStackSequences.java) | 中等 |
| 947 | [移除最多的同行或同列石头](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MostStonesRemovedWithSameRowOrColumn.java) | 中等 |
| 950 | [按递增顺序显示卡牌](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RevealCardsInIncreasingOrder.java) | 中等 |
| [953](https://leetcode-cn.com/problems/verifying-an-alien-dictionary/) | [验证外星语词典](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/VerifyingAnAlienDictionary.java) | 简单 |
| [954](https://leetcode-cn.com/problems/array-of-doubled-pairs/) | [二倍数对数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ArrayOfDoubledPairs.java) | 中等 |
| 961 | [重复 N 次的元素](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NRepeatedElementInSize2nArray.java) | 简单 |
| 962 | [最大宽度坡](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumWidthRamp.java) | 中等 |
| 967 | [连续差相同的数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NumbersWithSameConsecutiveDifferences.java) | 中等 |
| [969](https://leetcode-cn.com/problems/pancake-sorting/) | [煎饼排序](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PancakeSorting.java) | 中等 |
| 974 | [和可被 K 整除的子数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SubarraySumsDivisibleByK.java) | 中等 |
| 977 | [有序数组的平方](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SquaresOfASortedArray.java) | 简单 |
| 978 | [最长湍流子数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LongestTurbulentSubarray.java) | 中等 |
| 985 | [查询后的偶数和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SumOfEvenNumbersAfterQueries.java) | 简单 |
| 989 | [数组形式的整数加法](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/AddToArrayFormOfInteger.java) | 简单 |
| 994 | [腐烂的橘子](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RottingOranges.java) | 简单 |
| 997 | [找到小镇的法官](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindTheTownJudge.java) | 简单 |
| 999 | [车的可用捕获量](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/AvailableCapturesForRook.java) | 简单 |
| [1001](https://leetcode-cn.com/problems/grid-illumination/) | [网格照明](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/GridIllumination.java) | 困难 |
| 1002 | [查找常用字符](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindCommonCharacters.java) | 简单 |
| 1003 | [检查替换后的词是否有效](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CheckIfWordIsValidAfterSubstitutions.java) | 中等 |
| [1004](https://leetcode-cn.com/problems/max-consecutive-ones-iii/) | [最大连续1的个数 III](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaxConsecutiveOnesIii.java) | 中等 |
| [1005](https://leetcode-cn.com/problems/maximize-sum-of-array-after-k-negations/) | [K 次取反后最大化的数组和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximizeSumOfArrayAfterKNegations.java) | 简单 |
| 1007 | [行相等的最少多米诺旋转](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MinimumDominoRotationsForEqualRow.java) | 中等 |
| [1009](https://leetcode-cn.com/problems/complement-of-base-10-integer/) | [十进制整数的反码](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ComplementOfBase10Integer.java) | 简单 |
| 1010 | [总持续时间可被 60 整除的歌曲](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PairsOfSongsWithTotalDurationsDivisibleBy60.java) | 简单 |
| 1011 | [在 D 天内送达包裹的能力](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CapacityToShipPackagesWithinDDays.java) | 中等 |
| 1013 | [将数组分成和相等的三个部分](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PartitionArrayIntoThreePartsWithEqualSum.java) | 简单 |
| 1014 | [最佳观光组合](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BestSightseeingPair.java) | 中等 |
| 1018 | [可被 5 整除的二进制前缀](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BinaryPrefixDivisibleBy5.java) | 简单 |
| 1019 | [链表中的下一个更大节点](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NextGreaterNodeInLinkedList.java) | 中等 |
| [1020](https://leetcode-cn.com/problems/number-of-enclaves/) | [飞地的数量](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NumberOfEnclaves.java) | 中等 |
| 1025 | [除数博弈](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DivisorGame.java) | 简单 |
| [1034](https://leetcode-cn.com/problems/coloring-a-border/) | [边界着色](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ColoringABorder.java) | 中等 |
| 1035 | [不相交的线](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/UncrossedLines.java) | 中等 |
| [1036](https://leetcode-cn.com/problems/escape-a-large-maze/) | [逃离大迷宫](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/EscapeALargeMaze.java) | 困难 |
| [1038](https://leetcode-cn.com/problems/binary-search-tree-to-greater-sum-tree/) | [把二叉搜索树转换为累加树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/BinarySearchTreeToGreaterSumTree.java) | 中等 |
| 1051 | [高度检查器](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/HeightChecker.java) | 简单 |
| 1052 | [爱生气的书店老板](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/GrumpyBookstoreOwner.java) | 中等 |
| 1053 | [交换一次的先前排列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PreviousPermutationWithOneSwap.java) | 中等 |
| 1071 | [字符串的最大公因子](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/GreatestCommonDivisorOfStrings.java) | 简单 |
| [1078](https://leetcode-cn.com/problems/occurrences-after-bigram/) | [Bigram 分词](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/OccurrencesAfterBigram.java) | 简单 |
| 1081 | [不同字符的最小子序列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SmallestSubsequenceOfDistinctCharacters.java) | 中等 |
| 1089 | [复写零](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DuplicateZeros.java) | 简单 |
| 1103 | [分糖果 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DistributeCandiesToPeople.java) | 简单 |
| 1109 | [航班预订统计](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CorporateFlightBookings.java) | 中等 |
| 1111 | [有效括号的嵌套深度](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumNestingDepthOfTwoValidParenthesesStrings.java) | 中等 |
| 1122 | [数组的相对排序](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RelativeSortArray.java) | 简单 |
| 1128 | [等价多米诺骨牌对的数量](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NumberOfEquivalentDominoPairs.java) | 简单 |
| [1143](https://leetcode-cn.com/problems/longest-common-subsequence/) | [最长公共子序列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LongestCommonSubsequence.java) | 中等 |
| 1144 | [递减元素使数组呈锯齿状](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DecreaseElementsToMakeArrayZigzag.java) | 中等 |
| [1154](https://leetcode-cn.com/problems/day-of-the-year/) | [一年中的第几天](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DayOfTheYear.java) | 简单 |
| 1160 | [拼写单词](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindWordsThatCanBeFormedByCharacters.java) | 简单 |
| 1162 | [地图分析](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/AsFarFromLandAsPossible.java) | 中等 |
| 1171 | [从链表中删去总和值为零的连续节点](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RemoveZeroSumConsecutiveNodesFromLinkedList.java) | 中等 |
| 1173 | [第 N 个泰波那契数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NThTribonacciNumber.java) | 简单 |
| [1185](https://leetcode-cn.com/problems/day-of-the-week/) | [一周中的第几天](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DayOfTheWeek.java) | 简单 |
| [1189](https://leetcode-cn.com/problems/maximum-number-of-balloons/) | [“气球” 的最大数量](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumNumberOfBalloons.java) | 简单 |
| 1200 | [最小绝对差](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MinimumAbsoluteDifference.java) | 简单 |
| 1217 | [玩筹码](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PlayWithChips.java) | 简单 |
| 1218 | [最长定差子序列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LongestArithmeticSubsequenceOfGivenDifference.java) | 中等 |
| [1219](https://leetcode-cn.com/problems/path-with-maximum-gold/) | [黄金矿工](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PathWithMaximumGold.java) | 中等 |
| [1220](https://leetcode-cn.com/problems/count-vowels-permutation/) | [统计元音字母序列的数目](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CountVowelsPermutation.java) | 困难 |
| 1221 | [分割平衡字符串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SplitAStringInBalancedStrings.java) | 简单 |
| 1222 | [可以攻击国王的皇后](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/QueensThatCanAttackTheKing.java) | 中等 |
| 1232 | [缀点成线](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CheckIfItIsAStraightLine.java) | 简单 |
| 1237 | [找出给定方程的正整数解](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindPositiveIntegerSolutionForAGivenEquation.java) | 简单 |
| 1247 | [交换字符使得字符串相同](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MinimumSwapsToMakeStringsEqual.java) | 简单 |
| 1248 | [统计「优美子数组」](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CountNumberOfNiceSubarrays.java) | 中等 |
| 1252 | [奇数值单元格的数目](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CellsWithOddValuesInAMatrix.java) | 简单 |
| 1260 | [二维网格迁移](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/Shift2dGrid.java) | 简单 |
| 1262 | [可被三整除的最大和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/GreatestSumDivisibleByThree.java) | 中等 |
| 1275 | [找出井字棋的获胜者](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindWinnerOnATicTacToeGame.java) | 简单 |
| 1276 | [不浪费原料的汉堡制作方案](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NumberOfBurgersWithNoWasteOfIngredients.java) | 中等 |
| 1277 | [统计全为 1 的正方形子矩阵](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CountSquareSubmatricesWithAllOnes.java) | 中等 |
| 1281 | [整数的各位积和之差](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SubtractTheProductAndSumOfDigitsOfAnInteger.java) | 简单 |
| 1282 | [用户分组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/GroupThePeopleGivenTheGroupSizeTheyBelongTo.java) | 中等 |
| 1283 | [使结果不超过阈值的最小除数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindTheSmallestDivisorGivenAThreshold.java) | 中等 |
| 1287 | [有序数组中出现次数超过25%的元素](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ElementAppearingMoreThan25InSortedArray.java) | 简单 |
| 1290 | [二进制链表转整数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ConvertBinaryNumberInALinkedListToInteger.java) | 简单 |
| 1291 | [顺次数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SequentialDigits.java) | 中等 |
| 1295 | [统计位数为偶数的数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindNumbersWithEvenNumberOfDigits.java) | 简单 |
| [1296](https://leetcode-cn.com/problems/divide-array-in-sets-of-k-consecutive-numbers/) | [划分数组为连续数字的集合](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DivideArrayInSetsOfKConsecutiveNumbers.java) | 中等 |
| 1297 | [子串的最大出现次数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumNumberOfOccurrencesOfASubstring.java) | 中等 |
| 1298 | [你能从盒子里获得的最大糖果数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumCandiesYouCanGetFromBoxes.java) | 困难 |
| 1299 | [将每个元素替换为右侧最大元素](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ReplaceElementsWithGreatestElementOnRightSide.java) | 简单 |
| 1300 | [转变数组后最接近目标值的数组和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SumOfMutatedArrayClosestToTarget.java) | 中等 |
| 1302 | [层数最深叶子节点的和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DeepestLeavesSum.java) | 中等 |
| 1304 | [和为零的N个唯一整数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindNUniqueIntegersSumUpToZero.java) | 简单 |
| [1305](https://leetcode-cn.com/problems/all-elements-in-two-binary-search-trees/) | [两棵二叉搜索树中的所有元素](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/AllElementsInTwoBinarySearchTrees.java) | 中等 |
| 1306 | [跳跃游戏 III](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/JumpGameIII.java) | 中等 |
| 1307 | [口算难题](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/VerbalArithmeticPuzzle.java) | 困难 |
| 1309 | [解码字母到整数映射](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DecryptStringFromAlphabetToIntegerMapping.java) | 简单 |
| 1310 | [子数组异或查询](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/XorQueriesOfASubarray.java) | 中等 |
| 1311 | [获取你好友已观看的视频](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/GetWatchedVideosByYourFriends.java) | 中等 |
| 1313 | [解压缩编码列表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DecompressRunLengthEncodedList.java) | 简单 |
| 1314 | [矩阵区域和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ConvertIntegerToTheSumOfTwoNoZeroIntegers.java) | 中等 |
| 1315 | [祖父节点值为偶数的节点和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SumOfNodesWithEvenValuedGrandparent.java) | 中等 |
| [1332](https://leetcode-cn.com/problems/remove-palindromic-subsequences/) | [删除回文子序列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RemovePalindromicSubsequences.java) | 简单 |
| 1339 | [分裂二叉树的最大乘积](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumProductOfSplittedBinaryTree.java) | 中等 |
| 1341 | [方阵中战斗力最弱的 K 行](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/TheKWeakestRowsInAMatrix.java) | 简单 |
| 1342 | [数组大小减半](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ReduceArraySizeToTheHalf.java) | 中等 |
| 1342 | [将数字变成 0 的操作次数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NumberOfStepsToReduceANumberToZero.java) | 简单 |
| 1343 | [大小为 K 且平均值大于等于阈值的子数组数目](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NumberOfSubArraysOfSizeKAndAverageGreaterThanOrEqualToThreshold.java) | 中等 |
| 1344 | [时钟指针的夹角](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/AngleBetweenHandsOfAClock.java) | 中等 |
| [1345](https://leetcode-cn.com/problems/jump-game-iv/) | [跳跃游戏 IV](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/JumpGameIv.java) | 困难 |
| 1356 | [根据数字二进制下 1 的数目排序](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SortIntegersByTheNumberOf1Bits.java) | 简单 |
| 1357 | [每隔 n 个顾客打折](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ApplyDiscountEveryNOrders.java) | 中等 |
| 1358 | [包含所有三种字符的子字符串数目](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NumberOfSubstringsContainingAllThreeCharacters.java) | 中等 |
| 1359 | [有效的快递序列数目](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CountAllValidPickupAndDeliveryOptions.java) | 困难 |
| 1360 | [日期之间隔几天](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NumberOfDaysBetweenTwoDates.java) | 简单 |
| 1361 | [验证二叉树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ValidateBinaryTreeNodes.java) | 中等 |
| 1362 | [最接近的因数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ClosestDivisors.java) | 中等 |
| [1380](https://leetcode-cn.com/problems/lucky-numbers-in-a-matrix/) | [矩阵中的幸运数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LuckyNumbersInAMatrix.java) | 简单 |
| [1405](https://leetcode-cn.com/problems/longest-happy-string/) | [最长快乐字符串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LongestHappyString.java) | 中等 |
| [1414](https://leetcode-cn.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/) | [和为 K 的最少斐波那契数字数目](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindTheMinimumNumberOfFibonacciNumbersWhoseSumIsK.java) | 中等 |
| [1436](https://leetcode-cn.com/problems/destination-city/) | [旅行终点站](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DestinationCity.java) | 简单 |
| [1446](https://leetcode-cn.com/problems/consecutive-characters/) | [连续字符](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ConsecutiveCharacters.java) | 简单 |
| [1447](https://leetcode-cn.com/problems/simplified-fractions/) | [最简分数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SimplifiedFractions.java) | 中等 |
| [1518](https://leetcode-cn.com/problems/water-bottles/) | [换酒问题](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/WaterBottles.java) | 简单 |
| [1576](https://leetcode-cn.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/) | [替换所有的问号](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ReplaceAllSToAvoidConsecutiveRepeatingCharacters.java) | 简单 |
| 1588 | [所有奇数长度子数组的和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SumOfAllOddLengthSubarrays.java) | 简单 |
| [1598](https://leetcode-cn.com/problems/crawler-log-folder/) | [文件夹操作日志搜集器](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CrawlerLogFolder.java) | 简单 |
| [1601](https://leetcode-cn.com/problems/maximum-number-of-achievable-transfer-requests/) | [最多可达成的换楼请求数目](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumNumberOfAchievableTransferRequests.java) | 困难 |
| [1606](https://leetcode-cn.com/problems/find-servers-that-handled-most-number-of-requests/) | [找到处理最多请求的服务器](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindServersThatHandledMostNumberOfRequests.java) | 困难 |
| [1609](https://leetcode-cn.com/problems/even-odd-tree/) | [奇偶树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/EvenOddTree.java) | 中等 |
| [1610](https://leetcode-cn.com/problems/maximum-number-of-visible-points/) | [可见点的最大数目](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumNumberOfVisiblePoints.java) | 困难 |
| [1614](https://leetcode-cn.com/problems/maximum-nesting-depth-of-the-parentheses/) | [括号的最大嵌套深度](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumNestingDepthOfTheParentheses.java) | 简单 |
| [1629](https://leetcode-cn.com/problems/slowest-key/) | [按键持续时间最长的键](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SlowestKey.java) | 简单 |
| [1688](https://leetcode-cn.com/problems/count-of-matches-in-tournament/) | [比赛中的配对次数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CountOfMatchesInTournament.java) | 简单 |
| [1705](https://leetcode-cn.com/problems/maximum-number-of-eaten-apples/) | [吃苹果的最大数目](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumNumberOfEatenApples.java) | 中等 |
| [1706](https://leetcode-cn.com/problems/where-will-the-ball-fall/) | [球会落何处](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/WhereWillTheBallFall.java) | 中等 |
| [1716](https://leetcode-cn.com/problems/calculate-money-in-leetcode-bank/) | [计算力扣银行的钱](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CalculateMoneyInLeetcodeBank.java) | 简单 |
| [1719](https://leetcode-cn.com/problems/number-of-ways-to-reconstruct-a-tree/) | [重构一棵树的方案数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NumberOfWaysToReconstructATree.java) | 困难 |
| [1725](https://leetcode-cn.com/problems/number-of-rectangles-that-can-form-the-largest-square/) | [可以形成最大正方形的矩形数目](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NumberOfRectanglesThatCanFormTheLargestSquare.java) | 简单 |
| [1748](https://leetcode-cn.com/problems/sum-of-unique-elements/) | [唯一元素的和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SumOfUniqueElements.java) | 简单 |
| [1763](https://leetcode-cn.com/problems/longest-nice-substring/) | [最长的美好子字符串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/LongestNiceSubstring.java) | 简单 |
| [1765](https://leetcode-cn.com/problems/map-of-highest-peak/) | [地图中的最高点](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MapOfHighestPeak.java) | 中等 |
| [1775](https://leetcode.cn/problems/equal-sum-arrays-with-minimum-number-of-operations/) | [通过最少操作次数使数组的和相等](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/EqualSumArraysWithMinimumNumberOfOperations.java) | 中等 |
| [1791](https://leetcode-cn.com/problems/find-center-of-star-graph/) | [找出星型图的中心节点](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindCenterOfStarGraph.java) | 简单 |
| [1805](https://leetcode.cn/problems/number-of-different-integers-in-a-string/) | [字符串中不同整数的数目](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/NumberOfDifferentIntegersInAString.java) | 简单 |
| [1812](https://leetcode.cn/problems/determine-color-of-a-chessboard-square/) | [判断国际象棋棋盘中一个格子的颜色](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DetermineColorOfAChessboardSquare.java) | 简单 |
| [1816](https://leetcode-cn.com/problems/truncate-sentence/) | [截断句子](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/TruncateSentence.java) | 简单 |
| [1823](https://leetcode-cn.com/problems/find-the-winner-of-the-circular-game/) | [找出游戏的获胜者](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindTheWinnerOfTheCircularGame.java) | 中等 |
| [1984](https://leetcode-cn.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores/) | [学生分数的最小差值](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MinimumDifferenceBetweenHighestAndLowestOfKScores.java) | 简单 |
| [1994](https://leetcode-cn.com/problems/the-number-of-good-subsets/) | [好子集的数目](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/TheNumberOfGoodSubsets.java) | 困难 |
| [1995](https://leetcode-cn.com/problems/count-special-quadruplets/) | [统计特殊四元组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CountSpecialQuadruplets.java) | 简单 |
| [1996](https://leetcode-cn.com/problems/the-number-of-weak-characters-in-the-game/) | [游戏中弱角色的数量](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/TheNumberOfWeakCharactersInTheGame.java) | 中等 |
| [2000](https://leetcode-cn.com/problems/reverse-prefix-of-word/) | [反转单词前缀](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/ReversePrefixOfWord.java) | 简单 |
| [2006](https://leetcode-cn.com/problems/count-number-of-pairs-with-absolute-difference-k/) | [差的绝对值为 K 的数对数目](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CountNumberOfPairsWithAbsoluteDifferenceK.java) | 简单 |
| [2013](https://leetcode-cn.com/problems/detect-squares/) | [检测正方形](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/DetectSquares.java) | 中等 |
| [2016](https://leetcode-cn.com/problems/maximum-difference-between-increasing-elements/) | [增量元素之间的最大差值](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximumDifferenceBetweenIncreasingElements.java) | 简单 |
| [2022](https://leetcode-cn.com/problems/convert-1d-array-into-2d-array/) | [将一维数组转变成二维数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/Convert1dArrayInto2dArray.java) | 简单 |
| [2024](https://leetcode-cn.com/problems/maximize-the-confusion-of-an-exam/) | [考试的最大困扰度](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MaximizeTheConfusionOfAnExam.java) | 中等 |
| [2027](https://leetcode-cn.com/problems/minimum-moves-to-convert-string/) | [转换字符串的最少操作次数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MinimumMovesToConvertString.java) | 简单 |
| [2028](https://leetcode-cn.com/problems/find-missing-observations/) | [找出缺失的观测数据](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindMissingObservations.java) | 中等 |
| [2029](https://leetcode-cn.com/problems/stone-game-ix/) | [石子游戏 IX](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/StoneGameIx.java) | 中等 |
| [2032](https://leetcode-cn.com/problems/two-out-of-three/) | [至少在两个数组中出现的值](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/TwoOutOfThree.java) | 简单 |
| [2033](https://leetcode-cn.com/problems/minimum-operations-to-make-a-uni-value-grid/) | [获取单值网格的最小操作数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/MinimumOperationsToMakeAUniValueGrid.java) | 中等 |
| [2034](https://leetcode-cn.com/problems/stock-price-fluctuation/) | [股票价格波动](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/StockPriceFluctuation.java) | 中等 |
| [2038](https://leetcode-cn.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/) | [如果相邻两个颜色均相同则删除当前颜色](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/RemoveColoredPiecesIfBothNeighborsAreTheSameColor.java) | 中等 |
| [2039](https://leetcode-cn.com/problems/the-time-when-the-network-becomes-idle/) | [网络空闲的时刻](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/TheTimeWhenTheNetworkBecomesIdle.java) | 中等 |
| [2043](https://leetcode-cn.com/problems/simple-bank-system/) | [简易银行系统](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SimpleBankSystem.java) | 中等 |
| [2044](https://leetcode-cn.com/problems/count-number-of-maximum-bitwise-or-subsets/) | [统计按位或能得到最大值的子集数目](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CountNumberOfMaximumBitwiseOrSubsets.java) | 中等 |
| [2045](https://leetcode-cn.com/problems/second-minimum-time-to-reach-destination/) | [到达目的地的第二短时间](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SecondMinimumTimeToReachDestination.java) | 困难 |
| [2049](https://leetcode-cn.com/problems/count-nodes-with-the-highest-score/) | [统计最高分的节点数目](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/CountNodesWithTheHighestScore.java) | 中等 |
| [2055](https://leetcode-cn.com/problems/plates-between-candles/) | [蜡烛之间的盘子](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/PlatesBetweenCandles.java) | 中等 |
| [2100](https://leetcode-cn.com/problems/find-good-days-to-rob-the-bank/) | [到达目的地的第二短时间](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/FindGoodDaysToRobTheBank.java) | 中等 |
| [2104](https://leetcode-cn.com/problems/sum-of-subarray-ranges/) | [子数组范围和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/SumOfSubarrayRanges.java) | 中等 |
## :currency_exchange:多线程
| 序号 | 题名 | 难度 |
| ------------------------------------------------------------ | ------------------------------------------------------------ | ---- |
| [1114](https://leetcode-cn.com/problems/print-in-order/) | [按序打印](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/multithread/PrintInOrder.java) | 简单 |
| [1115](https://leetcode-cn.com/problems/print-foobar-alternately/) | [交替打印FooBar](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/multithread/PrintFoobarAlternately.java) | 中等 |
| [1116](https://leetcode-cn.com/problems/print-zero-even-odd/) | [打印零与奇偶数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/multithread/PrintZeroEvenOdd.java) | 中等 |
## :hot_pepper:程序员面试金典
| 序号 | 题名 | 难度 |
| ------------------------------------------------------------ | ------------------------------------------------------------ | ---- |
| [面试题 01.06](https://leetcode-cn.com/problems/compress-string-lcci/) | [字符串压缩](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/lcci/CompressStringLcci.java) | 简单 |
| [面试题 01.07](https://leetcode-cn.com/problems/rotate-matrix-lcci/) | [旋转矩阵](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/lcci/RotateMatrixLcci.java) | 中等 |
| [面试题 10.01](https://leetcode-cn.com/problems/sorted-merge-lcci/) | [合并排序的数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/lcci/SortedMergeLcci.java) | 简单 |
| [面试题 17.16](https://leetcode-cn.com/problems/the-masseuse-lcci/) | [按摩师](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/lcci/TheMasseuseLcci.java) | 简单 |
## :fountain_pen:剑指 Offer（第 2 版）
| 序号 | 题名 | 难度 |
| ------------------------------------------------------------ | ------------------------------------------------------------ | ---- |
| [剑指 Offer 03](https://leetcode-cn.com/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/) | [数组中重复的数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question03.java) | 简单 |
| [剑指 Offer 04](https://leetcode-cn.com/problems/er-wei-shu-zu-zhong-de-cha-zhao-lcof/) | [二维数组中的查找](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question04.java) | 简单 |
| [剑指 Offer 05](https://leetcode-cn.com/problems/ti-huan-kong-ge-lcof/) | [替换空格](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question05.java) | 简单 |
| [剑指 Offer 06](https://leetcode-cn.com/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/) | [从尾到头打印链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question06.java) | 简单 |
| [剑指 Offer 07](https://leetcode-cn.com/problems/zhong-jian-er-cha-shu-lcof/) | [重建二叉树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question07.java) | 中等 |
| [剑指 Offer 09](https://leetcode-cn.com/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/) | [用两个栈实现队列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question09.java) | 简单 |
| [剑指 Offer 10-I](https://leetcode-cn.com/problems/fei-bo-na-qi-shu-lie-lcof/) | [斐波那契数列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question10_I.java) | 简单 |
| [剑指 Offer 10-II](https://leetcode-cn.com/problems/qing-wa-tiao-tai-jie-wen-ti-lcof/) | [青蛙跳台阶问题](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question10_II.java) | 简单 |
| [剑指 Offer 11](https://leetcode-cn.com/problems/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof/) | [旋转数组的最小数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question11.java) | 简单 |
| [剑指 Offer 12](https://leetcode-cn.com/problems/ju-zhen-zhong-de-lu-jing-lcof/) | [矩阵中的路径](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question12.java) | 中等 |
| [剑指 Offer 13](https://leetcode-cn.com/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/) | [机器人的运动范围](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question13.java) | 中等 |
| [剑指 Offer 14-I](https://leetcode-cn.com/problems/jian-sheng-zi-lcof/) | [剪绳子](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question14_I.java) | 中等 |
| [剑指 Offer 14-II](https://leetcode-cn.com/problems/jian-sheng-zi-ii-lcof/) | [剪绳子 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question14_II.java) | 中等 |
| [剑指 Offer 15](https://leetcode-cn.com/problems/er-jin-zhi-zhong-1de-ge-shu-lcof/) | [二进制中1的个数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question15.java) | 简单 |
| [剑指 Offer 16](https://leetcode-cn.com/problems/shu-zhi-de-zheng-shu-ci-fang-lcof/) | [值的整数次方](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question16.java) | 中等 |
| [剑指 Offer 17](https://leetcode-cn.com/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/) | [打印从1到最大的n位数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question17.java) | 简单 |
| [剑指 Offer 18](https://leetcode-cn.com/problems/shan-chu-lian-biao-de-jie-dian-lcof/) | [删除链表的节点](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question18.java) | 简单 |
| [剑指 Offer 19](https://leetcode-cn.com/problems/zheng-ze-biao-da-shi-pi-pei-lcof/) | [正则表达式匹配](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question19.java) | |
| [剑指 Offer 20](https://leetcode-cn.com/problems/biao-shi-shu-zhi-de-zi-fu-chuan-lcof/) | [表示数值的字符串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question18.java) | 中等 |
| [剑指 Offer 21](https://leetcode-cn.com/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/) | [调整数组顺序使奇数位于偶数前面](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question21.java) | 简单 |
| [剑指 Offer 22](https://leetcode-cn.com/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/) | [链表中倒数第k个节点](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question22.java) | 简单 |
| [剑指 Offer 24](https://leetcode-cn.com/problems/fan-zhuan-lian-biao-lcof/) | [反转链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question24.java) | 简单 |
| [剑指 Offer 25](https://leetcode-cn.com/problems/he-bing-liang-ge-pai-xu-de-lian-biao-lcof/) | [合并两个排序的链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question25.java) | 简单 |
| [剑指 Offer 26](https://leetcode-cn.com/problems/shu-de-zi-jie-gou-lcof/) | [树的子结构](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question26.java) | 中等 |
| [剑指 Offer 27](https://leetcode-cn.com/problems/er-cha-shu-de-jing-xiang-lcof/) | [二叉树的镜像](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question27.java) | 简单 |
| [剑指 Offer 28](https://leetcode-cn.com/problems/dui-cheng-de-er-cha-shu-lcof/) | [对称的二叉树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question28.java) | 简单 |
| [剑指 Offer 29](https://leetcode-cn.com/problems/shun-shi-zhen-da-yin-ju-zhen-lcof/) | [顺时针打印矩阵](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question29.java) | 简单 |
| [剑指 Offer 30](https://leetcode-cn.com/problems/bao-han-minhan-shu-de-zhan-lcof/) | [包含min函数的栈](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question30.java) | 简单 |
| [剑指 Offer 31](https://leetcode-cn.com/problems/zhan-de-ya-ru-dan-chu-xu-lie-lcof/) | [栈的压入、弹出序列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question31.java) | 中等 |
| [剑指 Offer 32-I](https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof/) | [从上到下打印二叉树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question32_I.java) | 中等 |
| [剑指 Offer 32-II](https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof/) | [从上到下打印二叉树 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question32_II.java) | 简单 |
| [剑指 Offer 32-III](https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/) | [从上到下打印二叉树 III](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question32_III.java) | 简单 |
| [剑指 Offer 33](https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/) | [二叉搜索树的后序遍历序列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question33.java) | 中等 |
| [剑指 Offer 34](https://leetcode-cn.com/problems/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof/) | [二叉树中和为某一值的路径](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question34.java) | 中等 |
| [剑指 Offer 35](https://leetcode-cn.com/problems/fu-za-lian-biao-de-fu-zhi-lcof/) | [复杂链表的复制](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question35.java) | 中等 |
| [剑指 Offer 36](https://leetcode-cn.com/problems/er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof/) | [二叉搜索树与双向链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question36.java) | 中等 |
| [剑指 Offer 37](https://leetcode-cn.com/problems/xu-lie-hua-er-cha-shu-lcof/) | [序列化二叉树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question37.java) | 困难 |
| [剑指 Offer 38](https://leetcode-cn.com/problems/zi-fu-chuan-de-pai-lie-lcof/) | [字符串的排列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question38.java) | 中等 |
| [剑指 Offer 39](https://leetcode-cn.com/problems/shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof/) | [数组中出现次数超过一半的数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question39.java) | 简单 |
| [剑指 Offer 40](https://leetcode-cn.com/problems/zui-xiao-de-kge-shu-lcof/) | [最小的k个数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question40.java) | 简单 |
| [剑指 Offer 41](https://leetcode-cn.com/problems/shu-ju-liu-zhong-de-zhong-wei-shu-lcof/) | [数据流中的中位数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question41.java) | 困难 |
| [剑指 Offer 42](https://leetcode-cn.com/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof/) | [连续子数组的最大和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question42.java) | 简单 |
| [剑指 Offer 43](https://leetcode-cn.com/problems/1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof/) | [1～n 整数中 1 出现的次数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question43.java) | 困难 |
| [剑指 Offer 44](https://leetcode-cn.com/problems/shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof/) | [数字序列中某一位的数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question44.java) | 中等 |
| [剑指 Offer 45](https://leetcode-cn.com/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/) | [把数组排成最小的数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question45.java) | 中等 |
| [剑指 Offer 46](https://leetcode-cn.com/problems/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof/) | [把数字翻译成字符串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question46.java) | 中等 |
| [剑指 Offer 47](https://leetcode-cn.com/problems/li-wu-de-zui-da-jie-zhi-lcof/) | [礼物的最大价值](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question47.java) | 中等 |
| [剑指 Offer 48](https://leetcode-cn.com/problems/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof/) | [最长不含重复字符的子字符串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question48.java) | 中等 |
| [剑指 Offer 49](https://leetcode-cn.com/problems/chou-shu-lcof/) | [丑数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question49.java) | 中等 |
| [剑指 Offer 50](https://leetcode-cn.com/problems/di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof/) | [第一个只出现一次的字符](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question50.java) | 简单 |
| [剑指 Offer 51](https://leetcode-cn.com/problems/shu-zu-zhong-de-ni-xu-dui-lcof/) | [数组中的逆序对](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question51.java) | 困难 |
| [剑指 Offer 52](https://leetcode-cn.com/problems/liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof/) | [两个链表的第一个公共节点](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question52.java) | 简单 |
| [剑指 Offer 53-I](https://leetcode-cn.com/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof/) | [在排序数组中查找数字 I](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question53_I.java) | 简单 |
| [剑指 Offer 53-II](https://leetcode-cn.com/problems/que-shi-de-shu-zi-lcof/) | [0～n-1中缺失的数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question53_II.java) | 简单 |
| [剑指 Offer 54](https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof/) | [二叉搜索树的第k大节点](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question54.java) | 简单 |
| [剑指 Offer 55-I](https://leetcode-cn.com/problems/er-cha-shu-de-shen-du-lcof/) | [二叉树的深度](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question55_I.java) | 简单 |
| [剑指 Offer 55-II](https://leetcode-cn.com/problems/ping-heng-er-cha-shu-lcof/) | [平衡二叉树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question55_II.java) | 简单 |
| [剑指 Offer 56-I](https://leetcode-cn.com/problems/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof/) | [数组中数字出现的次数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question56_I.java) | 中等 |
| [剑指 Offer 56-II](https://leetcode-cn.com/problems/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof/) | [数组中数字出现的次数 II](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question56_II.java) | 中等 |
| [剑指 Offer 57](https://leetcode-cn.com/problems/he-wei-sde-liang-ge-shu-zi-lcof/) | [和为s的两个数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question57.java) | 简单 |
| [剑指 Offer 57-II](https://leetcode-cn.com/problems/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof/) | [和为s的连续正数序列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question57_II.java) | 简单 |
| [剑指 Offer 58-I](https://leetcode-cn.com/problems/fan-zhuan-dan-ci-shun-xu-lcof/) | [翻转单词顺序](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question58_I.java) | 简单 |
| [剑指 Offer 58-II](https://leetcode-cn.com/problems/zuo-xuan-zhuan-zi-fu-chuan-lcof/) | [左旋转字符串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question58_II.java) | 简单 |
| [剑指 Offer 59 - I](https://leetcode-cn.com/problems/hua-dong-chuang-kou-de-zui-da-zhi-lcof/) | [滑动窗口的最大值](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question59_I.java) | 困难 |
| [剑指 Offer 59-II](https://leetcode-cn.com/problems/dui-lie-de-zui-da-zhi-lcof/) | [队列的最大值](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question59_II.java) | 中等 |
| [剑指 Offer 60](https://leetcode-cn.com/problems/nge-tou-zi-de-dian-shu-lcof/) | [n个骰子的点数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question60.java) | 中等 |
| [剑指 Offer 61](https://leetcode-cn.com/problems/bu-ke-pai-zhong-de-shun-zi-lcof/) | [扑克牌中的顺子](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question61.java) | 简单 |
| [剑指 Offer 62](https://leetcode-cn.com/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/) | [圆圈中最后剩下的数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question62.java) | 简单 |
| [剑指 Offer 63](https://leetcode-cn.com/problems/gu-piao-de-zui-da-li-run-lcof/) | [股票的最大利润](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question63.java) | 中等 |
| [剑指 Offer 64](https://leetcode-cn.com/problems/qiu-12n-lcof/) | [求1+2+…+n](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question64.java) | 中等 |
| [剑指 Offer 65](https://leetcode-cn.com/problems/bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof/) | [不用加减乘除做加法](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question65.java) | 简单 |
| [剑指 Offer 66](https://leetcode-cn.com/problems/gou-jian-cheng-ji-shu-zu-lcof/) | [构建乘积数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question66.java) | 中等 |
| [剑指 Offer 67](https://leetcode-cn.com/problems/ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof/) | [把字符串转换成整数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question67.java) | 中等 |
| [剑指 Offer 68-I](https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof/) | [二叉搜索树的最近公共祖先](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question68_I.java) | 简单 |
| [剑指 Offer 68-II](https://leetcode-cn.com/problems/er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof/) | [二叉树的最近公共祖先](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstooffer/Question68_II.java) | 简单 |
## 🚢剑指 Offer（专项突击版）
| 序号 | 题名 | 难度 |
| ------------------------------------------------------------ | ------------------------------------------------------------ | ---- |
| [剑指 Offer II 001](https://leetcode-cn.com/problems/xoh6Oh/) | [整数除法](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question001.java) | 简单 |
| [剑指 Offer II 002](https://leetcode-cn.com/problems/JFETK5/) | [二进制加法](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question002.java) | 简单 |
| [剑指 Offer II 003](https://leetcode-cn.com/problems/w3tCBm/) | [前 n 个数字二进制中 1 的个数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question003.java) | 简单 |
| [剑指 Offer II 004](https://leetcode-cn.com/problems/WGki4K/) | [只出现一次的数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question004.java) | 中等 |
| [剑指 Offer II 005](https://leetcode-cn.com/problems/aseY1I/) | [单词长度的最大乘积](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question005.java) | 中等 |
| [剑指 Offer II 006](https://leetcode-cn.com/problems/kLl5u1/) | [排序数组中两个数字之和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question006.java) | 简单 |
| [剑指 Offer II 007](https://leetcode-cn.com/problems/1fGaJU/) | [数组中和为 0 的三个数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question007.java) | 中等 |
| [剑指 Offer II 008](https://leetcode-cn.com/problems/2VG8Kg/) | [和大于等于 target 的最短子数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question008.java) | 中等 |
| [剑指 Offer II 009](https://leetcode-cn.com/problems/ZVAVXX/) | [乘积小于 K 的子数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question009.java) | 中等 |
| [剑指 Offer II 010](https://leetcode-cn.com/problems/QTMn0o/) | [和为 k 的子数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question010.java) | 中等 |
| [剑指 Offer II 011](https://leetcode-cn.com/problems/A1NYOS/) | [0 和 1 个数相同的子数组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question011.java) | 中等 |
| [剑指 Offer II 012](https://leetcode-cn.com/problems/tvdfij/) | [左右两边子数组的和相等](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question012.java) | 简单 |
| [剑指 Offer II 013](https://leetcode-cn.com/problems/O4NDxx/) | [二维子矩阵的和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question013.java) | 中等 |
| [剑指 Offer II 014](https://leetcode-cn.com/problems/MPnaiL/) | [字符串中的变位词](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question014.java) | 中等 |
| [剑指 Offer II 015](https://leetcode-cn.com/problems/VabMRr/) | [字符串中的所有变位词](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question015.java) | 中等 |
| [剑指 Offer II 016](https://leetcode-cn.com/problems/wtcaE1/) | [不含重复字符的最长子字符串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question016.java) | 简单 |
| [剑指 Offer II 017](https://leetcode-cn.com/problems/M1oyTv/) | [含有所有字符的最短字符串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question017.java) | 困难 |
| [剑指 Offer II 018](https://leetcode-cn.com/problems/XltzEq/) | [有效的回文](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question018.java) | 简单 |
| [剑指 Offer II 019](https://leetcode-cn.com/problems/RQku0D/) | [最多删除一个字符得到回文](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question019.java) | 简单 |
| [剑指 Offer II 020](https://leetcode-cn.com/problems/a7VOhD/) | [回文子字符串的个数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question020.java) | 简单 |
| [剑指 Offer II 021](https://leetcode-cn.com/problems/SLwz0R/) | [删除链表的倒数第 n 个结点](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question021.java) | 中等 |
| [剑指 Offer II 022](https://leetcode-cn.com/problems/c32eOV/) | [链表中环的入口节点](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question022.java) | 中等 |
| [剑指 Offer II 023](https://leetcode-cn.com/problems/3u1WK4/) | [两个链表的第一个重合节点](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question023.java) | 简单 |
| [剑指 Offer II 024](https://leetcode-cn.com/problems/UHnkqh/) | [反转链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question024.java) | 简单 |
| [剑指 Offer II 025](https://leetcode-cn.com/problems/lMSNwu/) | [链表中的两数相加](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question025.java) | 中等 |
| [剑指 Offer II 026](https://leetcode-cn.com/problems/LGjMqU/) | [重排链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question026.java) | 中等 |
| [剑指 Offer II 027](https://leetcode-cn.com/problems/aMhZSa/) | [回文链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question027.java) | 简单 |
| [剑指 Offer II 028](https://leetcode-cn.com/problems/Qv1Da2/) | [展平多级双向链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question028.java) | 中等 |
| [剑指 Offer II 029](https://leetcode-cn.com/problems/4ueAj6/) | [排序的循环链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question029.java) | 中等 |
| [剑指 Offer II 030](https://leetcode-cn.com/problems/FortPu/) | [插入、删除和随机访问都是 O(1) 的容器](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question030.java) | 中等 |
| [剑指 Offer II 031](https://leetcode-cn.com/problems/OrIXps/) | [最近最少使用缓存](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question031.java) | 中等 |
| [剑指 Offer II 032](https://leetcode-cn.com/problems/dKk3P7/) | [有效的变位词](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question032.java) | 简单 |
| [剑指 Offer II 033](https://leetcode-cn.com/problems/sfvd7V/) | [变位词组](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question033.java) | 中等 |
| [剑指 Offer II 034](https://leetcode-cn.com/problems/lwyVBB/) | [外星语言是否排序](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question034.java) | 简单 |
| [剑指 Offer II 035](https://leetcode-cn.com/problems/569nqc/) | [最小时间差](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question035.java) | 中等 |
| [剑指 Offer II 036](https://leetcode-cn.com/problems/8Zf90G/) | [后缀表达式](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question036.java) | 中等 |
| [剑指 Offer II 037](https://leetcode-cn.com/problems/XagZNi/) | [小行星碰撞](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question037.java) | 中等 |
| [剑指 Offer II 038](https://leetcode-cn.com/problems/iIQa4I/) | [每日温度](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question038.java) | 中等 |
| [剑指 Offer II 039](https://leetcode-cn.com/problems/0ynMMM/) | [直方图最大矩形面积](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question039.java) | 困难 |
| [剑指 Offer II 040](https://leetcode-cn.com/problems/PLYXKQ/) | [矩阵中最大的矩形](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question040.java) | 困难 |
| [剑指 Offer II 041](https://leetcode-cn.com/problems/qIsx9U/) | [滑动窗口的平均值](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question041.java) | 简单 |
| [剑指 Offer II 042](https://leetcode-cn.com/problems/H8086Q/) | [最近请求次数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question042.java) | 简单 |
| [剑指 Offer II 043](https://leetcode-cn.com/problems/NaqhDT/) | [往完全二叉树添加节点](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question043.java) | 中等 |
| [剑指 Offer II 044](https://leetcode-cn.com/problems/hPov7L/) | [二叉树每层的最大值](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question044.java) | 中等 |
| [剑指 Offer II 045](https://leetcode-cn.com/problems/LwUNpT/) | [二叉树最底层最左边的值](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question045.java) | 中等 |
| [剑指 Offer II 046](https://leetcode-cn.com/problems/WNC0Lk/) | [二叉树的右侧视图](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question046.java) | 中等 |
| [剑指 Offer II 047](https://leetcode-cn.com/problems/pOCWxh/) | [二叉树剪枝](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question047.java) | 中等 |
| [剑指 Offer II 048](https://leetcode-cn.com/problems/h54YBf/) | [序列化与反序列化二叉树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question048.java) | 困难 |
| [剑指 Offer II 049](https://leetcode-cn.com/problems/3Etpl5/) | [从根节点到叶节点的路径数字之和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question049.java) | 中等 |
| [剑指 Offer II 050](https://leetcode-cn.com/problems/6eUYwP/) | [向下的路径节点之和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question050.java) | 中等 |
| [剑指 Offer II 051](https://leetcode-cn.com/problems/jC7MId/) | [节点之和最大的路径](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question051.java) | 困难 |
| [剑指 Offer II 052](https://leetcode-cn.com/problems/NYBBNL/) | [展平二叉搜索树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question052.java) | 简单 |
| [剑指 Offer II 053](https://leetcode-cn.com/problems/P5rCT8/) | [二叉搜索树中的中序后继](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question053.java) | 中等 |
| [剑指 Offer II 054](https://leetcode-cn.com/problems/w6cpku/) | [所有大于等于节点的值之和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question054.java) | 中等 |
| [剑指 Offer II 055](https://leetcode-cn.com/problems/kTOapQ/) | [二叉搜索树迭代器](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question055.java) | 中等 |
| [剑指 Offer II 056](https://leetcode-cn.com/problems/opLdQZ/) | [二叉搜索树中两个节点之和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question055.java) | 简单 |
| [剑指 Offer II 057](https://leetcode-cn.com/problems/7WqeDu/) | [值和下标之差都在给定的范围内](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question057.java) | 中等 |
| [剑指 Offer II 058](https://leetcode-cn.com/problems/fi9suh/) | [日程表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question058.java) | 中等 |
| [剑指 Offer II 059](https://leetcode-cn.com/problems/jBjn9C/) | [数据流的第 K 大数值](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question059.java) | 简单 |
| [剑指 Offer II 060](https://leetcode-cn.com/problems/g5c51o/) | [出现频率最高的 k 个数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question060.java) | 中等 |
| [剑指 Offer II 061](https://leetcode-cn.com/problems/qn8gGX/) | [和最小的 k 个数对](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question061.java) | 中等 |
| [剑指 Offer II 062](https://leetcode-cn.com/problems/QC3q1f/) | [实现前缀树](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question062.java) | 简单 |
| [剑指 Offer II 063](https://leetcode-cn.com/problems/UhWRSj/) | [替换单词](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question063.java) | 中等 |
| [剑指 Offer II 064](https://leetcode-cn.com/problems/US1pGT/) | [神奇的字典](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question064.java) | 中等 |
| [剑指 Offer II 065](https://leetcode-cn.com/problems/iSwD2y/) | [最短的单词编码](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question065.java) | 中等 |
| [剑指 Offer II 066](https://leetcode-cn.com/problems/z1R5dt/) | [单词之和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question066.java) | 中等 |
| [剑指 Offer II 067](https://leetcode-cn.com/problems/ms70jA/) | [最大的异或](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question066.java) | 中等 |
| [剑指 Offer II 068](https://leetcode-cn.com/problems/N6YdxV/) | [查找插入位置](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question068.java) | 简单 |
| [剑指 Offer II 069](https://leetcode-cn.com/problems/B1IidL/) | [山峰数组的顶部](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question069.java) | 简单 |
| [剑指 Offer II 070](https://leetcode-cn.com/problems/skFtm2/) | [排序数组中只出现一次的数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question070.java) | 中等 |
| [剑指 Offer II 071](https://leetcode-cn.com/problems/cuyjEf/) | [按权重生成随机数](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question071.java) | 中等 |
| [剑指 Offer II 072](https://leetcode-cn.com/problems/jJ0w9p/) | [求平方根](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question072.java) | 中等 |
| [剑指 Offer II 073](https://leetcode-cn.com/problems/nZZqjQ/) | [狒狒吃香蕉](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question073.java) | 中等 |
| [剑指 Offer II 074](https://leetcode-cn.com/problems/SsGoHC/) | [合并区间](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question074.java) | 中等 |
| [剑指 Offer II 075](https://leetcode-cn.com/problems/0H97ZC/) | [数组相对排序](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question075.java) | 简单 |
| [剑指 Offer II 076](https://leetcode-cn.com/problems/xx4gT2/) | [数组中的第 k 大的数字](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question076.java) | 中等 |
| [剑指 Offer II 077](https://leetcode-cn.com/problems/7WHec2/) | [链表排序](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question077.java) | 中等 |
| [剑指 Offer II 078](https://leetcode-cn.com/problems/vvXgSW/) | [合并排序链表](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question078.java) | 中等 |
| [剑指 Offer II 079](https://leetcode-cn.com/problems/TVdhkn/) | [所有子集](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question079.java) | 中等 |
| [剑指 Offer II 080](https://leetcode-cn.com/problems/uUsW3B/) | [含有 k 个元素的组合](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question080.java) | 中等 |
| [剑指 Offer II 081](https://leetcode-cn.com/problems/Ygoe9J/) | [允许重复选择元素的组合](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question081.java) | 中等 |
| [剑指 Offer II 082](https://leetcode-cn.com/problems/4sjJUc/) | [含有重复元素集合的组合](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question082.java) | 中等 |
| [剑指 Offer II 083](https://leetcode-cn.com/problems/VvJkup/) | [没有重复元素集合的全排列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question083.java) | 中等 |
| [剑指 Offer II 084](https://leetcode-cn.com/problems/7p8L0Z/) | [含有重复元素集合的全排列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question084.java) | 中等 |
| [剑指 Offer II 085](https://leetcode-cn.com/problems/IDBivT/) | [生成匹配的括号](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question085.java) | 中等 |
| [剑指 Offer II 086](https://leetcode-cn.com/problems/M99OJA/) | [分割回文子字符串](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question086.java) | 中等 |
| [剑指 Offer II 087](https://leetcode-cn.com/problems/0on3uN/) | [复原 IP](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question087.java) | 中等 |
| [剑指 Offer II 088](https://leetcode-cn.com/problems/GzCJIP/) | [爬楼梯的最少成本](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question088.java) | 简单 |
| [剑指 Offer II 089](https://leetcode-cn.com/problems/Gu0c2T/) | [房屋偷盗](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question089.java) | 中等 |
| [剑指 Offer II 090](https://leetcode-cn.com/problems/PzWKhm/) | [环形房屋偷盗](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question090.java) | 中等 |
| [剑指 Offer II 091](https://leetcode-cn.com/problems/JEj789/) | [粉刷房子](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question091.java) | 中等 |
| [剑指 Offer II 092](https://leetcode-cn.com/problems/cyJERH/) | [翻转字符](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question092.java) | 中等 |
| [剑指 Offer II 093](https://leetcode-cn.com/problems/Q91FMA/) | [最长斐波那契数列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question093.java) | 中等 |
| [剑指 Offer II 095](https://leetcode-cn.com/problems/qJnOS7/) | [最长公共子序列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question095.java) | 中等 |
| [剑指 Offer II 096](https://leetcode-cn.com/problems/IY6buf/) | [字符串交织](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question096.java) | 中等 |
| [剑指 Offer II 097](https://leetcode-cn.com/problems/21dk04/) | [子序列的数目](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question097.java) | 困难 |
| [剑指 Offer II 099](https://leetcode-cn.com/problems/0i0mDW/) | [最小路径之和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question099.java) | 中等 |
| [剑指 Offer II 100](https://leetcode-cn.com/problems/IlPe0q/) | [三角形中最小路径之和](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question100.java) | 中等 |
| [剑指 Offer II 103](https://leetcode-cn.com/problems/gaM7Ch/) | [最少的硬币数目](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question103.java) | 中等 |
| [剑指 Offer II 104](https://leetcode-cn.com/problems/D0F0SV/) | [排列的数目](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question104.java) | 中等 |
| [剑指 Offer II 105](https://leetcode-cn.com/problems/ZL6zAn/) | [岛屿的最大面积](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question105.java) | 中等 |
| [剑指 Offer II 119](https://leetcode-cn.com/problems/WhsWhI/) | [最长连续序列](https://github.com/hncboy/LeetCode/blob/master/src/com/hncboy/swordreferstoofferspecial/Question119.java) | 中等 |