https://github.com/anfany/leetcode_python3_solution

基于Python3的LeetCode解题方案
https://github.com/anfany/leetcode_python3_solution

leetcode leetcode-python leetcode-solutions python3

Last synced: 5 days ago
JSON representation

基于Python3的LeetCode解题方案

• Host: GitHub
• URL: https://github.com/anfany/leetcode_python3_solution
• Owner: Anfany
• License: mit
• Created: 2019-04-18T05:58:23.000Z (about 6 years ago)
• Default Branch: master
• Last Pushed: 2019-07-12T02:19:27.000Z (almost 6 years ago)
• Last Synced: 2025-04-09T22:17:01.260Z (2 months ago)
• Topics: leetcode, leetcode-python, leetcode-solutions, python3
• Language: Python
• Size: 830 KB
• Stars: 5
• Watchers: 0
• Forks: 4
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# LeetCode_Python3_Solution

基于Python3的LeetCode解题方案，题目网址：https://leetcode-cn.com/

| 题号 | 题名 |难度| 标签 |

| :------:| :------| :------: | :------|

| **1**|  [**两数之和**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E7%BB%84/1%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/1easy.png)| [**数组**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E7%BB%84)，哈希表|

| **2**|  [**两数相加**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E9%93%BE%E8%A1%A8/2%20%E4%B8%A4%E6%95%B0%E7%9B%B8%E5%8A%A0.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**链表**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E9%93%BE%E8%A1%A8)，数学|

| **3**|  [**无重复字符的最长子串**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E5%93%88%E5%B8%8C%E8%A1%A8/3%20%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**哈希表**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E5%93%88%E5%B8%8C%E8%A1%A8)，双指针，字符串，Sliding Window|

| **4**|  [**寻找两个有序数组的中位数**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E7%BB%84/4%20%E5%AF%BB%E6%89%BE%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/3hard.png)| [**数组**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E7%BB%84)，二分查找，分治算法|

| **5** | [**最长回文子串**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E5%AD%97%E7%AC%A6%E4%B8%B2/5%20%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E4%B8%B2.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**字符串**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E5%AD%97%E7%AC%A6%E4%B8%B2)，动态规划|

| **6** | [**Z字形变换**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E5%AD%97%E7%AC%A6%E4%B8%B2/6%20Z%E5%AD%97%E5%BD%A2%E5%8F%98%E6%8D%A2.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**字符串**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E5%AD%97%E7%AC%A6%E4%B8%B2)|

| **7**|  [**整数反转**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E5%AD%A6/7%20%E6%95%B4%E6%95%B0%E5%8F%8D%E8%BD%AC.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/1easy.png)| [**数学**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E5%AD%A6)|

| **8**|  [**字符串转换整数(atoi)**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E5%AD%A6/8%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%BD%AC%E6%95%B4%E6%95%B0(atoi).md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**数学**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E5%AD%A6)，字符串|

| **9**|  [**回文数**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E5%AD%A6/9%20%E5%9B%9E%E6%96%87%E6%95%B0.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/1easy.png)| [**数学**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E5%AD%A6)|

| **10** | [**正则表达式匹配**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E5%AD%97%E7%AC%A6%E4%B8%B2/10%20%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E5%8C%B9%E9%85%8D.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/3hard.png)| [**字符串**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E5%AD%97%E7%AC%A6%E4%B8%B2)，动态规划，回溯算法|

| **11** |  [**盛最多水的容器**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E7%BB%84/11%20%E7%9B%9B%E6%9C%80%E5%A4%9A%E6%B0%B4%E7%9A%84%E5%AE%B9%E5%99%A8.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**数组**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E7%BB%84)，双指针|

| **12**|  [**整数转罗马数字**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E5%AD%A6/12%20%E6%95%B4%E6%95%B0%E8%BD%AC%E7%BD%97%E9%A9%AC%E6%95%B0%E5%AD%97.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**数学**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E5%AD%A6)，字符串|

| **13**|  [**罗马数字转整数**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E5%AD%A6/13%20%E7%BD%97%E9%A9%AC%E6%95%B0%E5%AD%97%E8%BD%AC%E6%95%B4%E6%95%B0.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/1easy.png)| [**数学**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E5%AD%A6)，字符串|

| **14** | [**最长公共前缀**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E5%AD%97%E7%AC%A6%E4%B8%B2/14%20%E6%9C%80%E9%95%BF%E5%85%AC%E5%85%B1%E5%89%8D%E7%BC%80.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/1easy.png)| [**字符串**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E5%AD%97%E7%AC%A6%E4%B8%B2)|

| **15**|  [**三数之和**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E7%BB%84/15%20%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**数组**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E7%BB%84)，双指针|

| **16**|  [**最接近的三数之和**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E7%BB%84/16%20%E6%9C%80%E6%8E%A5%E8%BF%91%E7%9A%84%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**数组**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E7%BB%84)，双指针|

| **17** | [**电话号码的字母组合**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E5%AD%97%E7%AC%A6%E4%B8%B2/17%20%E7%94%B5%E8%AF%9D%E5%8F%B7%E7%A0%81%E7%9A%84%E5%AD%97%E6%AF%8D%E7%BB%84%E5%90%88.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**字符串**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E5%AD%97%E7%AC%A6%E4%B8%B2)，回溯算法|

| **18**|  [**四数之和**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E7%BB%84/18%20%E5%9B%9B%E6%95%B0%E4%B9%8B%E5%92%8C.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**数组**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E7%BB%84)，哈希表，双指针|

| **19**|  [**删除链表的倒数第N个节点**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E9%93%BE%E8%A1%A8/19%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E5%80%92%E6%95%B0%E7%AC%ACN%E4%B8%AA%E8%8A%82%E7%82%B9.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**链表**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E9%93%BE%E8%A1%A8)，双指针|

| **20**|  [**有效的括号**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%A0%88/20%20%E6%9C%89%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/1easy.png)| [**栈**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%A0%88)，字符串|

| **23** |  **合并K个排序链表**| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/3hard.png)| [**堆**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E5%A0%86)，链表，分治算法|

| **28** | [**实现strStr()**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E5%8F%8C%E6%8C%87%E9%92%88/28%20%E5%AE%9E%E7%8E%B0strStr().md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/1easy.png)| [**双指针**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E5%8F%8C%E6%8C%87%E9%92%88)，字符串|

| **38** | [**报数**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E5%AD%97%E7%AC%A6%E4%B8%B2/38%20%E6%8A%A5%E6%95%B0.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/1easy.png)| [**字符串**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E5%AD%97%E7%AC%A6%E4%B8%B2)|

| **41** |  [**缺失的第一个正数**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E7%BB%84/41%20%E7%BC%BA%E5%A4%B1%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E6%AD%A3%E6%95%B0.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/3hard.png)| [**数组**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E7%BB%84)|

| **42** |  [**接雨水**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%A0%88/42%20%E6%8E%A5%E9%9B%A8%E6%B0%B4.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/3hard.png)| [**栈**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%A0%88)，数组，双指针|

| **54** |  [**螺旋矩阵**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E7%BB%84/54%20%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**数组**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E7%BB%84)|

| **59** |  [**螺旋矩阵II**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E7%BB%84/59%20%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5II.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**数组**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E7%BB%84)|

| **62** |  [**不同路径**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E7%BB%84/62%20%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**数组**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E7%BB%84)，动态规划|

| **63** |  [**不同路径II**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E7%BB%84/63%20%E4%B8%8D%E5%90%8C%E8%B7%AF%E5%BE%84II.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**数组**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E7%BB%84)，动态规划|

| **64** |  [**最小路径和**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E7%BB%84/64%20%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E5%92%8C.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**数组**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E7%BB%84)，动态规划|

| **67** |  [**二进制求和**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E5%AD%A6/67%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E6%B1%82%E5%92%8C.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/1easy.png)| [**数学**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E5%AD%A6)，字符串|

| **69** |  [**X的平方根**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E5%AD%A6/69%20X%E7%9A%84%E5%B9%B3%E6%96%B9%E6%A0%B9.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/1easy.png)| [**数学**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E5%AD%A6)，二分查找|

| **70** |  [**爬楼梯**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/70%20%E7%88%AC%E6%A5%BC%E6%A2%AF.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/1easy.png)| [**动态规划**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92)|

| **118** |  [**杨辉三角I**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E7%BB%84/118%20%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92I.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/1easy.png)| [**数组**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E7%BB%84)|

| **119** |  [**杨辉三角II**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E7%BB%84/119%20%E6%9D%A8%E8%BE%89%E4%B8%89%E8%A7%92II.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/1easy.png)| [**数组**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E7%BB%84)|

| **120** |  [**三角形最小路径和**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E7%BB%84/120%20%E4%B8%89%E8%A7%92%E5%BD%A2%E6%9C%80%E5%B0%8F%E8%B7%AF%E5%BE%84%E5%92%8C.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**数组**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E7%BB%84)，动态规划|

| **121** |  [**买卖股票的最佳时机**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E7%BB%84/121%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BA.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/1easy.png)| [**数组**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E7%BB%84)，动态规划|

| **122** |  [**买卖股票的最佳时机II**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E8%B4%AA%E5%BF%83%E7%AE%97%E6%B3%95/122%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BAII.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/1easy.png)| [**贪心算法**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E8%B4%AA%E5%BF%83%E7%AE%97%E6%B3%95)，数组|

| **123** |  [**买卖股票的最佳时机III**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E7%BB%84/123%20%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BAIII.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/3hard.png)| [**数组**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E7%BB%84)，动态规划|

| **200** |  [**岛屿的个数**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2/200%20%E5%B2%9B%E5%B1%BF%E7%9A%84%E4%B8%AA%E6%95%B0.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**深度优先搜索**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2)，广度优先搜索，数组|

| **292** |  [**Nim游戏**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E8%84%91%E7%AD%8B%E6%80%A5%E8%BD%AC%E5%BC%AF/292%20Nim%E6%B8%B8%E6%88%8F.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/1easy.png)| [**脑筋急转弯**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E8%84%91%E7%AD%8B%E6%80%A5%E8%BD%AC%E5%BC%AF)，极小化极大|

| **319** |  [**灯泡开关**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E8%84%91%E7%AD%8B%E6%80%A5%E8%BD%AC%E5%BC%AF/319%20%E7%81%AF%E6%B3%A1%E5%BC%80%E5%85%B3.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**脑筋急转弯**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E8%84%91%E7%AD%8B%E6%80%A5%E8%BD%AC%E5%BC%AF)，数学|

| **587** |  [**安装栅栏**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E5%87%A0%E4%BD%95/587%20%E5%AE%89%E8%A3%85%E6%A0%85%E6%A0%8F.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/3hard.png)| [**几何**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E5%87%A0%E4%BD%95)|

| **695** |  [**岛屿的最大面积**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2/695%20%E5%B2%9B%E5%B1%BF%E7%9A%84%E6%9C%80%E5%A4%A7%E9%9D%A2%E7%A7%AF.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**深度优先搜索**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88%E6%90%9C%E7%B4%A2)，数组|

| **771**|  [**宝石与石头**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E5%93%88%E5%B8%8C%E8%A1%A8/771%20%E5%AE%9D%E7%9F%B3%E4%B8%8E%E7%9F%B3%E5%A4%B4.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/1easy.png)| [**哈希表**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E5%93%88%E5%B8%8C%E8%A1%A8)|

| **885** |  [**螺旋矩阵III**](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/%E6%95%B0%E5%AD%A6/885%20%E8%9E%BA%E6%97%8B%E7%9F%A9%E9%98%B5III.md)| ![image](https://github.com/Anfany/LeetCode_Python3_Solution/blob/master/2middle.png)| [**数学**](https://github.com/Anfany/LeetCode_Python3_Solution/tree/master/%E6%95%B0%E5%AD%A6)|

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

扫描下方二维码，关注获取更多。

![image](https://github.com/Anfany/Machine-Learning-for-Beginner-by-Python3/blob/master/pythonfan_anfany.jpg)