LeetCode
课程大纲
1.
Introduction
1.1.
content
2.
First Chapter
2.1.
Reverse Integer
2.2.
String to Integer(atoi)
2.3.
Palindrome Number
2.4.
Palindrome Linked List
2.5.
3num
2.6.
Container With Most Water
2.7.
Trapping Rain Water
2.8.
Add Binary
3.
Sorting algorithms
3.1.
QuickSort
4.
Tree
4.1.
TreeSummary
4.2.
Binary Tree Inorder Traversal
4.3.
Binary Tree Preorder Traversal
4.4.
Binary Tree Postorder Traversal
4.5.
Binary Search Tree Iterator
4.6.
Balanced Binary Tree
5.
Binary Search
5.1.
Sqrt(x)
5.2.
Pow(x, n)
5.3.
Find Peak Element
5.4.
Search Insert Position
5.5.
Binary Search Template
5.6.
First Bad Version
5.7.
Search for a Range
5.8.
Maximum Depth of Binary Tree
6.
String
6.1.
Implement strStr()
6.2.
Valid Parentheses
6.3.
Valid Palindrome
6.4.
Merge Sorted Array
7.
HashTable
7.1.
Contains Duplicate II
8.
LinkedList
8.1.
dummy
9.
Time complexity
10.
DP
11.
C++ API
11.1.
priority_queue
11.2.
Merge k Sorted Lists(priority_queue)
11.3.
类初始化
11.4.
map
Powered by
GitBook
LeetCode
dummy
when would i use dummy node ?
when the head node is gonna be changed , you should use dummy head to store the head in order to return the list conveniently.
when the head is not determined
merge list
delete node