lintcode题解
Introduction
1.
Reference
2.
Math
2.1.
Max Points on a Line
2.2.
Swap numbers without tmp
2.3.
A plus B without +
2.4.
AtoI
2.5.
Divide Two Integers
2.6.
Add Two Binary
2.7.
Valid Sudoku
2.8.
Gray Code
3.
Bit Manipulation
3.1.
Single Number
3.2.
Single Number II
3.3.
Single Number III
3.4.
Single Number IV
3.5.
Check power of 2
4.
Binary Tree
4.1.
Binary Tree Maximum Path Sum
4.2.
Construct Binary Tree
4.3.
zigzag traversal
4.4.
search range in binary search tree
4.5.
Binary Search Tree Iterator
4.6.
Remove node in Binary Search Tree
4.7.
Construct Tree with Preorder and Inorder tranversal
4.8.
Sub Tree
4.9.
Binary Tree Upside Down
5.
Binary Search and Sorted Array
5.1.
Search 2D Matrix
5.2.
Search 2D Matrix II
5.3.
Wood Cut
5.4.
Find Peak Element II
6.
Dynamic Programming
6.1.
Triangle
6.2.
Jump Game
6.3.
Jump Game 2
6.4.
Unique Path
6.5.
Unique Path 2
6.6.
Minimum Path Sum
6.7.
Climbing chairs
6.8.
Word Break
6.9.
Palindrome Partition
6.10.
Palindrome Partition II
6.11.
Longest Increasing Sequence
6.12.
Longest Increasing Sequence 2D
6.13.
Longest Palindromic Substring
6.14.
House Robber
6.15.
House Robber II
6.16.
Max Square
7.
Dynamica Programming 2
7.1.
Longest Common Substring
7.2.
Longest Common Subsequence
7.3.
Edit Distance
7.4.
Distinct Subsequence
7.5.
Interleaving String
7.6.
backpack
7.7.
backpack2
7.8.
Minimum Adjustment Cost
7.9.
Coins in a Line
7.10.
Coins in a Line II
7.11.
Coins in a Line III
7.12.
Unique Binary Search Tree
7.13.
Copy Books
7.14.
Scramble String
7.15.
Regular Expression Matching
7.16.
Wildcard Matching
8.
Linked List
8.1.
Reverse Linked List
8.2.
Reverse Linked List II
8.3.
Convert Sorted List to BST
8.4.
Partition List
8.5.
Remove Duplicates
8.6.
Remove Duplicates II
8.7.
Sort List
8.8.
Merge k Sorted Lists
8.9.
Reorder List
8.10.
Linked List Cycle
8.11.
Linked List Cycle II
8.12.
Copy List with Random Pointers
8.13.
Delete Node in the Middle of Singly Linked List
9.
Graph
9.1.
Clone Graph
9.2.
Combination Sum
9.3.
N Queen
9.4.
全排列问题
9.5.
word ladder
9.6.
word ladder II
9.7.
Number of Islands
9.8.
Number of Islands II
9.9.
Topological Sorting
10.
Data Structure
10.1.
Longest Consecutive Sequence
10.2.
Rehashing
10.3.
LRU Cache
10.4.
Max Tree
10.5.
Valid Palindrome
10.6.
Trie
10.7.
Word Search II
10.8.
Expression Tree Build
10.9.
Expression To Reverse Polish Notation
10.10.
Eval Expression
11.
Stack
11.1.
Min Stack
11.2.
Queue 2 Stack
11.3.
SimplifyPath
11.4.
Largest Rectangle in Histogram
12.
Heap
12.1.
Heapify
12.2.
Trapping Rain Water
12.3.
Trapping Rain Water II
12.4.
kth smallest element in sorted matrix
12.5.
Sliding Window Maximum
12.6.
Data Stream Median
13.
High Frequency
13.1.
2 Sum
13.2.
3 Sum
13.3.
3 Sum Closest
13.4.
4 Sum
13.5.
Best time to buy and sell stock
13.6.
Best time to buy and sell stock II
13.7.
Best time to buy and sell stock III
13.8.
Best time to buy and sell stock IV
13.9.
Majority Number
13.10.
Majority Number II
13.11.
Majority Number III
13.12.
Subarray Sum
13.13.
Subarray Sum Closest
13.14.
Fast Power
13.15.
Sort Color
13.16.
Sort Color II
13.17.
Sort Letters By Case
13.18.
Partition Array
13.19.
Maximum Subarray
13.20.
Maximum Subarray II
13.21.
Minimum Subarray
13.22.
Continuous Subarray Sum
13.23.
Continuous Subarray Sum II
13.24.
Maximum Product Subarray
13.25.
Digit Count
13.26.
Ugly Number
13.27.
Word Search
14.
Recursion
14.1.
Print Numbers by Recursion
14.2.
hanoi
15.
Sort
15.1.
kth Largest Element
15.2.
Median
15.3.
Insert Intervals
15.4.
Merge Intervals
15.5.
Largest Number
15.6.
Nuts And Bolts
16.
String and Array
16.1.
Replace Space
16.2.
Count and Say
16.3.
Valid Palindrome
16.4.
Longest Common Prefix
16.5.
First Missing Positive
16.6.
Number of Airplanes in Sky
16.7.
Valid Number
16.8.
Binary Representation
16.9.
Integer to Roman
16.10.
Roman to Integer
17.
Two Pointer
17.1.
Remove Element
17.2.
Remove Duplicates from Sorted Array
17.3.
Remove Duplicates from Sorted Array II
17.4.
The smallest difference
17.5.
triangle Count
17.6.
Interleaving Positive and Negative
17.7.
Longest Substring without Repeating Character
17.8.
Longest Substring without at most K Distinct
17.9.
Minimum Size Subarray Sum
17.10.
Minimum Window Substring
18.
cc150
18.1.
flip bits
18.2.
Rotate Image
18.3.
Set Matrix Zeros
18.4.
Update Bits
19.
Combination and Permutation
19.1.
Subsets
19.2.
Subsets II
19.3.
Permutations
19.4.
Permutations II
19.5.
Combination Sum
19.6.
Combination Sum II
19.7.
Permutation Index
19.8.
Permutation Index II
19.9.
Permutation Sequence
19.10.
Previous Permutation
19.11.
Next Permutation
19.12.
K Sum II
19.13.
Unique BST
20.
Segment Tree
20.1.
SegmentTree Build
20.2.
SegmentTree Modify
20.3.
SegmentTree Query
20.4.
Count of Smaller Number
20.5.
Count of Smaller Number II
20.6.
Interval Sum
20.7.
Interval Sum II
20.8.
Interval Minimum Number
21.
Union Find
21.1.
Find the Weak Connected Component in the Directed Graph
22.
Greedy
22.1.
Candy
22.2.
Delete Digits
22.3.
Find the Missing Number
22.4.
Gas Station
Powered by
GitBook
lintcode题解
Graph
deep clone类的问题经常要用到hashtable(dictionary)来帮助copy
permutation 和 strstr的问题其实也是 graph问题
BFS
DFS