lintcode算法分析和解答

5星 · 超过95%的资源需积分: 17 89 下载量 130 浏览量 2017-07-26 18:31:38 上传评论 2 收藏 13.93MB PDF 举报

温馨提示

试读

928页

lintcode刷题必备

资源推荐

资源详情

资源评论

1.1
1.2
1.2.1
1.2.2
1.3
1.4
1.4.1
1.4.2
1.4.3
1.4.4
1.4.5
1.4.6
1.4.7
1.4.8
1.4.9
1.4.10
1.5
1.5.1
1.5.2
1.5.3
1.5.4
1.5.5
1.5.6
1.5.7
1.5.8
1.5.9
1.6
1.6.1
1.6.2
1.6.3
1.6.3.1
1.6.3.2
1.6.4
1.6.5
目录
Preface
FAQ
Guidelines for Contributing
Contributors
Part I - Basics
Basics Data Structure
String
Linked List
Binary Tree
Huffman Compression
Queue
Heap
Stack
Set
Map
Graph
Basics Sorting
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
Heap Sort
Bucket Sort
Counting Sort
Radix Sort
Basics Algorithm
Divide and Conquer
Binary Search
Math
Greatest Common Divisor
Prime
Knapsack
Counting Problem
2

1.6.6
1.6.6.1
1.6.7
1.7
1.7.1
1.8
1.9
1.9.1
1.9.2
1.9.3
1.9.4
1.9.5
1.9.6
1.9.7
1.9.8
1.9.9
1.9.10
1.9.11
1.9.12
1.9.13
1.10
1.10.1
1.10.2
1.10.3
1.10.4
1.10.5
1.10.6
1.10.7
1.10.8
1.10.9
1.10.10
1.10.11
1.10.12
1.10.13
1.10.14
1.10.15
1.10.16
Probability
Shuffle
Bitmap
Basics Misc
Bit Manipulation
Part II - Coding
String
Implement strStr
Two Strings Are Anagrams
Compare Strings
Group Anagrams
Longest Common Substring
Rotate String
Reverse Words in a String
Valid Palindrome
Longest Palindromic Substring
Space Replacement
Wildcard Matching
Length of Last Word
Count and Say
Integer Array
Remove Element
Zero Sum Subarray
Subarray Sum K
Subarray Sum Closest
Recover Rotated Sorted Array
Product of Array Exclude Itself
Partition Array
First Missing Positive
2 Sum
3 Sum
3 Sum Closest
Remove Duplicates from Sorted Array
Remove Duplicates from Sorted Array II
Merge Sorted Array
Merge Sorted Array II
Median
3

1.10.17
1.10.18
1.11
1.11.1
1.11.2
1.11.3
1.11.4
1.11.5
1.11.6
1.11.7
1.11.8
1.11.9
1.11.10
1.11.11
1.11.12
1.11.13
1.11.14
1.12
1.12.1
1.12.2
1.12.3
1.12.4
1.12.5
1.12.6
1.12.7
1.12.8
1.12.9
1.12.10
1.12.11
1.12.12
1.12.13
1.12.14
1.12.15
1.12.16
1.12.17
1.12.18
1.12.19
Partition Array by Odd and Even
Kth Largest Element
Binary Search
First Position of Target
Search Insert Position
Search for a Range
First Bad Version
Search a 2D Matrix
Search a 2D Matrix II
Find Peak Element
Search in Rotated Sorted Array
Search in Rotated Sorted Array II
Find Minimum in Rotated Sorted Array
Find Minimum in Rotated Sorted Array II
Median of two Sorted Arrays
Sqrt x
Wood Cut
Math and Bit Manipulation
Single Number
Single Number II
Single Number III
O1 Check Power of 2
Convert Integer A to Integer B
Factorial Trailing Zeroes
Unique Binary Search Trees
Update Bits
Fast Power
Hash Function
Happy Number
Count 1 in Binary
Fibonacci
A plus B Problem
Print Numbers by Recursion
Majority Number
Majority Number II
Majority Number III
Digit Counts
4

1.12.20
1.12.21
1.13
1.13.1
1.13.2
1.13.3
1.13.4
1.13.5
1.13.6
1.13.7
1.13.8
1.13.9
1.13.10
1.13.11
1.13.12
1.13.13
1.13.14
1.13.15
1.13.16
1.13.17
1.13.18
1.13.19
1.13.20
1.13.21
1.13.22
1.13.23
1.14
1.14.1
1.14.2
1.14.3
1.14.4
1.14.5
1.14.6
1.14.7
1.14.8
1.14.9
1.14.10
Ugly Number
Plus One
Linked List
Remove Duplicates from Sorted List
Remove Duplicates from Sorted List II
Remove Duplicates from Unsorted List
Partition List
Add Two Numbers
Two Lists Sum Advanced
Remove Nth Node From End of List
Linked List Cycle
Linked List Cycle II
Reverse Linked List
Reverse Linked List II
Merge Two Sorted Lists
Merge k Sorted Lists
Reorder List
Copy List with Random Pointer
Sort List
Insertion Sort List
Palindrome Linked List
Delete Node in the Middle of Singly Linked List
LRU Cache
Rotate List
Swap Nodes in Pairs
Remove Linked List Elements
Binary Tree
Binary Tree Preorder Traversal
Binary Tree Inorder Traversal
Binary Tree Postorder Traversal
Binary Tree Level Order Traversal
Binary Tree Level Order Traversal II
Maximum Depth of Binary Tree
Balanced Binary Tree
Binary Tree Maximum Path Sum
Lowest Common Ancestor
Invert Binary Tree
5