LeetCode解题目录

深碍√TFBOYSˉ_ 2022-10-13 12:57 70阅读 0赞

> 本目录用来收录一些经典的、常考的数据结构与算法题，每一题都有相应的解析，可供学习和参考。![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dqaW5qaWU_size_16_color_FFFFFF_t_70]

### 文章目录 ###

*   *  一、数据结构
     *   *  1、字符串
         *  2、数组
         *  3、链表
         *  4、二叉树
         *  5、栈
         *  6、队列
     *  二、算法
     *   *  1、贪心算法

--------------------

## 一、数据结构 ##

### 1、字符串 ###

<table> 
 <thead> 
  <tr> 
   <th>已解题目</th> 
   <th>难度</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/105405016" rel="nofollow">把数组排成最小的数</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/118579348" rel="nofollow">有效的括号</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/118603497" rel="nofollow">实现strStr()：查找子串位置</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://leetcode-cn.com/problems/length-of-last-word/solution/dao-xu-sou-suo-ji-bai-100-by-aijun-lawx/" rel="nofollow">最后一个单词的长度</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://leetcode-cn.com/problems/add-binary/solution/dai-jin-wei-xiang-jia-xiang-xi-ti-jie-bu-ngi8/" rel="nofollow">二进制求和</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://leetcode-cn.com/problems/valid-palindrome/solution/cjian-dan-jie-fa-by-aijun-8da4/" rel="nofollow">验证回文串</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://leetcode-cn.com/problems/group-anagrams/solution/ha-xi-biao-yi-zhao-gao-ding-by-aijun-weaz/" rel="nofollow">字母异位词分组</a></td> 
   <td>中等</td> 
  </tr> 
 </tbody> 
</table>

### 2、数组 ###

<table> 
 <thead> 
  <tr> 
   <th>已解题目</th> 
   <th>难度</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/105405016" rel="nofollow">把数组排成最小的数</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/114761309" rel="nofollow">买卖股票的最佳时机</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/114784124" rel="nofollow">旋转数组</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/114882012" rel="nofollow">加一</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/114634447" rel="nofollow">两个数组的交集</a></td> 
   <td>中等</td> 
  </tr> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/114663683" rel="nofollow">最长公共前缀</a></td> 
   <td>中等</td> 
  </tr> 
 </tbody> 
</table>

### 3、链表 ###

<table> 
 <thead> 
  <tr> 
   <th>已解题目</th> 
   <th>难度</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/108171197" rel="nofollow">返回倒数第K个节点</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/108173446" rel="nofollow">合并两个有序链表</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/114953273" rel="nofollow">回文链表</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/117793656" rel="nofollow">相交链表</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/118465374" rel="nofollow">删除链表的节点（ leetcode18）</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/118461039" rel="nofollow">删除链表中的重复元素</a></td> 
   <td>简单</td> 
  </tr> 
 </tbody> 
</table>

### 4、二叉树 ###

<table> 
 <thead> 
  <tr> 
   <th>已解题目</th> 
   <th>难度</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td><a href="https://blog.csdn.net/wjinjie/article/details/116429112" rel="nofollow">前序遍历</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/wjinjie/article/details/116429112" rel="nofollow">中序遍历</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/wjinjie/article/details/116429112" rel="nofollow">后序遍历</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/wjinjie/article/details/116429112" rel="nofollow">层序遍历</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/wjinjie/article/details/116136998" rel="nofollow">递增顺序搜索树</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/wjinjie/article/details/116136998" rel="nofollow">二叉搜索树范围和</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/wjinjie/article/details/116136998" rel="nofollow">二叉搜索树的第k大节点</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/wjinjie/article/details/116136998" rel="nofollow">二叉树的深度</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/wjinjie/article/details/116136998" rel="nofollow">员工的重要性</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/wjinjie/article/details/116136998" rel="nofollow">平衡二叉树</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/wjinjie/article/details/116136998" rel="nofollow">对称二叉树</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://blog.csdn.net/wjinjie/article/details/116136998" rel="nofollow">二叉树的镜像</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/118560127" rel="nofollow">二叉搜索树中的众数</a></td> 
   <td>简单</td> 
  </tr> 
 </tbody> 
</table>

### 5、栈 ###

<table> 
 <thead> 
  <tr> 
   <th>已解题目</th> 
   <th>难度</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/114683244" rel="nofollow">基本计算器</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/118550910" rel="nofollow">最小栈</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/118557448" rel="nofollow">用队列实现栈</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/118574266" rel="nofollow">栈的最小值</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/118579348" rel="nofollow">有效的括号</a></td> 
   <td>简单</td> 
  </tr> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/118572261" rel="nofollow">用两个栈来实现队列</a></td> 
   <td>中等</td> 
  </tr> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/118566089" rel="nofollow">无法吃午餐的学生数量</a></td> 
   <td>中等</td> 
  </tr> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/118575904" rel="nofollow">化栈为队（实现push、pop、peak、empty等操作）</a></td> 
   <td>中等</td> 
  </tr> 
 </tbody> 
</table>

### 6、队列 ###

<table> 
 <thead> 
  <tr> 
   <th>已解题目</th> 
   <th>难度</th> 
  </tr> 
 </thead> 
 <tbody> 
  <tr> 
   <td><a href="https://ai-wx.blog.csdn.net/article/details/114579891" rel="nofollow">滑动窗口最大值</a></td> 
   <td>简单</td> 
  </tr> 
 </tbody> 
</table>

## 二、算法 ##

### 1、贪心算法 ###

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dqaW5qaWU_size_16_color_FFFFFF_t_70]: /images/20221005/f6241c77ce6542a0929d0ac4adf2b817.png