LintCodeBook
Introduction
Java
Comparator
Concepts
Objects and Classes
GUI
IO
Iterator
Synchronized
Exception
Seralization
Gabage Collection
Some Common Use
String
Interface and abstract
Inner class
Equals
Regular Expression
JDBC
Some other notes
Data Structure
Linked List
Binary Tree
Trie Tree
Queue
Stack
Deque
Heap
Set
Hash Map
TreeMap
Graph
Scan Line
Union Find
Fenwick Tree
Huffman Compression
Data Structure Implementation
Queue
Stack
Deque
Union Find
Trie
HashMap
Min Heap
String
Implement strStr()
Add Binary
Count and Say
Longest Common Prefix
Length of Last Word
Simplify Path
Group Shifted Strings
Decode Ways
Bulls and Cows
Reverse Vowels of a String
Valid Parentheses
ZigZag Conversion
Compress a String
Word Pattern
Flip Game
Flip Game II
Reverse Words in a String
Reverse Words in a String II
String Permutation
Digit Counts
Integer to Roman
Roman to Integer
Palindrome Permutation
Valid Palindrome
Shortest Palindrome
Longest Palindrome
Palindrome Pairs
Isomorphic Strings
Strobogrammatic Number
Strobogrammatic Number II
String to Integer (atoi)
Encode and Decode Strings
Group Anagrams
Longest Palindromic Substring
Integer to English Words
Unique Word Abbreviation
Generalized Abbreviation
Scramble String
Read N Characters Given Read4
Read N Characters Given Read4 II
Regular Expression Matching
Wildcard Matching
Basic Calculator
Basic Calculator II
Remove Duplicate Letters
Binary Search
Binary Search
Last Position of Target
Maximum Number in Mountain Sequence
Find K Closest Elements
Search 2D Matrix
Search 2D Matrix II
Find Peak Element
Find Minimun in Rotated Sorted Array
Find Minimun in Rotated Sorted Array II
Search in Rotated Sorted Array
Search in Rotated Sorted Array II
Closest Number in Sorted Array
Search In a Big Sorted Array
Total Occurrence of Target
First Bad Version
Search For a Range
Search Insert Position
Wood Cut
Drop Eggs
Smallest Rectangle Enclosing Black Pixels
Binary Tree
Binary Tree Paths
Maximum Depth
Minimum Depth
Invert Binary Tree
Convert Sorted Array to BST in minimum height
Subtree
Insert Node in BST
Two Sum in BST
Closest Binary Search Tree Value
Closest Binary Search Tree Value II
Closest Binary Search Tree Value III
Pre Order Traversal
In Order Traversal
Post Order Traversal
Level Order Traversal
Level Order Traversal II
Binary Tree Zigzag Level Order Traversal
Binary Tree Vertical Order Traversal
Verify Preorder Sequence in Binary Search Tree
Binary Tree Right Side
Populating Next Right Pointers in Each Node
Populating Next Right Pointers in Each Node II
Verify Preorder Serialization of a Binary Tree
Complete Binary Tree
Symmetric Binary Tree
Segment Tree Build
Segment Tree Build II
Segment Tree Query
Segment Tree Modify
Flatten Binary Tree to Linked List
Binary Tree From in and post order
Binary Tree From in and pre order
Binary Tree Path Sum
Binary Tree Path Sum II
Minimum Subtree
Binary Tree Longest Consecutive Sequence
Binary Search Tree Iterator
Lowest Common Ancestor
Lowest Common Ancestor III
Inorder Successor In BST
Balanced Binary Tree
Tweaked Identical Binary Tree
Search Range in Binary Search Tree
Validate Binary Search Tree
Largest BST Subtree
Binary Tree Maximum Path Sum II
Binary Tree Maximum Path Sum
Sum Root to Leaf Numbers
Recover Binary Search Tree
Count Univalue Subtrees
Count Complete Tree Nodes
Kth Smallest Element in a BST
Binary Tree Upside Down
Dynamic Programming
Range Sum Query - Immutable
Longest Increasing Continuous Subsequence
Triangle
Climbing Stairs
House Robber
House Robber II
House Robber III
Paint Fence
Paint House
Integer Break
Maximum Product Subarray
Minimum Path Sum
Unique Paths
Unique Paths II
Maximal Square
Jump Game
Jump Game II
Longest Increasing Subsequence
Increasing Triplet Subsequence
Palindrome Partitioning II
Word Break
Longest Common Subsequence
Longest Common Substring
Distinct Subsequences
Edit Distance
One Edit Distance
Interleaving String
Unique Binary Search Trees
Unique Binary Search Trees II
Backpack I
Backpack II
Coins In a Line I
Coins In a Line II
Coins In a Line III
Coin Change
Burst Balloons
Sort
Merge Intervals
Insert Interval
Merge Sorted Array
Merge Sorted Array II
Insertion Sort List
Sort Letters by Case
Sort Color
Sort Color II
Wiggle Sort
Wiggle Sort II
Three Sum
Three Sum Closest
Three Sum Smaller
Four Sum
Largest Number
Partition Array
Count of Smaller Numbers After Self
Count of Range Sum
Two Pointers
Move Zeroes
Kth Largetst Element
Remove Element
Remove Duplicates from Sorted Array
Remove Duplicates from Sorted Array II
Remove Duplicate Numbers in Array
Two Sum
Two Sum II
Two Sum III
Trapping Rain Water
Container With Most Water
The Smallest Difference
Minimum Size Subarray Sum
Maximum Size Subarray Sum Equals k
Longest Substring Without Repeating Characters
Minimum Window Substring
K Closest Numbers In Sorted Array
Longest Substring with At Most K Distinct Characters
Nuts Bolts Problem
Array
Shuffle an Array
Summary Ranges
Missing Ranges
Gas Station
Making New List
Rotate Array
Shortest Word Distance
Shortest Word Distance II
Shortest Word Distance III
Spiral Matrix I
Spiral Matrix II
Single Number
Single Number II
Single Number III
Majority Number
Majority Number II
Majority Number III
Product of Array Exclude Itself
Recover Rotated Sorted Array
Rotate String
Best Meeting Point
Patching Array
H-Index
H-Index-II
Maximum Subarray
Maximum Subarray II
Maximum Subarray III
Minimum Subarray
Maximum Subarray Difference
Subarray Sum
Subarray Sum Closest
Best Time to Buy and Sell Stock
Best Time to Buy and Sell Stock II
Best Time to Buy and Sell Stock III
Best Time to Buy and Sell Stock with Cooldown
Set Matrix Zeroes
Game of Life
Median of two Sorted Arrays
Find the Duplicate Number
First Missing Positive
Linkedlist
Middle of LinkedList
Delete Node in the Middle of Singly Linked List
Reverse Linked List
Reverse Linked List II
Palindrome Linked List
Partition List
Nth to Last Node in List
Remove Nth Node From End of List
Remove Linked List Elements
Remove Duplicates From Sorted List
Remove Duplicates From Sorted List II
Remove Duplicates From UnSorted List
Linked List Cycle
Linked List Cycle II
Swap Nodes in Pairs
Intersection of Two Linked Lists
Merge Two Sorted Lists
Merge K Sorted Lists
Sort List
Insertion Sort List
Reorder List
Add Two Numbers
Rotate List
Reorder List
Copy List With Random Pointer
Convert Sorted List to Binary Search Tree
Convert Binary Search Tree to Doubly Linked List
Data Structure Problem
K Closest Points
Contains Duplicate
Contains Duplicate II
Contains Duplicate III
Valid Parentheses
Implement Queue By Two Stacks
Implement Queue By LinkedList
Implement Queue By LinkedList II
Implement Stack
Implement Stack by Two Queues
Implement Trie
Insert Delete GetRandom
Insert Delete GetRandom-II
Stack Sorting
Heapify
Merge k Sorted Arrays
Hash Function
Rehashing
Min Stack
Flatten 2D Vector
Zigzag Iterator
Flatten Nested List Iterator
Peeking Iterator
Ugly Number
Top K Frequent Words
Moving Average from Data Stream
Meeting Rooms
Meeting Rooms II
Longest Consecutive Sequence
Largest Rectangle in Histogram
Remove Duplicate Letters
Create Maximum Number
LRU Cache
Max Tree
Union Find: Find the Weak Connected Component
Add and Search Word
Range Sum Query
Range Sum Query 2D Immutable
Range Sum Query 2D Mutable
Sliding Window Maximum
Find Median from Data Stream
Sliding Window Median
Trapping Rain Water II
Building Outline
DFS
Split String
K Sum II
Combinations
Combination Sum
Combination Sum II
Combination Sum III
Factor Combinations
Subsets I
Subsets II
Permutations I
Permutations Index
Permutations II
Palindrome-Permutation
Palindrome-Permutation-II
Next Permutations II
String Permutation II
Permutations Sequence
Number of Islands
Number of Islands II
Word Pattern
Word Pattern II
Word Search
Word Search II
Word Break II
Word Ladder II
Letter Combinations of a Phone Number
N Queen I
N Queen II
Palindrome Partitioning
Restore IP Addresses
Generate Parentheses
Reconstruct Itinerary
Expression Add Operators
Wildcard Matching
Memorization
Longest Increasing Path in a Matrix
Stone Game
BFS
Route Between Two Nodes in Graph
Clone Graph
Find the Connected Component in the Undirected Graph
Number of Connected Components in an Undirected Graph
Walls and Gates
Shortest Distance from All Buildings
Topological Sorting
Course Schedule
Course Schedule II
Serialize and Deserialize Binary Tree
Alien Dictionary
Minimum Height Trees
Mystical Lexical Order
Word Ladder
Graph Valid Tree
Surrounded Regions
Math
Hexadecimal to Decimal
Any to Decimal
Divide Two Integers
Add Two Array
Palindrome Number
Fraction to Recurring Decimal
Nested List Weight Sum
Add Digits
Much Larger Numbers
Valid Sudoku
Sudoku Solver
Happy Number
Cosine Similarity
Sqrt
Pow
Multiply Strings
Prime Factorization
Reverse Integer
Power of Three
Power of Four
Fibonacci
Plus One
Trailing Zeros
Fast Power
Bulb Switcher
Self Crossing
Sparse Matrix
Perfect Squares
Find the Celebrity
Bits Manipulation
Reverse Bits
Number of 1 Bits
Counting Bits
Bitwise AND of Numbers Range
Gray Code
A + B Problem
Missing Number
Maximum Product of Word Lengths
OO Design
Singleton
Rotate Image
Dog Lab
Google
Plus One
Summary Ranges
Missing Ranges
Number of Islands
Number of Islands II
Unique Word Abbreviation
Generalized Abbreviation
Perfect Squares
Word Break
Building Outline
Binary Tree Longest Consecutive Sequence
Merge Intervals
Valid Parentheses
Find Median from Data Stream
Game of Life
Zigzag Iterator
Median of two Sorted Arrays
Regular Expression Matching
Wildcard Matching
Kth Smallest Element in a BST
Binary Search Tree Iterator
Min Stack
Insert Interval
Three Sum Smaller
Merge K Sorted Lists
Basic Calculator
Basic Calculator II
Generate Parentheses
Meeting Rooms
Meeting Rooms II
Search 2D Matrix
Search 2D Matrix II
Alien Dictionary
Longest Increasing Path in a Matrix
Longest Substring with At Most K Distinct Characters
Wiggle Sort
Wiggle Sort II
Maximum Product of Word Lengths
Closest Binary Search Tree Value
Closest Binary Search Tree Value II
Strobogrammatic Number
Strobogrammatic Number II
Trie
Count of Smaller Numbers After Self
Count of Range Sum
Expression Add Operators
Read N Characters Given Read4
Read N Characters Given Read4 II
Shortest Palindrome
Paint Fence
Flatten Nested List Iterator
Verify Preorder Serialization of a Binary Tree
Binary Tree Paths
Flatten 2D Vector
Power of Three
Remove Duplicate Letters
Flip Game
Flip Game II
Group Shifted Strings
Patching Array
Palindrome Permutation
Palindrome Pairs
Fraction to Recurring Decimal
Ugly Number
Graph Valid Tree
Implement Trie
Minimum Height Trees
Encode and Decode Strings
H-Index
H-Index-II
Find Peak Element
Peeking Iterator
Other Information
Company Level
Powered by
GitBook
Memorization
关键
要先思考清楚递归的定义
如何变到更小的问题
考虑递归中的限制条件
考虑最终出递归的条件(什么时候return)
应用
找所有方案
时间复杂度
方案数 * 构造方案的代价
分类
显示图搜索 eg: matrix, graph
隐式图搜索 eg: subsets permutations
results matching "
"
No results matching "
"