LeetCodeSolution
Introduction
1.
Problems
2.
Recursion
2.1.
Tree
2.1.1.
Maximum Depth of Binary Tree
2.1.2.
Minimum Depth of Binary Tree
2.2.
Array
2.2.1.
The Skyline Problem
3.
Dynamic Programming
3.1.
String
3.2.
Array
3.2.1.
Dungeon Game
3.2.2.
House Robber
3.2.3.
House Robber II
3.2.4.
Best Time to Buy and Sell Stock III
3.2.5.
Best Time to Buy and Sell Stock IV
3.2.6.
Jump Game
3.2.7.
Longest Valid Parentheses
4.
Greedy
4.1.
Jump Game II
5.
DFS
5.1.
130 Surrounded Regions
6.
Backtracing
6.1.
51 N-Queens
6.2.
52 N-Queens
7.
Other
7.1.
Largest Rectangle in Histogram
7.2.
Maximal Rectangle
7.3.
Trapping Rain Water
7.4.
Container With Most Water
7.5.
Best Time to Buy and Sell Stock
7.6.
Best Time to Buy and Sell Stock II
7.7.
Course Schedule
7.8.
Course Schedule II
7.9.
Candy
7.10.
Gas Station
Powered by
GitBook
A
A
Serif
Sans
White
Sepia
Night
Share on Twitter
Share on Google
Share on Facebook
Share on Weibo
Share on Instapaper
LeetCodeSolution
有关二叉树的问题，原问题通常可以被分解为左子树和右子树 两个子问题。