KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#dsh #dsh-plugin #typescript #developer-tools #claude-code #ai-agent #codex #deepseek-harness #ai-agents #cli #react #mcp

LeetCode

★ 312 Open GitHub ↗

持之以恒的练习算法，让基础更扎实，让逻辑思维更强，加油

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

掌握数据结构和算法直接的好处就是能写出性能更优的代码。算法是一种解决问题的思路和方法，从长期来看，大脑思考能力是个人最重要的核心竞争力，而算法是为数不多的能够训练大脑思考能力的途径之一。

关于要不要学数据结构和算法以及算法有没有用这种问题不想再多做解释，只能说志同道合者共行，如果你也感兴趣，可以和我一起学习数据结构和算法题。

🍭 学习路线加强巩固数据结构基础知识，通过 leetcode 算法题加深对数据结构的理解。

## 理论基础

| &emsp;&emsp;[数组](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/theoreticalBasis/%E5%B8%B8%E8%A7%81%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/1.%E6%95%B0%E7%BB%84.md)&emsp;&emsp; | &emsp;&emsp;[**链表**](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/theoreticalBasis/%E5%B8%B8%E8%A7%81%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/2.%E9%93%BE%E8%A1%A8.md)&emsp;&emsp;  |  &emsp;&ensp;&ensp;[**栈**](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/theoreticalBasis/%E5%B8%B8%E8%A7%81%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/3.%E6%A0%88.md)&emsp;&ensp;&emsp; | &emsp;&emsp;[**跳表**](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/theoreticalBasis/%E5%B8%B8%E8%A7%81%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/4.%E8%B7%B3%E8%A1%A8.md)&emsp;&emsp; | &emsp;[**散列表**](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/theoreticalBasis/%E5%B8%B8%E8%A7%81%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/5.%E6%95%A3%E5%88%97%E8%A1%A8.md)&emsp;&emsp; | &emsp;&emsp;二叉树&emsp;&emsp; |
| :---: | :---: | :---: | :------: | :---: | :--------: |
| ️⭐⭐⭐ | ⭐⭐⭐ | ⭐ | ️⭐  |  ️⭐⭐  | ️⭐⭐⭐   |

| &emsp;&emsp;贪心&emsp;&emsp;  | &emsp;&emsp;分治&emsp;&emsp;  | &emsp;&emsp;回溯&emsp;&ensp;  | &emsp;动态规划&emsp; | &emsp;&emsp;[**递归**](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/theoreticalBasis/%E9%80%92%E5%BD%92.md)&emsp;&emsp;  | &emsp;复杂度分析&emsp; |
| :---: | :---: | :---: | :------: | :---: | :--------: |
| ️⭐⭐⭐  | ⭐⭐⭐  | ⭐⭐⭐  |  ️⭐⭐⭐    | ️⭐⭐⭐ |⭐⭐⭐|
         
         
## 面试常考算法题

以下列出面试高频出现，以及一些非常经典重要的算法题： 总计：100 &emsp; 已完成：44 &emsp; 未完成：56
  
> 实战题目 - Array

> 实战题目 - Linked List

> 其他实战题目

> 实战题目 - Binary Tree

| &emsp;题号&emsp; | &emsp;难度&emsp; | 题目链接&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;| 答案链接&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;| 是否完成 |
| :--: | :--: | ------------------------------------------------------------ | :----------------------------------------------------------- | :------: |
|  22  | 中等 | [括号生成](https://leetcode-cn.com/problems/generate-parentheses/) |          |    ❎    |
|  94  | 中等 | [二叉树的中序遍历](https://leetcode-cn.com/problems/binary-tree-inorder-traversal/description/) |[binary tree inorder traversal](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_94/BinaryTreeInorderTraversal.java)       |    ✅     |
|  98  | 中等 | [验证二叉搜索树](https://leetcode-cn.com/problems/validate-binary-search-tree) |    [validate binary search tree](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_98/ValidateBinarySearchTree.java)      |    ✅     |
| 104  | 简单 | [二叉树的最大深度](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree) |    [maximum depth of binary tree](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_104/MaximumDepthOfBinaryTree.java)     |    ✅     |
| 105  | 中等 | [从前序与中序遍历序列构造二叉树](https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) |  [construct binary tree](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_105/ConstructBinaryTreeFromPreorderAndInorderTraversal.java)        |    ✅     |
| 111  | 简单 | [二叉树的最小深度](https://leetcode-cn.com/problems/minimum-depth-of-binary-tree) |    [minimum depth of binary tree](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_111/MinimumDepthOfBinaryTree.java)      |    ✅     |
| 144  | 中等 | [二叉树的前序遍历](https://leetcode-cn.com/problems/binary-tree-preorder-traversal/description/ ) | [binary tree preorder traversal](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_144/BinaryTreePreorderTraversal.java)         |    ✅    |
| 226  | 简单 | [翻转二叉树](https://leetcode-cn.com/problems/invert-binary-tree/description/) |   [invert binary tree](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_226/InvertBinaryTree.java)       |    ✅     |
| 230  | 中等 | [二叉搜索树中第K小的元素](https://leetcode-cn.com/problems/kth-smallest-element-in-a-bst/comments/) |          |    ❎     |
| 236  | 中等 | [二叉树的最近公共祖先](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/) | [lowest common ancestor](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_236/LowestCommonAncestorOfABinaryTree.java)         |    ✅     |
| 297  | 困难 | [二叉树的序列化与反序列化](https://leetcode-cn.com/problems/serialize-and-deserialize-binary-tree/) |          |    ❎     |
| 429  | 简单 | [N叉树的层序遍历](https://leetcode-cn.com/problems/n-ary-tree-level-order-traversal/description/) | [n ary tree level order traversal](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_429/NAryTreeLevelOrderTraversal.java)         |    ✅     |
| 589  | 简单 | [N叉树的前序遍历](https://leetcode-cn.com/problems/n-ary-tree-preorder-traversal/description) |          |    ❎     |
| 590  | 简单 | [N叉树的后序遍历](https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal/description/ ) |          |    ❎     |

> 实战题目 - 分治

> 实战题目 - 二分查找

> 实战题目 - 并查集

> 实战题目 - 遍历和搜索

> 实战题目 - 动态规划

| &emsp;题号&emsp; | &emsp;难度&emsp; | 题目链接&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;| 答案链接&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp; | 是否完成 |
| :--: | :--: | ------------------------------------------------------------ | :----------------------------------------------------------- | :------: |
|  32  | 中等 | [最长有效括号](https://leetcode-cn.com/problems/longest-valid-parentheses/) |          |    ❎     |
|  45  | 困难 | [跳跃游戏 II ](https://leetcode-cn.com/problems/jump-game-ii/) |          |    ❎     |
|  55  | 困难 | [跳跃游戏 ](https://leetcode-cn.com/problems/jump-game/)     |          |    ❎     |
|  62  | 中等 | [不同路径  ](https://leetcode-cn.com/problems/unique-paths/) |     [unique paths](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_62/UniquePaths.java)     |    ✅     |
|  63  | 中等 | [不同路径 II ](https://leetcode-cn.com/problems/unique-paths-ii/) |    [unique paths II](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_63/UniquePathsII.java)      |    ✅     |
|  64  | 中等 | [最小路径和  ](https://leetcode-cn.com/problems/minimum-path-sum/) |          |    ❎     |
|  72  | 困难 | [编辑距离 ](https://leetcode-cn.com/problems/edit-distance/) |          |    ❎     |
|  76  | 困难 | [最小覆盖子串](https://leetcode-cn.com/problems/minimum-window-substring/) |          |    ❎     |
|  91  | 中等 | [解码方法](https://leetcode-cn.com/problems/decode-ways)     |          |    ❎     |
| 120  | 中等 | [三角形最小路径和](https://leetcode-cn.com/problems/triangle/description/) |          |    ❎     |
| 121  | 简单 | [买卖股票的最佳时机](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/#/description) |  [best time to buy and shell stock](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_121/BestTimeToBuyAndSellStock.java)        |    ✅     |
| 122  | 简单 | [买卖股票的最佳时机 II](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/) |   [best time to buy and shell stock ii](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_122/BestTimeToBuyAndSellStockII.java)       |     ✅     |
| 123  | 困难 | [买卖股票的最佳时机 III](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii/) |          |    ❎     |
| 152  | 中等 | [乘积最大子序列](https://leetcode-cn.com/problems/maximum-product-subarray/description/) |          |    ❎     |
| 188  | 困难 | [买卖股票的最佳时机 IV](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv/) |          |    ❎     |
| 198  | 简单 | [打家劫舍](https://leetcode-cn.com/problems/house-robber/)   |    [house robber](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_198/HouseRobber.java)      |    ✅     |
| 213  | 中等 | [打家劫舍 II](https://leetcode-cn.com/problems/house-robber-ii/description/) |     [house robber ii](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/highFrequencyLeetcode/leetcode_213/HouseRobberII.java)     |    ✅     |
| 221  | 中等 | [最大正方形](https://leetcode-cn.com/problems/maximal-square/) |          |    ❎     |
| 279  | 中等 | [完全平方数](https://leetcode-cn.com/problems/perfect-squares/) |          |    ❎     |
| 322  | 中等 | [零钱兑换](https://leetcode-cn.com/problems/coin-change/description/) |          |    ❎     |
| 518  | 中等 | [零钱兑换 II](https://leetcode-cn.com/problems/coin-change-2/) |          |    ❎     |
| 309  | 中等 | [最佳买卖股票时机含冷冻期](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/) |          |    ❎     |
| 312  | 困难 | [戳气球](https://leetcode-cn.com/problems/burst-balloons/)   |          |    ❎     |
| 363  | 困难 | [矩形区域不超过 K 的最大数值和](https://leetcode-cn.com/problems/max-sum-of-rectangle-no-larger-than-k/) |          |    ❎     |
| 403  | 困难 | [青蛙过河](https://leetcode-cn.com/problems/frog-jump/)      |          |    ❎     |
| 410  | 困难 | [分割数组的最大值](https://leetcode-cn.com/problems/split-array-largest-sum) |          |    ❎     |
| 552  | 困难 | [学生出勤记录 II](https://leetcode-cn.com/problems/student-attendance-record-ii/) |          |    ❎     |
| 621  | 中等 | [任务调度器](https://leetcode-cn.com/problems/task-scheduler/) |          |    ❎     |
| 647  | 中等 | [回文子串](https://leetcode-cn.com/problems/palindromic-substrings/) |          |    ❎     |
| 714  | 中等 | [买卖股票的最佳时机含手续费](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/) |          |    ❎     |
| 980  | 困难 | [不同路径 III ](https://leetcode-cn.com/problems/unique-paths-iii/) |          |    ❎     |

> 实战题目 - 剪枝

> 实战题目 - 贪心

> 实战题目 - trie 树

> 实战题目 - 位运算

> 实战题目 - LRU Catch

## 你可能感兴趣的经典话题

🎒[01背包问题](https://github.com/gaoshengnan/LeetCode/blob/master/src/main/java/theoreticalBasis/%E8%83%8C%E5%8C%85/backpack.md)

当被问到背包的时候，你第一个想到的是什么？点击查看回溯 + 动态规划两种方式解决背包问题

LeetCode

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README