-
Notifications
You must be signed in to change notification settings - Fork 0
/
TOC
103 lines (100 loc) · 15.3 KB
/
TOC
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
Table of Contents
=================
* [数据结构篇](#数据结构篇)
* [二叉树](#二叉树)
* [maximum-depth-of-binary-tree<a href="https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/" rel="nofollow">二叉树的最大深度</a>](#maximum-depth-of-binary-tree二叉树的最大深度)
* [balanced-binary-tree<a href="https://leetcode-cn.com/problems/balanced-binary-tree/" rel="nofollow">平衡二叉树</a>](#balanced-binary-tree平衡二叉树)
* [binary-tree-maximum-path-sum<a href="https://leetcode-cn.com/problems/binary-tree-maximum-path-sum/" rel="nofollow">二叉树中的最大路径和</a>](#binary-tree-maximum-path-sum二叉树中的最大路径和)
* [lowest-common-ancestor-of-a-binary-tree<a href="https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/" rel="nofollow">二叉树的最近公共祖先</a>](#lowest-common-ancestor-of-a-binary-tree二叉树的最近公共祖先)
* [binary-tree-level-order-traversal<a href="https://leetcode-cn.com/problems/binary-tree-level-order-traversal/" rel="nofollow">二叉树的层序遍历</a>](#binary-tree-level-order-traversal二叉树的层序遍历)
* [binary-tree-level-order-traversal-ii<a href="https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/" rel="nofollow">二叉树的层次遍历 II</a>](#binary-tree-level-order-traversal-ii二叉树的层次遍历-ii)
* [binary-tree-zigzag-level-order-traversal <a href="https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/" rel="nofollow">二叉树的锯齿形层次遍历</a>](#binary-tree-zigzag-level-order-traversal-二叉树的锯齿形层次遍历)
* [validate-binary-search-tree<a href="https://leetcode-cn.com/problems/validate-binary-search-tree/" rel="nofollow"> 验证二叉搜索树</a>](#validate-binary-search-tree-验证二叉搜索树)
* [insert-into-a-binary-search-tree<a href="https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/" rel="nofollow">二叉搜索树中的插入操作</a>](#insert-into-a-binary-search-tree二叉搜索树中的插入操作)
* [链表](#链表)
* [remove-duplicates-from-sorted-list<a href="https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list/" rel="nofollow"> 删除排序链表中的重复元素</a>](#remove-duplicates-from-sorted-list-删除排序链表中的重复元素)
* [remove-duplicates-from-sorted-list-ii<a href="https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-ii/" rel="nofollow">删除排序链表中的重复元素 II</a>](#remove-duplicates-from-sorted-list-ii删除排序链表中的重复元素-ii)
* [reverse-linked-list<a href="https://leetcode-cn.com/problems/reverse-linked-list/" rel="nofollow">反转链表</a>](#reverse-linked-list反转链表)
* [reverse-linked-list-ii<a href="https://leetcode-cn.com/problems/reverse-linked-list-ii/" rel="nofollow">反转链表 II</a>](#reverse-linked-list-ii反转链表-ii)
* [merge-two-sorted-list<a href="https://leetcode-cn.com/problems/merge-two-sorted-lists/" rel="nofollow">合并两个有序链表</a>](#merge-two-sorted-list合并两个有序链表)
* [partition-list<a href="https://leetcode-cn.com/problems/partition-list/" rel="nofollow">分隔链表</a>](#partition-list分隔链表)
* [sort-list <a href="https://leetcode-cn.com/problems/sort-list/" rel="nofollow">排序链表</a>](#sort-list-排序链表)
* [reorder-list <a href="https://leetcode-cn.com/problems/reorder-list/" rel="nofollow">重排链表</a>](#reorder-list-重排链表)
* [linked-list-cycle<a href="https://leetcode-cn.com/problems/linked-list-cycle/" rel="nofollow">环形链表</a>](#linked-list-cycle环形链表)
* [linked-list-cycle-ii <a href="https://leetcode-cn.com/problems/linked-list-cycle-ii/" rel="nofollow">环形链表 II</a>](#linked-list-cycle-ii-环形链表-ii)
* [palindrome-linked-list<a href="https://leetcode-cn.com/problems/palindrome-linked-list/" rel="nofollow"> 回文链表</a>](#palindrome-linked-list-回文链表)
* [copy-list-with-random-pointer<a href="https://leetcode-cn.com/problems/copy-list-with-random-pointer/" rel="nofollow">复制带随机指针的链表</a>](#copy-list-with-random-pointer复制带随机指针的链表)
* [栈和队列](#栈和队列)
* [min-stack <a href="https://leetcode-cn.com/problems/min-stack/" rel="nofollow">最小栈</a>](#min-stack-最小栈)
* [evaluate-reverse-polish-notation<a href="https://leetcode-cn.com/problems/evaluate-reverse-polish-notation/" rel="nofollow">逆波兰表达式求值</a>](#evaluate-reverse-polish-notation逆波兰表达式求值)
* [decode-string<a href="https://leetcode-cn.com/problems/decode-string/" rel="nofollow">字符串解码</a>](#decode-string字符串解码)
* [binary-tree-inorder-traversal<a href="https://leetcode-cn.com/problems/binary-tree-inorder-traversal/" rel="nofollow">二叉树的中序遍历</a>](#binary-tree-inorder-traversal二叉树的中序遍历)
* [clone-graph<a href="https://leetcode-cn.com/problems/clone-graph/" rel="nofollow">克隆图</a>](#clone-graph克隆图)
* [number-of-islands<a href="https://leetcode-cn.com/problems/number-of-islands/" rel="nofollow">岛屿数量</a>](#number-of-islands岛屿数量)
* [largest-rectangle-in-histogram<a href="https://leetcode-cn.com/problems/largest-rectangle-in-histogram/" rel="nofollow">柱状图中最大的矩形</a>](#largest-rectangle-in-histogram柱状图中最大的矩形)
* [implement-queue-using-stacks<a href="https://leetcode-cn.com/problems/implement-queue-using-stacks/" rel="nofollow">用栈实现队列</a>](#implement-queue-using-stacks用栈实现队列)
* [01-mtrix<a href="https://leetcode-cn.com/problems/01-matrix/" rel="nofollow">01 矩阵</a>](#01-mtrix01-矩阵)
* [二进制](#二进制)
* [single-number<a href="https://leetcode-cn.com/problems/single-number/" rel="nofollow">只出现一次的数字</a>](#single-number只出现一次的数字)
* [single-number-ii<a href="https://leetcode-cn.com/problems/single-number-ii/" rel="nofollow">只出现一次的数字 II</a>](#single-number-ii只出现一次的数字-ii)
* [single-number-iii<a href="https://leetcode-cn.com/problems/single-number-iii/" rel="nofollow">只出现一次的数字 III</a>](#single-number-iii只出现一次的数字-iii)
* [number-of-1-bits<a href="https://leetcode-cn.com/problems/number-of-1-bits/" rel="nofollow">位1的个数</a>](#number-of-1-bits位1的个数)
* [counting-bits<a href="https://leetcode-cn.com/problems/counting-bits/" rel="nofollow">比特位计数</a>](#counting-bits比特位计数)
* [reverse-bits<a href="https://leetcode-cn.com/problems/reverse-bits/" rel="nofollow">颠倒二进制位</a>](#reverse-bits颠倒二进制位)
* [bitwise-and-of-numbers-range<a href="https://leetcode-cn.com/problems/bitwise-and-of-numbers-range/" rel="nofollow">数字范围按位与</a>](#bitwise-and-of-numbers-range数字范围按位与)
* [基础算法篇](#基础算法篇)
* [二分搜索](#二分搜索)
* [binary-search<a href="https://leetcode-cn.com/problems/binary-search/" rel="nofollow">二分查找</a>](#binary-search二分查找)
* [search-insert-position<a href="https://leetcode-cn.com/problems/search-insert-position/" rel="nofollow">搜索插入位置</a>](#search-insert-position搜索插入位置)
* [search-a-2d-matrix<a href="https://leetcode-cn.com/problems/search-a-2d-matrix/" rel="nofollow">搜索二维矩阵</a>](#search-a-2d-matrix搜索二维矩阵)
* [first-bad-version<a href="https://leetcode-cn.com/problems/first-bad-version/" rel="nofollow">第一个错误的版本</a>](#first-bad-version第一个错误的版本)
* [find-minimum-in-rotated-sorted-array<a href="https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/" rel="nofollow">寻找旋转排序数组中的最小值</a>](#find-minimum-in-rotated-sorted-array寻找旋转排序数组中的最小值)
* [find-minimum-in-rotated-sorted-array-ii<a href="https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array-ii/" rel="nofollow">寻找旋转排序数组中的最小值 II</a>](#find-minimum-in-rotated-sorted-array-ii寻找旋转排序数组中的最小值-ii)
* [search-in-rotated-sorted-array<a href="https://leetcode-cn.com/problems/search-in-rotated-sorted-array/" rel="nofollow">搜索旋转排序数组</a>](#search-in-rotated-sorted-array搜索旋转排序数组)
* [search-in-rotated-sorted-array-ii<a href="https://leetcode-cn.com/problems/search-in-rotated-sorted-array-ii/" rel="nofollow">搜索旋转排序数组 II</a>](#search-in-rotated-sorted-array-ii搜索旋转排序数组-ii)
* [动态规划](#动态规划)
* [<strong>背景</strong>](#背景)
* [使用场景](#使用场景)
* [四点要素](#四点要素)
* [常见四种类型](#常见四种类型)
* [1、矩阵类型（10\x）](#1矩阵类型10)
* [minimum-path-sum<a href="https://leetcode-cn.com/problems/minimum-path-sum/" rel="nofollow">最小路径和</a>](#minimum-path-sum最小路径和)
* [unique-paths<a href="https://leetcode-cn.com/problems/unique-paths/" rel="nofollow">不同路径</a>](#unique-paths不同路径)
* [unique-paths-ii<a href="https://leetcode-cn.com/problems/unique-paths-ii/" rel="nofollow">不同路径 II</a>](#unique-paths-ii不同路径-ii)
* [2、序列类型（40\x）](#2序列类型40)
* [climbing-stairs<a href="https://leetcode-cn.com/problems/climbing-stairs/" rel="nofollow">爬楼梯</a>](#climbing-stairs爬楼梯)
* [jump-game<a href="https://leetcode-cn.com/problems/jump-game/" rel="nofollow">跳跃游戏</a>](#jump-game跳跃游戏)
* [jump-game-ii<a href="https://leetcode-cn.com/problems/jump-game-ii/" rel="nofollow">跳跃游戏 II</a>](#jump-game-ii跳跃游戏-ii)
* [palindrome-partitioning-ii<a href="https://leetcode-cn.com/problems/palindrome-partitioning-ii/" rel="nofollow">分割回文串 II</a>](#palindrome-partitioning-ii分割回文串-ii)
* [longest-increasing-subsequence<a href="https://leetcode-cn.com/problems/longest-increasing-subsequence/" rel="nofollow">最长上升子序列</a>](#longest-increasing-subsequence最长上升子序列)
* [word-break<a href="https://leetcode-cn.com/problems/word-break/" rel="nofollow">单词拆分</a>](#word-break单词拆分)
* [小结](#小结)
* [3. Two Sequences DP（40\x）](#3-two-sequences-dp40)
* [longest-common-subsequence<a href="https://leetcode-cn.com/problems/longest-common-subsequence/" rel="nofollow">最长公共子序列</a>](#longest-common-subsequence最长公共子序列)
* [edit-distance<a href="https://leetcode-cn.com/problems/edit-distance/" rel="nofollow">编辑距离</a>](#edit-distance编辑距离)
* [4.零钱和背包（10\x）](#4零钱和背包10)
* [coin-change<a href="https://leetcode-cn.com/problems/coin-change/" rel="nofollow">零钱兑换</a>](#coin-change零钱兑换)
* [算法思维](#算法思维)
* [递归思维](#递归思维)
* [<a href="https://leetcode-cn.com/problems/reverse-string/" rel="nofollow">reverse-string</a><a href="https://leetcode-cn.com/problems/reverse-string/" rel="nofollow">反转字符串</a>](#reverse-string反转字符串)
* [<a href="https://leetcode-cn.com/problems/swap-nodes-in-pairs/" rel="nofollow">swap-nodes-in-pairs</a><a href="https://leetcode-cn.com/problems/swap-nodes-in-pairs/" rel="nofollow">两两交换链表中的节点</a>](#swap-nodes-in-pairs两两交换链表中的节点)
* [<a href="https://leetcode-cn.com/problems/unique-binary-search-trees-ii/" rel="nofollow">unique-binary-search-trees-ii</a><a href="https://leetcode-cn.com/problems/unique-binary-search-trees-ii/" rel="nofollow">不同的二叉搜索树 II</a>](#unique-binary-search-trees-ii不同的二叉搜索树-ii)
* [<a href="https://leetcode-cn.com/problems/fibonacci-number/" rel="nofollow">fibonacci-number</a><a href="https://leetcode-cn.com/problems/fibonacci-number/" rel="nofollow">斐波那契数</a>](#fibonacci-number斐波那契数)
* [滑动窗口思想](#滑动窗口思想)
* [<a href="https://leetcode-cn.com/problems/permutation-in-string/" rel="nofollow">permutation-in-string</a><a href="https://leetcode-cn.com/problems/permutation-in-string/" rel="nofollow">字符串的排列</a>](#permutation-in-string字符串的排列)
* [<a href="https://leetcode-cn.com/problems/find-all-anagrams-in-a-string/" rel="nofollow">find-all-anagrams-in-a-string</a><a href="https://leetcode-cn.com/problems/find-all-anagrams-in-a-string/" rel="nofollow">找到字符串中所有字母异位词</a>](#find-all-anagrams-in-a-string找到字符串中所有字母异位词)
* [<a href="https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/" rel="nofollow">longest-substring-without-repeating-characters</a><a href="https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/" rel="nofollow">无重复字符的最长子串</a>](#longest-substring-without-repeating-characters无重复字符的最长子串)
* [总结](#总结)
* [二叉搜索树](#二叉搜索树)
* [<a href="https://leetcode-cn.com/problems/validate-binary-search-tree/" rel="nofollow">validate-binary-search-tree</a><a href="https://leetcode-cn.com/problems/validate-binary-search-tree/" rel="nofollow">验证二叉搜索树</a>](#validate-binary-search-tree验证二叉搜索树)
* [<a href="https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/" rel="nofollow">insert-into-a-binary-search-tree</a><a href="https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/" rel="nofollow">二叉搜索树中的插入操作</a>](#insert-into-a-binary-search-tree二叉搜索树中的插入操作-1)
* [<a href="https://leetcode-cn.com/problems/delete-node-in-a-bst/" rel="nofollow">delete-node-in-a-bst</a><a href="https://leetcode-cn.com/problems/delete-node-in-a-bst/" rel="nofollow">删除二叉搜索树中的节点</a>](#delete-node-in-a-bst删除二叉搜索树中的节点)
* [<a href="https://leetcode-cn.com/problems/balanced-binary-tree/" rel="nofollow">balanced-binary-tree</a><a href="https://leetcode-cn.com/problems/balanced-binary-tree/" rel="nofollow">平衡二叉树</a>](#balanced-binary-tree平衡二叉树-1)
* [回溯法](#回溯法)
* [<a href="https://leetcode-cn.com/problems/subsets/" rel="nofollow">subsets</a><a href="https://leetcode-cn.com/problems/subsets/" rel="nofollow">子集</a>](#subsets子集)
* [<a href="https://leetcode-cn.com/problems/subsets-ii/" rel="nofollow">subsets-ii</a><a href="https://leetcode-cn.com/problems/subsets-ii/" rel="nofollow">子集 II</a>](#subsets-ii子集-ii)
* [<a href="https://leetcode-cn.com/problems/permutations/" rel="nofollow">permutations</a><a href="https://leetcode-cn.com/problems/permutations/" rel="nofollow">全排列</a>](#permutations全排列)
* [<a href="https://leetcode-cn.com/problems/permutations-ii/" rel="nofollow">permutations-ii</a><a href="https://leetcode-cn.com/problems/permutations-ii/" rel="nofollow">全排列 II</a>](#permutations-ii全排列-ii)
* [练习:](#练习)
* [<a href="https://leetcode-cn.com/problems/combination-sum/" rel="nofollow">组合总和</a>](#组合总和)
Created by [gh-md-toc](https://github.com/ekalinin/github-markdown-toc)