画画

由于数组中存在0，所以插入下标 < 数组长度 - 1，此时将后续的位置补0.

这些题可以用相同的思路进行解题，题目的数据结构都是数字数组，个数有限，并且数字都被数组的长度限制。先遍历把数组中的数字放到对应的位置上，然后再遍历，如果一个位置上的数字不符合预期，则能找出结果。 No.287我是用的快慢指针的方式解题的，这个题目跟寻找回路链表的交叉节点很像，只…

Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You…

Given a non-negative integer numRows, generate the first numRows of Pascal's triangle. n Pascal's triangle, each number is the sum of the t…

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the g…

Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to th…

Given a binary tree, determine if it is height-balanced. 看了几个解题的代码，都是使用了两层递归，一层递归拿子树的高度，然后判断步骤1，外层递归循环进行上述操作，这个问题可以用一层递归即可解决问题。

Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binar…