Data Structure and algorithm analysis
Introduction
1.
Questions
2.
First Chapter
3.
LeetCode
3.1.
6 Zigzag Conversion_String
3.2.
7 Reverse Integer_Math
3.3.
8 String to Integer_String_Math
3.4.
9 Palindrome Number
3.5.
12 Integer to Roman_Math
3.6.
13 Roman to Integer_Math
3.7.
14 Longest Common Prefix_String
3.8.
19 Remove Nth Node From End of List
3.9.
20 Valid Parentheses
3.10.
21 Merge Two Sorted Lists
3.11.
26 Remove Duplicates from Sorted Array
3.12.
27 Remove Element
3.13.
28 Implement strSTR
3.14.
36 Valid Sudoku
3.15.
38 Count and Say
3.16.
58 Length of Last Word_String
3.17.
66 Plus One_Array_Math
3.18.
67 Add Binary
3.19.
83 Linked List
3.20.
88 Merge Sorted Array
3.21.
118 Pascal's Triangle
3.22.
119 Pascal Triangle ii
3.23.
125 Valid Palindrome
3.24.
100 Same Tree
3.25.
101 Symmetric Tree
3.26.
102 Binary Tree Level Order Traversal
3.27.
104 Maximum Depth of Binary Tree
3.28.
107 Binary Tree Level Order Traversal II
3.29.
110 Balanced Binary Tree
3.30.
111 Minimum Depth of Binary Tree
3.31.
112 Path Sum
4.
Lintcode
4.1.
A+B
4.2.
secondMaxArray
4.3.
swapTwoIntegers
4.4.
validPalindrome
4.5.
StudentID
4.6.
PrimeFactorization
4.7.
AmicablePair
4.8.
Insert_Node_In_Sorted_LinkedList
4.9.
Narcissistic Number
4.10.
Reverse Linked List
4.11.
Implement Queue by Two Stacks
4.12.
Invert Binary Tree
4.13.
Binary Tree Path Sum
4.14.
Binary Tree Paths
4.15.
Reference
4.16.
Middle of Linked List
4.17.
Remove Duplicates from Unsorted List
4.18.
Swap Nodes in Pairs
4.19.
Delete Node in the Middle of Singly Linked List
4.20.
Convert Sorted Array to Binary Search Tree With Minimal Height
4.21.
Valid Binary Search Tree
4.22.
Name Duplication
4.23.
Two Sum
5.
SUMMARY
5.1.
String
5.2.
Basic
5.3.
tips
5.4.
Array
5.5.
Tree
5.5.1.
Traverse
5.5.2.
Concepts
5.6.
LinkedList
5.7.
Delete Element
6.
Nine Chapter Algorithm Class
6.1.
Chapter1
6.2.
Chapter2
7.
Nine Chapter Algorithm
7.1.
Binary Tree
7.1.1.
code
7.2.
LinkedList
7.2.1.
Code
7.2.2.
PriorityQueue
7.3.
Binary Search and Sorted Array
7.3.1.
Code
7.4.
Dynamic Programming
7.4.1.
code
7.5.
Data Structure
7.5.1.
code
7.6.
High Frequency
7.6.1.
code
Powered by
GitBook
Data Structure and algorithm analysis
Delete Element
Array思想：平移数字，override数字到前一个或后一个位置。
LinkedList思想：
head：头指针指向下一个让原来的head飘走
middle & end：操作这个node的前一个node，让其指向此node的下一个node，让这个node飘走：即不能有指针指向该node