画画

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

这些题可以用相同的思路进行解题，题目的数据结构都是数字数组，个数有限，并且数字都被数组的长度限制。先遍历把数组中的数字放到对应的位置上，然后再遍历，如果一个位置上的数字不符...

Say you have an array for which the ith element is the price of a given stock on day i...

Given a non-negative integer numRows, generate the first numRows of Pascal's triangle....

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that...

Given a binary tree, find its minimum depth. The minimum depth is the number of nodes ...

Given a binary tree, determine if it is height-balanced. 看了几个解题的代码，都是使用了两层递归，一层递归拿子树的高...

Given an array where elements are sorted in ascending order, convert it to a height ba...

Given a binary tree, return the bottom-up level order traversal of its nodes' values. ...

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted ...

Given a triangle, find the minimum path sum from top to bottom. Each step you may move...

... Given a non-empty string containing only digits, determine the total number of way...

Given a string s, find the longest palindromic substring in s. You may assume that the...

You are climbing a stair case. It takes n steps to reach to the top. Each time you can...

1 is read off as "one 1" or 11. 11 is read off as "two 1s" or 21. 21 is read off as "o...

Given two non-negative integers num1 and num2 represented as string, return the sum of...

4.利用该栈不断新生成结果节点。 然而，在No.1561 case中，是传入两个超长链表（也就是说是两个超大数字相加），大家都知道js的数字精度在两个超大数字相加是极容易丢...