Description
Given a binary tree, return the inorder traversal of its nodes' values.
Example:
Input: [1,null,2,3] 1 \ 2 / 3 Output: [1,3,2]Follow up: Recursive solution is trivial, could you do it iteratively?
Description
Given a 2D binary matrix filled with 0’s and 1’s, find the largest rectangle containing only 1’s and return its area.
Example:
Input:
[
["1","0","1","0","0"],
["1","0","1","1","1"],
["1","1","1","1","1"],
["1","0","0","1","0"]
]
Output: 6
在给出的矩阵中，1表示元素，0表示空，找出最大矩形的面积。
Description
Largest Rectangle in Histogram
Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.
Above is a histogram where width of each bar is
1, given height =[2,1,5,6,2,3].
The largest rectangle is shown in the shaded area, which has area =
10unit.
给出一个直方图，求最大矩形面积。
Description
Given a string containing just the characters
'(',')','{','}','['and']', determine if the input string is valid. The brackets must close in the correct order,"()"and"()[]{}"are all valid but"(]"and"([)]"are not.
给出包含三种括号的字符串，验证括号是否左右匹配
Description
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how >much water it is able to trap after raining.
For example, Given
[0,1,0,2,1,0,1,3,2,1,2,1], return6.
The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. Thanks Marcos for contributing this image!
