algorithms
Introduction
Dynamic Programming
坐标型
Unique Paths
Unique Paths II
Jump Game
Maximal Square
memorization
Longest Increasing Continuous subsequence II
接龙型(隐含的坐标型)
Longest Increasing Subsequence
Perfect Square
Largest Divisible Subset
单序列型
Word Break
Partitioning Palindrome II
House Robber
House Robber II
双序列型
Longest Common Subsequence
Edit Distance
Distinct Subsequences
Interleaving String
博弈型
Coins in a Line
Coins in a Line II
区间型
Coins in a Line III
Stone Game
Burst Balloons
背包型
0/1背包
Backpack
Backpack II
k sum
无限背包
backpack IV
backpack III
Minimum Adjustment Cost
Coin Change
Arrays
Subarray
Subarray Sum
Submatrix Sum
Subarray Sum II
Subarray Sum Closest
Continuous Subarray Sum
Continuous Subarray Sum II
Maximum Subarray
Maximum Subarray II
Minimum Subarray
Window Sum
Contiguous Array
Best Time to Buy and Sell Stock
I
II
III
Sorted Array
Merge Two Sorted Arrays
Merge Sorted Array
Intersection of Two Arrays
Median of Two Sorted Arrays
Wiggle Sort
Recover Rotated Sorted Array
Container With Most Water
Iterator
Flatten Nested List Iterator
Flatten 2D Vector
Binary Search Tree Iterator
List
Flatten List
LinkedList
Remove Duplicates from Sorted List
Remove Duplicates from Sorted List II
Remove Nth Node From End of List
Reverse Linked List
Reverse Linked List II
Linked List Cycle
Linked List Cycle II
Remove Nth Node From End of List
Rotate List
Sort List
Partition List
Reorder List
Merge k Sorted Lists
Merge Two Sorted Lists
Copy List with Random Pointer
Convert Sorted List to Balanced BST
Delete Node in the Middle of Singly Linked List
Convert Binary Search Tree to Doubly Linked List
Reverse Nodes in k-Group
Swap Two Nodes in Linked List
Binary Tree
Binary Tree Inorder Traversal
Binary Tree Preorder Traversal
Binary Tree Postorder Traversal
Maximum Depth of Binary Tree
Binary Tree Paths
Minimum Subtree
Balanced Binary Tree
Subtree with Maximum Average
Flatten Binary Tree to Linked List
Lowest Common Ancestor
Lowest Common Ancestor III
Lowest Common Ancestor II
Binary Tree Longest Consecutive Sequence
Binary Tree Longest Consecutive Sequence II
Binary Tree Path Sum
Binary Tree Path Sum II
Path Sum
Path Sum II
Path Sum III
Binary Tree Maximum Path Sum
Binary Tree Right Side View
Binary Tree Top Side View
Diameter of Binary Tree
Symmetric Tree
Populating Next Right Pointers in Each Node
House Robber III
Construct Binary Tree from Inorder and Postorder Traversal
Sum Root to Leaf Numbers
Find Leaves of Binary Tree
Subtree of Another Tree
Sum Of Left Leaves
Binary Search Tree
Validate Binary Search Tree
Inorder Successor in Binary Search Tree
Search Range in Binary Search Tree
Insert Node in a Binary Search Tree
Delete Node in a BST
Closest Binary Search Tree Value
Kth Smallest Element in a BST
Verify Preorder Sequence in Binary Search Tree
Depth First Search
Subsets
Subsets II
Combination Sum
Combination Sum II
Combination Sum III
Palindrome Partitioning
Permutation
Permutation II
N-Queens
Word Ladder
Expression Expand
String Permutation II
Longest Increasing Path in a Matrix
Friend Circles
Pacific Atlantic Water Flow
Max Area of Island
Target Sum
Shopping Offers
Minesweeper
Number of Distinct Islands
Matchsticks to Square
Out of Boundary Paths
Nested List Weight Sum II
The Maze
The Maze II
Graph
Number of Connected Components in an Undirected Graph
Accounts Merge
Binary Watch
Flip Game II
Palindrome Permutation II
Factor Combinations
Sliding Window
Longest Substring with At Most Two Distinct Characters
Minimum Window Substring
Longest Substring Without Repeating Characters
Substring with Concatenation of All Words
Find All Anagrams in a String
Minimum Size Subarray Sum
Breadth First Search
二叉树
Binary Tree Level Order Traversal
Binary Tree Level Order Traversal II
Binary Tree Serialization
Convert Binary Tree to Linked Lists by Depth
Binary Tree Zigzag Level Order Traversal
图
Graph Valid Tree
Clone Graph
Search Graph Nodes
Connected Component in Undirected Graph
拓扑排序
Topological Sorting
Course Schedule
Course Schedule II
Sequence Reconstruction
矩阵
Number of Islands
Zombie in Matrix
Knight Shortest Path
Build Post Office II
01Matrix
The Maze
The Maze II
Word Ladder
Binary Search
模板
First Position of Target
Last Position of Target
First Bad Version
Search in a Big Sorted Array
Search Insert Position
Search in 2D Matrix
Find Minimum in Rotated Sorted Array
Find Minimum in Rotated Sorted Array II
Search in Rotated Sorted Array
Search in Rotated Sorted Array II
Sqrt(x)
Search for a Range
Maximum Number in Mountain Sequence
Find Peak Element
Wood Cut
Find Peak Element II
Find The Duplicate Number
Maximum Average Subarray
Data structure
Stack
Expression Expand
Min Stack
Largest Rectangle in Histogram
Maximal Rectangle
Implement Stack by Two Queues
Implement Queue by Two Stacks
Hash table
Rehashing
LRU Cache
Anagrams
Longest Consecutive Sequence
Subarray Sum
Roman to Integer
Heap
Ugly Number II
Top k Largest Numbers
Top k Largest Numbers II
High Five
K Closest Points
Kth Smallest Number in Sorted Matrix
Merge k Sorted Arrays
Top K Frequent Words
Kth Largest Element in an Array
Kth Largest in N Arrays
Kth Smallest Sum In Two Sorted Arrays
Data Stream Median
Sliding Window Median
TreeSet
Trapping Rain Water
Deque
Sliding Window Maximum
Quick Select
bit
Sum of Two Integers
Majority Element
Sweep Line
Number of Airplanes in the Sky
UnionFind
Friend Circles
Accounts Merge
易错
杂七杂八
Add Strings
Data Structure for Java, Python and Scala
Java
Python
Scala
Powered by
GitBook
Dynamic Programming
时间复杂度计算
O(subproblems * time to solve subproblems)
状态设计原则:缺什么补什么, 1维表示不了变2维
results matching "
"
No results matching "
"
