Largest Rectangle in Histogram
Total Accepted: 61747 Total
Submissions: 252559 Difficulty: Hard
Given n non-negative integers representing the histogram's bar height where th...
分类：
其他好文 时间：
2016-06-16 14:54:18
阅读次数：
138
1. 问题描述 Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant di ...
分类：
其他好文 时间：
2016-06-15 23:36:02
阅读次数：
121
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. For example: Given num = 38, the process is like: ...
分类：
其他好文 时间：
2016-06-15 15:51:38
阅读次数：
107
题目： Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two e ...
分类：
其他好文 时间：
2016-06-14 13:43:50
阅读次数：
146
题目： Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit ...
分类：
其他好文 时间：
2016-06-14 08:51:28
阅读次数：
116
Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n. Example: Given n = 2, return 91. (The answer should be the ...
分类：
其他好文 时间：
2016-06-14 06:25:21
阅读次数：
241
题目描述： Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two ...
分类：
其他好文 时间：
2016-06-14 06:19:00
阅读次数：
150
题目描述： Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n. 解题分析： 题目要就就是找出 0≤ x < 10n中各位数字都不相同的数的个数。要接触这道题只需要理解： ...
分类：
其他好文 时间：
2016-06-13 20:38:41
阅读次数：
271
Container With Most Water
Total Accepted: 80614 Total
Submissions: 230716 Difficulty: Medium
Given n non-negative integers a1, a2,
..., an, where each represents a point at...
分类：
其他好文 时间：
2016-06-12 02:44:00
阅读次数：
163
题目链接：https://leetcode.com/problems/add-digits/
题目：
Given a non-negative integer num, repeatedly add all its digits until the result has only
one digit.
For example:
Given num = 38, the p...
分类：
其他好文 时间：
2016-06-12 02:43:27
阅读次数：
135
