手把手带你刷Leetcode力扣学习总结

喜欢ヅ旅行 2022-10-13 01:51 136阅读 0赞

### 文章目录 ###

*  1. 总体规划
 *  2. 算法复杂度
 *   *  2.1 时间复杂度
     *  2.2 空间复杂度
 *  3. 数据结构
 *   *  3.1 数组【Array】
     *   *  3.1.1 Python常用操作
         *  3.1.2 Java常用操作
         *  3.1.3 练习题
         *   *  485 最大连续1的个数
             *  283 移动零
             *  27 移除元素
     *  3.2 链表【Linked List】
     *   *  3.2.1 Python常用操作
         *  3.2.2 Java常用操作
         *  3.2.3 练习题
         *   *  203 移除链表元素
             *  206 反转链表
     *  3.3 队列【Queue】
     *   *  3.3.1 Python常用操作
         *  3.3.2 Java常用操作
         *  3.3.3 练习题
         *   *  933 最近的请求次数
     *  3.4 栈【Stack】
     *   *  3.4.1 Python常用操作
         *  3.4.2 Java常用操作
         *  3.4.3 练习题
         *   *  20 有效的括号
             *  496 下一个更大元素（栈+队列）
     *  3.5 哈希表【Hash Table】
     *   *  3.5.1 Python常用操作
         *  3.5.2 Java常用操作
         *  3.5.3 练习题
         *   *  217 存在重复元素
             *  389 找不同
             *  496 下一个更大元素
     *  3.6 集合【Set】
     *   *  3.6.1 Python常用操作
         *  3.6.2 Java常用操作
         *  3.6.3 练习题
         *   *  217 存在重复元素
             *  705 设计哈希集合
     *  3.7 树【Tree】
     *  3.8 堆【Heap】
     *   *  3.8.1 Python常用操作
         *  3.8.2 Java常用操作
         *  3.8.3 练习题
         *   *  215 数组中第k个最大元素
             *  692 前k个高频单词
     *  3.9 图【Graph】
     *  3.10 数据结构知识点回顾
 *  4. 算法
 *   *  4.1 双指针
     *   *  4.1.1 算法
         *  4.1.2 练习题
         *   *  141 环形链表
             *  881 救生艇
     *  4.2 二分查找
     *   *  4.2.1 算法
         *  4.2.2 练习题
         *   *  704 二分查找
             *  35 搜索插入位置
             *  162 寻找峰值
             *  74 搜索二维矩阵
     *  4.3 滑动窗口（技巧）
     *   *  4.3.1 算法
         *  4.3.2 练习题
         *   *  209 长度最小的子数组
             *  1456 定长子串中元音的最大数组
     *  4.4 递归 recursion
     *   *  4.4.1 算法
         *  4.4.2 练习题
         *   *  509 斐波那契数列
             *  206 反转链表
             *  344 反转字符串
     *  4.5 分治法（divide & conquer）
     *   *  4.5.1 算法
         *  4.5.2 练习题
         *   *  169 多数元素
             *  53 最大子序列
     *  4.6 回溯法（Backtracking）
     *   *  4.6.1 算法
         *  4.6.2 练习题
         *   *  22 括号生成
             *  78 子集
             *  77 组合
             *  46 全排列
             *  八皇后 数独
     *  4.7 深度优先搜索（DFS）
     *   *  4.7.1 算法
         *  4.7.2 练习题
         *   *  200 岛屿数量
     *  4.8 广度优先搜索（BFS）
     *   *  4.8.1 算法
         *  4.8.2 练习题
         *   *  938 二叉搜索树的范围和
     *  4.9 动态规划
     *   *  4.9.1 算法
         *  4.9.2 练习题
     *  4.10 前缀树（Trie）
     *   *  4.10.1 算法
         *  4.10.2 练习题
     *  4.11 并查集
     *  4.12 并查集优化
     *  4.13 贪心算法

UP讲的很好，推荐大家去看。

# 1. 总体规划 #

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70]

# 2. 算法复杂度 #

## 2.1 时间复杂度 ##

1.  什么是时间复杂度？  
    算法的执行效率  
    算法的执行时间与算法的输入值之间的关系
2.  常见时间复杂度案例分析  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 1]  
    O(1):与num无关  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 2]  
    O(n)  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 3]  
    O(log n):2的n次方等于num。典型：二分查找  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 4]  
    O(m+n)：循环并列，相加  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 5]  
    O(nlogn):循环嵌套，相乘。典型：排序  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 6]  
    O( n 2 n^2 n2)
3.  常见时间复杂度对比  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 7]

## 2.2 空间复杂度 ##

1.  什么是空间复杂度？  
    算法的存储空间与算法的输入值之间的关系  
    占空间的都是声明出来的变量
2.  常见空间复杂度案例分析  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 8]  
    变量是常量：O(1)  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 9]  
    变量是array、list等，递归：O(n)
3.  常见空间复杂度对比  
    ![在这里插入图片描述][20210705200115351.png]  
    时间和空间只能二选一  
    面试时：和面试官讲清楚  
    工作时：时间>空间

# 3. 数据结构 #

## 3.1 数组【Array】 ##

数组：在连续的内存空间中，存储一组相同类型的元素。  
![在这里插入图片描述][2021070520055439.png]  
![在这里插入图片描述][2021070520065561.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 10]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 11]

**特点：** 适合读，不适合写------读多写少

### 3.1.1 Python常用操作 ###

1.  创建数组  
    ![在这里插入图片描述][20210705201609225.png]
2.  添加或插入元素  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 12]  
    中间添加,插入：O(n)  
    尾部添加，添加：O(1)
3.  访问元素  
    ![在这里插入图片描述][20210705201909307.png]
4.  更新元素  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 13]
5.  删除元素  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 14]  
    remove:查找所需要的元素，然后删除，O(n)  
    pop(i):删除i索引的值，但剩余元素需要移位，O(n)  
    pop():删除最后一个，O(1)
6.  获取数组长度  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 15]
7.  遍历数组  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 16]
8.  查找某个元素  
    ![在这里插入图片描述][20210705202529407.png]
9.  数组排序  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 17]  
    a.sort()，会直接改变a  
    sorted(a)，不会改变

### 3.1.2 Java常用操作 ###

### 3.1.3 练习题 ###

#### 485 最大连续1的个数 ####

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 18]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 19]

#### 283 移动零 ####

![在这里插入图片描述][20210705211145889.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 20]

class Solution(object):
        def moveZeroes(self, nums):
            """
            :type nums: List[int]
            :rtype: None Do not return anything, modify nums in-place instead.
            """
            for i in nums:
                if i==0:
                    nums.remove(0)
                    nums.append(0)
                    
            return nums

#### 27 移除元素 ####

![在这里插入图片描述][20210705210756116.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 21]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 22]

class Solution:
        def removeElement(self, nums, val):
            if nums is None or len(nums)==0:
                return 0
            l,r = 0, len(nums)-1
            while l<r:
                while(l<r and nums[l] != val):
                    l=l+1
                while(l<r and nums[r] == val):
                    r=r-1
                nums[l],nums[r] = nums[r],nums[l]
            return l if nums[l]==val else l+1

class Solution:
        def removeElement(self, nums, val):
            for i in range(len(nums)-1,-1,-1):
            if nums[i] == val:
            nums.remove(nums[i])

## 3.2 链表【Linked List】 ##

![在这里插入图片描述][20210705212103926.png]  
单端链表 √  
双端链表 leetcode一般不用  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 23]  
**特点：** 适合写，不适合读------读少写多

### 3.2.1 Python常用操作 ###

1.  创建链表  
    ![在这里插入图片描述][20210705212805164.png]
2.  添加元素  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 24]
3.  访问元素  
    ![在这里插入图片描述][20210705213044242.png]
4.  搜索元素：返回索引  
    ![在这里插入图片描述][20210705213107800.png]
5.  更新元素  
    ![在这里插入图片描述][20210705213159513.png]
6.  删除元素  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 25]
7.  长度  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 26]

### 3.2.2 Java常用操作 ###

### 3.2.3 练习题 ###

#### 203 移除链表元素 ####

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 27]

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 28]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 29]

class Solution:
        def removeElements(self, head: ListNode, val: int) -> ListNode:
            dummy = ListNode(0)
            dummy.next = head
            prev = dummy
    
            while head is not None:
                if head.val == val:
                    prev.next = head.next
                    head = head.next
                else:
                    prev = head
                    head = head.next 
            return dummy.next

#### 206 反转链表 ####

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 30]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 31]

class Solution:
        def reverseList(self, head: ListNode) -> ListNode:
            dummy = ListNode(0)
            dummy.next = head
            while head is not None and head.next is not None:
                dnext = dummy.next
                hnext = head.next
                dummy.next = hnext
                head.next = hnext.next
                hnext.next = dnext
    
            return dummy.next

## 3.3 队列【Queue】 ##

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 32]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 33]  
插入删除只能在头尾，所以时间复杂度：O(1)

### 3.3.1 Python常用操作 ###

1.  创建队列  
    ![在这里插入图片描述][20210705215259740.png]
2.  添加元素  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 34]
3.  获取即将出队的元素  
    ![在这里插入图片描述][2021070521535337.png]
4.  删除即将出队的元素  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 35]
5.  判断队列是否为空  
    ![在这里插入图片描述][20210705215447560.png]
6.  队列长度  
    `len(queue)`
7.  遍历队列  
    ![在这里插入图片描述][20210705215522655.png]

### 3.3.2 Java常用操作 ###

### 3.3.3 练习题 ###

#### 933 最近的请求次数 ####

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 36]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 37]

class RecentCounter:
    
        def __init__(self):
            self.q = deque()
        def ping(self, t: int) -> int:
            self.q.append(t)
            while len(self.q)>0 and t-self.q[0]>3000:
                self.q.popleft()
            return len(self.q)

## 3.4 栈【Stack】 ##

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 38]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 39]

### 3.4.1 Python常用操作 ###

1.  创建栈  
    ![在这里插入图片描述][20210705222308998.png]
2.  添加元素  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 40]
3.  查看栈顶元素-即将出栈的元素  
    ![在这里插入图片描述][20210705222337114.png]
4.  删除栈顶元素  
    ![在这里插入图片描述][20210705222409971.png]
5.  栈的大小  
    ![在这里插入图片描述][20210705222438513.png]
6.  栈是否为空  
    ![在这里插入图片描述][20210705222507736.png]
7.  栈的遍历  
    ![在这里插入图片描述][2021070522253696.png]

### 3.4.2 Java常用操作 ###

### 3.4.3 练习题 ###

#### 20 有效的括号 ####

![在这里插入图片描述][20210706134243943.png]

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 41]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 42]

class Solution:
        def isValid(self, s: str) -> bool:
            if len(s)==0:
                return True
            stack= []
            for c in s:
                if c == "(" or c == "[" or c == "{":
                    stack.append(c)
                else:
                    if len(stack) == 0:
                        return False
                    else:
                        temp = stack.pop()
                        if c == ")":
                            if temp != "(":
                                return False
                        elif c == "]":
                            if temp != "[":
                                return False 
                        elif c == "}":
                            if temp != "{":
                                return False   
    
            return True if len(stack) == 0 else False

#### 496 下一个更大元素（栈+队列） ####

![加粗样式][20210706151147165.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 43]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 44]

class Solution:
    	def nextGreaterElement(self，nums1: List[int]，nums2: List[int]) -> List[int]:
    		res =[]
    		stack = []
    		for num in nums2:
    			stack.append( num)
    		for num in nums1:
    			temp =[]
    			isFound = False
    			nextMax = -1
    			while ( len(stack) != 0 and not isFound ) :
    				top = stack.pop()
    				if top > num:
    					nextMax = top
    				elif top ==num :
    					isFound = True
    				temp.append( top)
    			res.append( nextMax)
    			while len(temp) != 0:
    				stack.append(temp. pop( ))
    		return res

## 3.5 哈希表【Hash Table】 ##

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 45]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 46]  
![在这里插入图片描述][2021070522295233.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 47]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 48]

### 3.5.1 Python常用操作 ###

1.  创建哈希表：数组或字典  
    ![在这里插入图片描述][20210705223739778.png]
2.  添加元素  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 49]
3.  删除元素  
    ![在这里插入图片描述][20210705224037387.png]
4.  修改元素  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 50]
5.  获取key的值  
    ![在这里插入图片描述][20210705224129746.png]
6.  检查key是否存在  
    ![在这里插入图片描述][20210705224155771.png]
7.  哈希表长度
8.  哈希表是否还有元素  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 51]

### 3.5.2 Java常用操作 ###

### 3.5.3 练习题 ###

#### 217 存在重复元素 ####

![在这里插入图片描述][20210707204134872.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 52]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 53]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 54]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 55]

class Solution:
        def containsDuplicate(self, nums: List[int]) -> bool:
            if len(nums) == 0:
                return False
    
            dict = {
        }
            for num in nums:
                if num not in dict:
                    dict[num] = 1
                else:
                    dict[num] = dict[num]+1
    
            for v in dict.values(): 
                if v>1:
                    return True   
            return False

#### 389 找不同 ####

![在这里插入图片描述][20210707204427252.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 56]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 57]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 58]

class Solution:
        def findTheDifference(self, s: str, t: str) -> str:
            if len(s) == 0:
                return t 
            table = [0]*26
            for i in range(len(s)):
                table[ord(s[i])-ord('a')] -= 1
            for j in range(len(t)):
                table[ord(t[j])-ord('a')] += 1
    
            for k in range(26):
                if table[k] == 1:
                    ascii = k+ord('a')
                    return chr(ascii)

#### 496 下一个更大元素 ####

![在这里插入图片描述][20210707204639963.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 59]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 60]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 61]  
![在这里插入图片描述][20210707205037586.png]

class Solution:
        def nextGreaterElement(self, nums1: List[int], nums2: List[int]) -> List[int]:
            stack,hash = [],{
        }
            res = []
            for i in nums2:
                while len(stack) != 0 and i>stack[-1]:
                    temp = stack.pop()
                    hash[temp] = i 
                stack.append(i)
            while len(stack) != 0:
                hash[stack.pop()] = -1
            for num in nums1:
                res.append(hash[num])
            return res

## 3.6 集合【Set】 ##

**无序** **不重复**  
主要作用：  
检查某一个元素是否存在  
重复元素

![在这里插入图片描述][20210705224533624.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 62]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 63]

### 3.6.1 Python常用操作 ###

1.  创建集合  
    ![在这里插入图片描述][20210707205539377.png]
2.  添加元素  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 64]
3.  搜索元素  
    ![在这里插入图片描述][20210707205621159.png]
4.  删除元素  
    ![在这里插入图片描述][2021070720563827.png]
5.  长度  
    ![在这里插入图片描述][20210707205656560.png]

### 3.6.2 Java常用操作 ###

### 3.6.3 练习题 ###

#### 217 存在重复元素 ####

![在这里插入图片描述][20210707205749845.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 65]

class Solution:
        def containsDuplicate(self, nums: List[int]) -> bool:
        
            set1 = set(nums)
            if len(set1) == len(nums):
                return False
            else:
                return True

#### 705 设计哈希集合 ####

![在这里插入图片描述][20210707205852383.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 66]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 67]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 68]

class MyHashSet:
    
        def __init__(self):
            """
            Initialize your data structure here.
            """
            self.hashset = [False]*1000001
    
        def add(self, key: int) -> None:
            self.hashset[key]=True
    
        def remove(self, key: int) -> None:
            self.hashset[key]=False
    
    
        def contains(self, key: int) -> bool:
            """
            Returns true if this set contains the specified element
            """
            return self.hashset[key]

## 3.7 树【Tree】 ##

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 69]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 70]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 71]  
\*\* 满二叉树的所有叶子节点必须在同一层上。\*\*  
满二叉树一定是完全二叉树，完全二叉树不一定是满二叉树。  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 72]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 73]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 74]

## 3.8 堆【Heap】 ##

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 75]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 76]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 77]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 78]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 79]  
一般删除和搜索都是针对堆顶元素。  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 80]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 81]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 82]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 83]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 84]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 85]  
生成完全二叉树和变成最小堆的过程是并列的，都是O(n)，取一个即可。

### 3.8.1 Python常用操作 ###

1.  创建堆（最大堆|最小堆）
2.  添加元素
3.  获取堆顶元素
4.  删除堆顶元素
5.  堆的长度
6.  堆的遍历  
    ![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 86]  
    Python里面没有直接生成最大堆的，要把数字全部取反，形成最小堆后再全部取反。

### 3.8.2 Java常用操作 ###

### 3.8.3 练习题 ###

#### 215 数组中第k个最大元素 ####

![在这里插入图片描述][20210707213853603.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 87]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 88]  
![在这里插入图片描述][20210707214101687.png]  
这是堆的方法

import heapq
    
    class Solution:
        def findKthLargest(self, nums: List[int], k: int) -> int:
            heap = []
            heapq.heapify(heap)
            for num in nums:
                heapq.heappush(heap,num*-1)
            while k>1:
                heapq.heappop(heap)
                k=k-1
            return heapq.heappop(heap)*-1

可以直接调用函数

class Solution:
        def findKthLargest(self, nums: List[int], k: int) -> int:
            nums.sort()
            return nums[len(nums)-k]

#### 692 前k个高频单词 ####

![在这里插入图片描述][20210707215116368.png]  
![在这里插入图片描述][20210707215153813.png]  
![在这里插入图片描述][20210707215211333.png]  
最大堆的思想是把元素全放在堆中，然后从堆顶一个一个取最大元素  
![在这里插入图片描述][20210707215306886.png]  
最小堆的的思想是加生成堆的过程中把堆顶的小元素剔除，堆里只剩所需的k个元素，然后再取出。  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 89]  
只放置k个，加元素的过程中当元素个数大于k时把现有堆的最小值删掉。  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 90]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 91]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 92]

import heapq
    class Solution:
        def topKFrequent(self, words: List[str], k: int) -> List[str]:
            mapping = {
        }
            for word in words:
                if word not in mapping:
                    mapping[word] = 0
                mapping[word] = mapping[word] + 1
            print(mapping)
    
            heap = []
            heapq.heapify(heap)
            for key,value in mapping.items():
                heapq.heappush(heap,Node(key,value))
                if len(heap)>k:
                    heapq.heappop(heap)
    
            res = []
            print(len(heap))
    
            while len(heap)>0:
                temp = heapq.heappop(heap)
                print(temp.key,":",temp.value)
                res.append(temp.key)
    
            res.reverse()
    
            return res

## 3.9 图【Graph】 ##

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 93]  
**度**是一个节点的几条边。  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 94]  
![在这里插入图片描述][20210707222321862.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 95]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 96]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 97]

## 3.10 数据结构知识点回顾 ##

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 98]  
对比数据结构，特点，优缺点，复杂度

# 4. 算法 #

## 4.1 双指针 ##

### 4.1.1 算法 ###

![在这里插入图片描述][20210707223111681.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 99]  
**普通双指针：** O(n^2)  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 100]  
**对撞双指针：** 有序时考虑，O(n)  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 101]  
**快慢双指针：** 环形链表，快慢指针可相遇

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 102]

### 4.1.2 练习题 ###

#### 141 环形链表 ####

![在这里插入图片描述][20210707224441107.png]

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 103]  
![在这里插入图片描述][20210707224518581.png]

class Solution:
        def hasCycle(self, head: ListNode) -> bool:
            if head is None:
                return False
            slow = head
            fast = head
            while fast is not None and fast.next is not None:
                fast = fast.next.next
                slow = slow.next
                if slow == fast:
                    return True
            
            return False

#### 881 救生艇 ####

![在这里插入图片描述][20210707224918272.png]  
对撞指针  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 104]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 105]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 106]

class Solution:
        def numRescueBoats(self, people: List[int], limit: int) -> int:
            if people is None or len(people) == 0:
                return 0
            people.sort()
            i=0
            j=len(people)-1
            res = 0
            while(i<=j):
                if people[i]+people[j]<= limit:
                    i = i+1
                j=j-1
                res = res + 1
            return res

## 4.2 二分查找 ##

### 4.2.1 算法 ###

O(log n)  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 107]

### 4.2.2 练习题 ###

#### 704 二分查找 ####

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 108]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 109]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 110]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 111]  
普通解法：O(n)

class Solution:
        def search(self, nums: List[int], target: int) -> int:
            for i in range(len(nums)):
                if nums[i] == target:
                    return i
            return -1

二分法：O(logn)

class Solution:
        def search(self, nums: List[int], target: int) -> int:
            if nums is None or len(nums) == 0:
                return -1
            L = 0
            R = len(nums) - 1
            while L <= R:
                mid = L + (R - L ) // 2
                if nums[mid] == target:
                    return mid
                elif nums[mid] > target:
                    R = mid-1
                else:
                    L = mid+1
            
            return -1

#### 35 搜索插入位置 ####

![在这里插入图片描述][20210708110035124.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 112]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 113]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 114]  
常规方法：

if nums ==None or len( nums) == 0:
                return 0
            prev = -1
            for i in range( len( nums )):
                if nums[i] == target:
                    return i
                elif nums[i] < target:
                    prev = i
                else:
                    return prev+1
            return prev+1

二分法

class Solution:
        def searchInsert(self, nums: List[int], target: int) -> int:
            if nums ==None or len( nums) == 0:
                return 0
            left = 0
            right = len(nums)
            while( left < right):
                mid = left + ( right - left)//2
                if nums[mid] == target:
                    return mid
                elif nums[mid] > target:
                    right = mid
                else:
                    left = mid + 1
            return left

自己的解法（菜狗的解法）

class Solution:
        def searchInsert(self, nums: List[int], target: int) -> int:
            L = 0
            R = len(nums) - 1
            while L <= R:
                mid = L + (R - L ) // 2
                if nums[mid] == target:
                    return mid
                elif nums[mid] > target :
                    if mid-1 < 0 or nums[mid - 1] < target:
                        return mid
                    else:
                        R = mid-1
                else:
                    if mid+1 == len(nums) or nums[mid + 1] > target:
                        print(mid+1)
                        return mid+1
                    else:
                        L = mid+1

#### 162 寻找峰值 ####

![在这里插入图片描述][20210708213841116.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 115]  
![在这里插入图片描述][20210708220252179.png]

class Solution:
        def findPeakElement(self, nums: List[int]) -> int:
            if nums is None or len(nums) == 0:
                return
            left = 0
            right = len(nums)-1
            while left < right:
                mid = left+(right-left)//2
                if nums[mid] > nums[mid+1]:
                    right = mid
                else:
                    left = mid + 1
            return  left

#### 74 搜索二维矩阵 ####

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 116]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 117]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 118]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 119]

## 4.3 滑动窗口（技巧） ##

目的：减少while循环

### 4.3.1 算法 ###

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 120]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 121]

### 4.3.2 练习题 ###

#### 209 长度最小的子数组 ####

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 122]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 123]

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 124]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 125]

class Solution:
        def minSubArrayLen(self, target: int, nums: List[int]) -> int:
            if nums is None or len(nums) == 0:
                return 0
            res = len(nums)+1
            i=0
            j=0
            total = 0
            while j<len(nums):
                total = total+nums[j]
                j = j+1
                while total >= target:
                    res = min(res,j-i)
                    total = total - nums[i]
                    i = i+1
            if res == len(nums)+1:
                return 0
            else:
                return res

#### 1456 定长子串中元音的最大数组 ####

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 126]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 127]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 128]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 129]  
![在这里插入图片描述][20210710151442444.png]

class Solution:
        def maxVowels(self, s: str, k: int) -> int:
            if s is None or len(s) == 0 or len(s)<k:
                return 0
            hashset = set(['a','e','i','o','u'])
            count = 0
            res = 0
            for i in range(0,k):
                if s[i] in hashset:
                    count = count+1
            res = max(res,count)
            for i in  range(k,len(s)):
                out = s[i-k]
                inc = s[i]
                if out in hashset:
                    count = count - 1
                if inc in hashset:
                    count = count + 1
                res = max(res,count)
            return res

## 4.4 递归 recursion ##

### 4.4.1 算法 ###

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 130]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 131]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 132]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 133]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 134]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 135]  
时间复杂度：O(n^20)  
空间复杂度：O(n)

### 4.4.2 练习题 ###

#### 509 斐波那契数列 ####

![在这里插入图片描述][20210710153733327.png]

class Solution:
        def fib(self, n: int) -> int:
            if n < 2:
                return 1 if n==1 else 0
            sum = self.fib(n-1) + self.fib(n-2)
            return sum

#### 206 反转链表 ####

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 136]

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 137]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 138]

class Solution:
        def reverseList(self, head: ListNode) -> ListNode:
            if head is None or head.next is None:
                return head
            p = self.reverseList(head.next)
            head.next.next = head
            head.next = None
            return p

#### 344 反转字符串 ####

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 139]  
![在这里插入图片描述][20210710160205703.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 140]

class Solution:
        def reverseString(self, s: List[str]) -> None:
            self.recursion(s,0,len(s)-1)
        def recursion(self,s,left,right):
            if left>=right:
                return
            self.recursion(s,left+1,right-1)
            s[left],s[right] = s[right],s[left]

# 双指针
    class Solution:
        def reverseString(self, s: List[str]) -> None:
            """
            Do not return anything, modify s in-place instead.
            """
            l = 0
            r = len(s)-1
            while l < r:
                s[l],s[r] = s[r],s[l]
                l += 1
                r -= 1
            return s

## 4.5 分治法（divide & conquer） ##

### 4.5.1 算法 ###

![在这里插入图片描述][2021071016081850.png]  
![在这里插入图片描述][20210710160835285.png]  
归并排序  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 141]

### 4.5.2 练习题 ###

#### 169 多数元素 ####

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 142]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 143]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 144]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 145]

# 排序法
    class Solution:
        def majorityElement(self, nums: List[int]) -> int:
            nums.sort()
            half = len(nums)//2
            return nums[half]

# 哈希表
    class Solution:
        def majorityElement(self, nums: List[int]) -> int:
            hashset = {
        }
            for i in nums:
                if i not in hashset:
                    hashset[i] = 0
                hashset[i] = hashset[i] + 1
                half = len(nums)//2
                for key in hashset.keys():
                    if hashset[key] > half:
                        return key
            return -1

#### 53 最大子序列 ####

![在这里插入图片描述][20210710174323604.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 146]  
![在这里插入图片描述][20210710174713382.png]  
![伪代码][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 147]  
![在这里插入图片描述][20210710175138916.png]

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 148]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 149]

class Solution:
        def maxSubArray(self, nums: List[int]) -> int:
            # 暴力法1，超时
            # count = 1
            # max1 = float('-inf')
            # while count<=len(nums):
            #     for i in range(0,len(nums)-count+1):
            #         sum1 = sum(nums[i:i+count])
            #         max1 = max(max1,sum1)
            #     count += 1
            # return max1  
            # 暴力法2，超时
            result = float('-inf')
            for i in range(0,len(nums)):
                temp = 0
                for j in range(i,len(nums)):
                    temp = temp+nums[j]
                    result = max(result,temp)
            return result

class Solution:
        def maxSubArray(self, nums: List[int]) -> int:
    		for i in range(1, len(nums)):
    		    nums[i]= nums[i] + max(nums[i-1], 0)
    		return max(nums)

## 4.6 回溯法（Backtracking） ##

### 4.6.1 算法 ###

![在这里插入图片描述][20210710230657972.png]  
回溯法也是一种递归，要有终止条件。

### 4.6.2 练习题 ###

#### 22 括号生成 ####

![在这里插入图片描述][20210714174233756.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 150]  
![在这里插入图片描述][20210714174524133.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 151]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 152]

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 153]

#### 78 子集 ####

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 154]  
**回溯法**  
![在这里插入图片描述][20210714182610919.png]

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 155]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 156]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 157]

class Solution:
        def subsets(self, nums: List[int]) -> List[List[int]]:
            for i in range(1,len(nums)+1):
                self.backtracking(nums,result,i,0,[])
            return result
    
        def backtracking(self,nums,result,length,index,subset):
            if len(subset) == length:
                result.append(subset[:])
                return
            for i in  range(index,len(nums)):
                subset.append(nums[i])
                self.backtracking(nums,result,length,i+1,subset)
                subset.pop()

**扩展法**  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 158]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 159]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 160]

class Solution:
        def subsets(self, nums: List[int]) -> List[List[int]]:
            result = [[]]
            for num in nums:
                temp=[]
                for cur in result:
                    temp.append(cur+[num])
                for t in temp:
                    result.append(t)
            return result

**深度优先算法**  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 161]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 162]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 163]

class Solution:
        def subsets(self, nums: List[int]) -> List[List[int]]:
                result=[]
            self.dfs(nums,result,0,[])
            return result
    
        def dfs(self,nums,result,index,subset):
            result.append(subset[:])
            if index == len(nums):
                return
            for i in range(index,len(nums)):
                subset.append(nums[i])
                self.dfs(nums,result,i+1,subset)
                subset.pop()

#### 77 组合 ####

#### 46 全排列 ####

#### 八皇后 数独 ####

## 4.7 深度优先搜索（DFS） ##

### 4.7.1 算法 ###

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 164]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 165]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 166]

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 167]  
回溯是走到一定程度就不走了，DFS是一直走到底。

### 4.7.2 练习题 ###

78 子集

#### 200 岛屿数量 ####

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 168]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 169]

![在这里插入图片描述][bbeb1ecf3d2b4575a593ad4f48560b50.png]  
**DFS:**  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 170]  
![在这里插入图片描述][a35ccf243ac44486872544f52ed9a8d3.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 171]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 172]

class Solution:
        def numIslands(self, grid: List[List[str]]) -> int:
            if grid is None or len(grid) == 0:
                return 0
            result = 0
            row = len(grid)
            col = len(grid[0])
            for i in range(0,row):
                for j in range(0,col):
                    if grid[i][j] == '1':
                        result += 1
                        self.dfs(grid,i,j,row,col)
            return result
    
        def dfs(self,grid,x,y,row,col):
            if x<0 or y<0 or x>= row or y>= col or grid[x][y] == '0':
                return
            grid[x][y] = '0'
            self.dfs(grid,x-1,y,row,col)
            self.dfs(grid,x+1,y,row,col)
            self.dfs(grid,x,y-1,row,col)
            self.dfs(grid,x,y+1,row,col)

**BFS：**

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 173]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 174]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 175]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 176]  
![在这里插入图片描述][a2b28718c2fb473a81570c2e5f5095c7.png]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 177]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 178]

class Solution:
        def numIslands(self, grid: List[List[str]]) -> int:
            if grid is None or len(grid) == 0:
                return 0
            result = 0
            row = len(grid)
            col = len(grid[0])
            q = []
            for i in range(0,row):
                for j in range(0,col):
                    if grid[i][j] == '1':
                        result += 1
                        q.append([i,j])
                        grid[i][j] == '0'
                        while len(q)>0:
                            cur = q.pop()
                            x = cur[0]
                            y = cur[1]
                            if x-1 >= 0 and grid[x-1][y] == '1':
                                q.append([x-1,y])
                                grid[x-1][y] == '0'
                            if y-1 >= 0 and grid[x][y-1] == '1':
                                q.append([x,y-1])
                                grid[x][y-1] == '0'
                            if x+1 < row and grid[x+1][y] == '1':
                                q.append([x+1,y])
                                grid[x+1][y] == '0'
                            if y+1 < col and grid[x][y+1] == '1':
                                q.append([x,y+1])
                                grid[x][y+1] == '0'
            return result

## 4.8 广度优先搜索（BFS） ##

### 4.8.1 算法 ###

### 4.8.2 练习题 ###

#### 938 二叉搜索树的范围和 ####

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 179]

递归法：  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 180]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 181]  
![在这里插入图片描述][20210719215135394.png]  
BFS：一般会和队列结合使用  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 182]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 183]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 184]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 185]  
![在这里插入图片描述][20210719215742914.png]

## 4.9 动态规划 ##

### 4.9.1 算法 ###

### 4.9.2 练习题 ###

## 4.10 前缀树（Trie） ##

### 4.10.1 算法 ###

### 4.10.2 练习题 ###

## 4.11 并查集 ##

## 4.12 并查集优化 ##

## 4.13 贪心算法 ##

哈希表：某个字符在数组里出现的次数  
第几大：堆  
有序时：对撞指针  
找到所有的：回溯法  
遍历查询某个值：可以通过赋值防止被再次遍历

参考链接：[手把手带你刷Leetcode力扣][Leetcode]

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70]: /images/20221005/3668e0613db94dcdb8c8afbadf7b33be.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 1]: /images/20221005/cb3f2ce133004c4b95dcfb57916b7ef6.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 2]: /images/20221005/218f9fd341ae449b9d642df53894ebec.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 3]: /images/20221005/5dc25366429f4a4391537827ae57ec0b.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 4]: /images/20221005/44d85a45fb21409ca399f34d5c5028ad.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 5]: /images/20221005/c6bfd57677324e3aacc0d4876e02785e.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 6]: /images/20221005/e5043ecddea04a41b08fb682eed4355b.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 7]: /images/20221005/431a34daccd44737bc5f9072e68f8793.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 8]: /images/20221005/77a0abe0bec54caa9935ae6e2206454b.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 9]: /images/20221005/545577c862884a43bb757b0c29568dc3.png
[20210705200115351.png]: /images/20221005/bcfe763f38e64ee58b0b6f3aa675005f.png
[2021070520055439.png]: /images/20221005/fe5216a38cfc42e08f4d66cd960a7953.png
[2021070520065561.png]: /images/20221005/334946a782c34f3e819167a48701c0e7.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 10]: /images/20221005/e99ddbbea5944a119f298d7718c3e580.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 11]: /images/20221005/77e252bb098a440fa2f9eaad2ca56e69.png
[20210705201609225.png]: /images/20221005/90d49966db9d4d1987726f50c6c58276.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 12]: /images/20221005/ca98e9dff293439baf63dbe919a30686.png
[20210705201909307.png]: /images/20221005/4feaa8b4e78845c3bdb38afe02bd1965.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 13]: /images/20221005/bfc502e292bc49e5b2e5d0c2fc3de1a1.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 14]: /images/20221005/346464f60c7443089ed9a94c4b77d86e.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 15]: /images/20221005/1038b67b701b4d629faac43c450152ed.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 16]: /images/20221005/31fe4e7e328f4997bd9c4910c6c93793.png
[20210705202529407.png]: /images/20221005/95412a18355d410cb64fd0b33f82fec2.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 17]: /images/20221005/565a5c6cdb43406eabc13dbd91110592.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 18]: /images/20221005/c6fa12d0fb3f4bc2b18dda282ef0d130.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 19]: /images/20221005/86b3af73db4d453e8c441e7011101551.png
[20210705211145889.png]: /images/20221005/c5b8b23ac473479abf0be231d49ded02.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 20]: /images/20221005/0d458d24e5ef4cfaa0b0b6dadd795482.png
[20210705210756116.png]: /images/20221005/228d74b8b3034c3ebad1686629fd0779.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 21]: /images/20221005/8dd0178bd92c49759a49b0450491958d.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 22]: /images/20221005/415430c46257423dad9e8afcbb6efe70.png
[20210705212103926.png]: /images/20221005/d5e81712f71d453590f4fb64c5525f7c.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 23]: /images/20221005/df4367ea87f249028eb6403b4281e345.png
[20210705212805164.png]: /images/20221005/98d7f341679a40818eee81c4443b25cd.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 24]: /images/20221005/5554eeeaa13d48b2bd367d8491de1bb9.png
[20210705213044242.png]: /images/20221005/ce6594b5840545c6acbcd2cf9f49fd13.png
[20210705213107800.png]: /images/20221005/23f2bb07196a4c79b4d2337241367950.png
[20210705213159513.png]: /images/20221005/c0a5bf5b02bf4e6aad283575397def8a.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 25]: /images/20221005/1c8ea7b922bf48ec9b99d8b2c81e8f36.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 26]: /images/20221005/399bf6ab1540499a88147880610ba6d1.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 27]: /images/20221005/46914b3c27fe4edb8f3eb35d35800d2e.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 28]: /images/20221005/5ab155b572db414c8c001e1f5b04da28.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 29]: /images/20221005/f7b8ad45f0424f4cafa446189e7a7c8a.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 30]: /images/20221005/08c30de37b7e4170bc3d16ddee170fce.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 31]: /images/20221005/fc79802d7c9b48cd982855e023e4e0f5.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 32]: /images/20221005/cd7a75b50a00425d830eceaf3f841aa4.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 33]: /images/20221005/c81c239458e04e3aa00f883aa5224734.png
[20210705215259740.png]: /images/20221005/8e796097277c46d2a7fd8c8b5574ed9b.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 34]: /images/20221005/3d09ce61847842cbb5b9e22e9ecacd82.png
[2021070521535337.png]: /images/20221005/f166acfda18542f58f78c62f1f45da51.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 35]: /images/20221005/5cc829dbd8984bf5b9e2d5c5f2fc277f.png
[20210705215447560.png]: /images/20221005/20f144a5854e4c9f8ccf9d9b088f25cd.png
[20210705215522655.png]: /images/20221005/955ce4b29f1b440e9aacac648cde665e.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 36]: /images/20221005/01f291a01f954bd09a1ab706f25c439e.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 37]: /images/20221005/2e86f09fe7ae4928841bb7a2f18f21a7.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 38]: /images/20221005/7312ae337ddf4288802d5a49998de2e7.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 39]: /images/20221005/062327643cd241cf80cd32ebebeb7036.png
[20210705222308998.png]: /images/20221005/71c037cfe9d74d92a3262b4882a6870b.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 40]: /images/20221005/e0eca16f1d144b5282547c84d0f62009.png
[20210705222337114.png]: /images/20221005/8d65a180d12d474cbea7b74cde2a25cb.png
[20210705222409971.png]: /images/20221005/fd76cacc14b747cca57eb142f1c8093f.png
[20210705222438513.png]: /images/20221005/c0b4dccaa5294199ae3b06b585ae4b61.png
[20210705222507736.png]: /images/20221005/0713b6e485ef4ff684d0d5b41f522402.png
[2021070522253696.png]: /images/20221005/c49d84be7c2a403980d817ec5d7ba440.png
[20210706134243943.png]: /images/20221005/277ba648f53848ba89ca93e2df808c48.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 41]: /images/20221005/a198de9bcfdd4837808275422fa2ddc7.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 42]: /images/20221005/8d4472005d644fcaac37a4f3b22f136e.png
[20210706151147165.png]: /images/20221005/268e7970fcbe4ff7ae89647504e408ac.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 43]: /images/20221005/672b9dd54ec545168d176c379ae4b46c.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 44]: /images/20221005/bca8e724b5e541a28e8615ceb5c03858.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 45]: /images/20221005/d4e417c2aaa24942a2b1d2392950b5eb.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 46]: /images/20221005/9adc032ba8be433d8d346ee075f05f37.png
[2021070522295233.png]: /images/20221005/01ee4a95bf0c4942a4a41fbcdcf2a672.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 47]: /images/20221005/dabea8816c4846a78ddba0213b47bbdf.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 48]: /images/20221005/241226afb6174b1f8fa7eb52e2678b9f.png
[20210705223739778.png]: /images/20221005/b9c2a452f4fd49c290defeca0192f5c8.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 49]: /images/20221005/546b88e49608434aa292824e6ad0ade4.png
[20210705224037387.png]: /images/20221005/dda1f033a93d44b9a91031f80b67444c.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 50]: /images/20221005/bbdd420a5e164160a5bfb5329b81f0a1.png
[20210705224129746.png]: /images/20221005/1abe11f8ea604657b52e899db6e249e7.png
[20210705224155771.png]: /images/20221005/47bdb39660fe4bfbac0696d89c774d5f.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 51]: /images/20221005/73aa54545d004ccbab5a2c71ffb9c07e.png
[20210707204134872.png]: /images/20221005/90d5cee2e01d4813a980c9a2a58c4e36.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 52]: /images/20221005/040c24b8423e43ea9eb1538318e79734.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 53]: /images/20221005/16ea616c663d4173abf51828cbe88b7e.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 54]: /images/20221005/a7d660b2ca594869b235a29f625171ff.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 55]: /images/20221005/1d89e2697a6e4b03ac1bd3f6502c3f81.png
[20210707204427252.png]: /images/20221005/5529f8002b214c58878c58f6f7509f33.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 56]: /images/20221005/82f9539da43247fdaa3b85cdb9cfa34c.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 57]: /images/20221005/d84eb66ab46d4e21a326fbd5fba87a3f.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 58]: /images/20221005/cadc7f47956c4a2f955745fee3c467c5.png
[20210707204639963.png]: /images/20221005/43cf7da505714284930aa45ea24874a2.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 59]: /images/20221005/c39d3441f372422090f17c5175c0d2a2.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 60]: /images/20221005/6fd0bda28e314671b1d7faf2c9c4fce7.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 61]: /images/20221005/e759c6c9dcd5455db1b71ae5015d92e5.png
[20210707205037586.png]: /images/20221005/b3170b16ee9d48efb539220755acc957.png
[20210705224533624.png]: /images/20221005/be5897405582463191ad87e816702ca1.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 62]: /images/20221005/cef7fd52a25642389c85db92bed605cc.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 63]: /images/20221005/8feb9eca29ff403d836e0db065e209ff.png
[20210707205539377.png]: /images/20221005/0b1a9e18ca7e465fbaf06ee8ad4cc5dd.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 64]: /images/20221005/451fe492dba04ef2b60d4dd8fdeec81f.png
[20210707205621159.png]: /images/20221005/9b37aff0f48b40159f4137d503dd8e06.png
[2021070720563827.png]: /images/20221005/f434b659f2544c3d874b640b75c45e5d.png
[20210707205656560.png]: /images/20221005/aaba949baa3f41e9ad22c1f3bbf92713.png
[20210707205749845.png]: /images/20221005/dc24065d7c0741c684364509bf558246.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 65]: /images/20221005/fc3e81c4cad7440bae5eb57aa2d39124.png
[20210707205852383.png]: /images/20221005/ed3948276a77470d85e1422172fbf9c9.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 66]: /images/20221005/6b75113f66aa43b8a70fb34b26bcd6b7.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 67]: /images/20221005/efae63fa96d24010bce40440d4d2259e.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 68]: /images/20221005/ffdb0c4df6c544629f863da2984a02d5.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 69]: /images/20221005/42762f501baf4c2aa1d1be628b6f9989.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 70]: /images/20221005/bca83adf155947ef82ca37c80d8ad458.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 71]: /images/20221005/571000904cbf4634a0ccc187a22da40a.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 72]: /images/20221005/0e22afc56ef74172a142df2a9500538e.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 73]: /images/20221005/7761f6d6e80544d68d56ea0dc69f2827.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 74]: /images/20221005/0aa73ace40104729bf0b62fc3d955140.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 75]: /images/20221005/baa6d294036e4926a0109ecde250565a.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 76]: /images/20221005/0ecc9654140541d1b1a3303be26e7471.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 77]: /images/20221005/fb95bcf38b4b4fff90b802e256ac37fa.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 78]: /images/20221005/bde53444df0a41c680f7f827a2e0c6fc.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 79]: /images/20221005/4d5668ba31e54c07a79c4a8a408724b5.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 80]: /images/20221005/3347a4cf62e84b5da1d3b2b7958bddb0.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 81]: /images/20221005/0268ff1e5a21432d92371565376c3a0c.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 82]: /images/20221005/8692e0383d9c41589b39c23f032fc5cc.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 83]: /images/20221005/8bdff264fd0f4a2bb091c974432ac69d.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 84]: /images/20221005/e33a80f101fa42b2b39966bc910d10c2.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 85]: /images/20221005/cc6ed805f9954bac8980bef56f35fa5c.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 86]: /images/20221005/e081aae70e1c4d95bdb0df36927cf7d6.png
[20210707213853603.png]: /images/20221005/cc648b2eb6cc4606aa5e265760b88bbd.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 87]: /images/20221005/89c9f1b85b964db39137dfad6131af24.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 88]: /images/20221005/81b3f6d18d244c89ae7f7594212725fd.png
[20210707214101687.png]: /images/20221005/e2ebc2bba84947d28675be5295410055.png
[20210707215116368.png]: /images/20221005/d21cd44781df4f62922e4e32c1d1a4b1.png
[20210707215153813.png]: /images/20221005/bbe8e38a14cb4770995c27ec9a4cdc4a.png
[20210707215211333.png]: /images/20221005/0d61c4755e7d486a968b72dfa7d5443c.png
[20210707215306886.png]: /images/20221005/ee8be676eb5d4c69a3cf194d72472883.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 89]: /images/20221005/bb9b2cbdb7ff4348868ccc084d03e4ca.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 90]: /images/20221005/d5878418c10f471497338ff8f44fc0e6.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 91]: /images/20221005/f5b79399d966496a9a91fcc0e0fc05c3.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 92]: /images/20221005/83f3cc382e864dd68117e9d8ad9e1e18.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 93]: /images/20221005/8504b260f6d745b79e78c075ad759086.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 94]: /images/20221005/42efcc1140234eec9bb1092e92d9e527.png
[20210707222321862.png]: /images/20221005/5dabde57ba074849af567477fa865741.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 95]: /images/20221005/461df58e1b7d48cca5d17a592ca5dfcb.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 96]: /images/20221005/60653518e9964398a9e616e00486c261.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 97]: /images/20221005/ae7cf038678a4642a52784b6506e6265.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 98]: /images/20221005/8f78acfbbc0c409195b1015d9486d9b8.png
[20210707223111681.png]: /images/20221005/c5514e71dcf5465db09779bcaaba69f4.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 99]: /images/20221005/b5f7a30b93fc4d3fab5efd44b41f0fb0.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 100]: /images/20221005/d6420fa20fd04d9788fa64f6e3ab6e4d.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 101]: /images/20221005/c1c71aa82a704960bf296979fc673748.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 102]: /images/20221005/d16dc2360af54042b702db364a559c34.png
[20210707224441107.png]: /images/20221005/e013d02f365144f9b0f8c2f1baffc9c6.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 103]: /images/20221005/0d4f5365368b427abaaaaea2ba6295db.png
[20210707224518581.png]: /images/20221005/b816e7bea420458a960faf6716b2364c.png
[20210707224918272.png]: /images/20221005/bb7b371626654e7a8a1f11018efcf836.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 104]: /images/20221005/a45568e76472470583daad08c08ea94d.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 105]: /images/20221005/47dc1d444c7b4cafaf26a4686aece35b.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 106]: /images/20221005/5fb2c091ddd34de0a3b7b210d5a0787c.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 107]: /images/20221005/d92ee2d27ace4ef0acb4bec5e787f12a.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 108]: /images/20221005/abb5a2808526422cb713f7421903f461.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 109]: /images/20221005/9e27d04fb67549d18ceee42669dfb309.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 110]: /images/20221005/cce5e0efef3641b0a36c8219dad164b0.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 111]: /images/20221005/53651fb577394627a542c013a72a1ec5.png
[20210708110035124.png]: /images/20221005/bf56206a7bb74e03a8ad0f4067ec651c.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 112]: /images/20221005/fc19e77d68d843e08c82d3682b317fe4.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 113]: /images/20221005/d7f4b2d3a0cf4cd3a091117832eee5ba.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 114]: /images/20221005/b9f9cf4ad6d443139e7fce9d56c4742e.png
[20210708213841116.png]: /images/20221005/4549f10a46334703a51970d9bb86981c.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 115]: /images/20221005/340cb1710afe4f9fbf34d32b95ad04e6.png
[20210708220252179.png]: /images/20221005/a5d7cb71f77c487fa19865bdebe5c9ec.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 116]: /images/20221005/64e6dd78e10847acb3a648d3d820e9e5.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 117]: /images/20221005/15f845391b0d4c84b2cf190c2217ef7a.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 118]: /images/20221005/933b8c8c53e447dc90c2975eda6e1aa6.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 119]: /images/20221005/c887ca47383448d0869da24921dc8ce2.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 120]: /images/20221005/30deb87dfcad4e0681805c54e2dc3418.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 121]: /images/20221005/2533b0fd8cfa464d9fcb29b74336d9fe.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 122]: /images/20221005/e60c34c4a4bf4e0aa5d46a102485219d.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 123]: /images/20221005/5cd5648d54ee4ceeb9bdf28535f8902d.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 124]: /images/20221005/0c6c8d3b80c04835bae4995d54646366.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 125]: /images/20221005/96b4056cbccd4df688f0de970234aeaf.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 126]: /images/20221005/6f40f8a17f19453fb16123abf1ddccb5.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 127]: /images/20221005/eb46fc1225da44c39658ea33e6a58cc0.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 128]: /images/20221005/93d04573a7f9450ab984497f2e03e33f.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 129]: /images/20221005/f91902b6ad904104b948525f08a540d9.png
[20210710151442444.png]: /images/20221005/2b6ec2a9521e41edb1a75e9cea339f94.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 130]: /images/20221005/296ea17ea7284acbacfbf0705ae82cbc.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 131]: /images/20221005/e0e56de3d73946e4a37cc77c3d5eb4dc.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 132]: /images/20221005/db27120ff67c4ed79df5fe36164fc3e2.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 133]: /images/20221005/064a4324ac1245e6b19ab590eee1a834.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 134]: /images/20221005/fa3b04ea224e461ca55a034568738b2b.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 135]: /images/20221005/2cb3a211183c4702ac21cada7ba9c115.png
[20210710153733327.png]: /images/20221005/444388e38de341baa240913835cd5941.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 136]: /images/20221005/f19e7903604f40139f82cde5a4c0eb70.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 137]: /images/20221005/6b55231a509042ffa084936a20cf869b.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 138]: /images/20221005/aa3eaff0e643457ea9ca575cc981792a.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 139]: /images/20221005/cd37698fc15f47dfb3ba0f762579f5b4.png
[20210710160205703.png]: /images/20221005/3e782d7b41df443b9fc10c8a61e6116b.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 140]: /images/20221005/148a4fc4c50149688e4196acea51e92e.png
[2021071016081850.png]: /images/20221005/8e8bfccdb89443f8a1d8d63eff8d7fb0.png
[20210710160835285.png]: /images/20221005/634bf025faf84405bf3d1c48dea4655e.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 141]: /images/20221005/124210616c114155b43c04ccd8ad700b.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 142]: /images/20221005/c854adfe1bde40cba9ffb7b32c44a922.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 143]: /images/20221005/82e4fdc70e6b43db9646e2514822d127.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 144]: /images/20221005/02ca02c46e834136b004cb462bcccca2.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 145]: /images/20221005/c80794bd098c465f8d082550f94c7f71.png
[20210710174323604.png]: /images/20221005/f979692806aa4c6aaf0421c011edf652.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 146]: /images/20221005/e0d34163361d48ac9586070acfcaa39b.png
[20210710174713382.png]: /images/20221005/0ce9c661354d4666b92c7d374aac4c51.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 147]: /images/20221005/0cf52e0cd4604496aa0641aa79c36f0c.png
[20210710175138916.png]: /images/20221005/1842976f4aa94074ba6e9f238fe1d70e.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 148]: /images/20221005/0b443737eae8425faf87eb50f764a235.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 149]: /images/20221005/51ba48b57d6f49f1a4ed3dd2409affb3.png
[20210710230657972.png]: /images/20221005/6c81bc54f2a447cdb0dbf3d1c174d898.png
[20210714174233756.png]: /images/20221005/6c8fbc2c29704dd89830aea1b2077084.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 150]: /images/20221005/26ede704d0d547a58774304125bb22fd.png
[20210714174524133.png]: /images/20221005/39958809ac334e1c9eb6c19e0ed62413.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 151]: /images/20221005/0eaeced7124e4a84868b1fe9b7dfcef1.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 152]: /images/20221005/4afeee15aa5d4abda4124c26a1fae72e.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 153]: /images/20221005/f147afdbc3574666b9e423b3c9580c95.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 154]: /images/20221005/9181587056e846cd92e8a122fc2660ca.png
[20210714182610919.png]: /images/20221005/b5e8a0e886444c05b44b585e19e354e0.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 155]: /images/20221005/856c5c9f7406434285687b62d473b20b.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 156]: /images/20221005/0ecc2bf24980443ca059b7ee4c41e8f4.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 157]: /images/20221005/c6f1ffc29180477cbf75515ad1cc9e27.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 158]: /images/20221005/26b891b07eaa4943aa538d2aa09ae487.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 159]: /images/20221005/ad8f94ed72fd448d97b8ab60b63fcf7a.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 160]: /images/20221005/bac1b7f0723d43caa108e47748d13b3f.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 161]: /images/20221005/fa4cdd6ec8914ff684170d7bffe9f349.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 162]: /images/20221005/508c026ce19e45c19d1e07cebcdc74b6.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 163]: /images/20221005/aec7d0b7ea39425cbe7c9997491b1e56.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 164]: /images/20221005/0096e4d1148242b2bf67e83bece634e0.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 165]: /images/20221005/468a4341c19a45d7ac31af7ed6aa60c7.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 166]: /images/20221005/8a78c56d88dc4540ba619c25182edfa5.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 167]: /images/20221005/5ec7686da24a4dfcb46af9149bdee4c3.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 168]: /images/20221005/a1c68ef94bf345089f09ed9867cb2ad7.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 169]: /images/20221005/0162b18e0fc948298c9195e10d942ba7.png
[bbeb1ecf3d2b4575a593ad4f48560b50.png]: /images/20221005/1402d3ec76d94f7d97743e29f935422e.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 170]: /images/20221005/0f009f4ffe8846a8a9b011b070eaecc7.png
[a35ccf243ac44486872544f52ed9a8d3.png]: /images/20221005/c7565d29273940ccb994e0034625c552.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 171]: /images/20221005/7566349a278e4aa9b38651c98b4e6f91.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 172]: /images/20221005/4e75c17f0bb04bee981de6fe59f864af.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 173]: /images/20221005/fcb72f79403542269f6ca7b1258bd597.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 174]: /images/20221005/712209a396344c50b18a5b7a8ee37d9a.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 175]: /images/20221005/e9d03828c6d04f089b79b3cb51ca8c45.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 176]: /images/20221005/2bf4b6b9ae8140989711036d62ce8b45.png
[a2b28718c2fb473a81570c2e5f5095c7.png]: /images/20221005/d7d4228369a946d59f52cb256386f9bf.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 177]: /images/20221005/538bf4a98bb8444e84cedb17346928b2.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 178]: /images/20221005/0b5d6858c4144b35a092ee6f2a393754.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 179]: /images/20221005/54b8d3ea750a4e8bb7a5d9df68074a44.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 180]: /images/20221005/7fd3fcb436c040d083649d7a9d3f7269.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 181]: /images/20221005/d5a822b8166041f386b228064408c949.png
[20210719215135394.png]: /images/20221005/c3df859db7634d359e1823c9f8026870.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 182]: /images/20221005/388e3bdd24874aaaa7b0d44fb4c93892.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 183]: /images/20221005/efab299b8bdc4b59a9457ed42cd26733.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 184]: /images/20221005/9b2b71a26bcf4f28858ac2d0135cd4a1.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM5MjIzNDQ0_size_16_color_FFFFFF_t_70 185]: /images/20221005/8329977075af4d6d87c4390a0d1f850b.png
[20210719215742914.png]: /images/20221005/3bd0af37326f4ec790fbe708927669ed.png
[Leetcode]: https://www.bilibili.com/video/BV1sy4y1q79M