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 is at...
分类：
其他好文 时间：
2015-02-09 15:25:20
阅读次数：
107
The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integernrepresenting the total number...
分类：
其他好文 时间：
2015-02-09 15:22:50
阅读次数：
115
Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that positio...
分类：
其他好文 时间：
2015-02-09 14:15:47
阅读次数：
157
题目链接：Trapping Rain Water
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 ...
分类：
移动开发 时间：
2015-02-09 00:48:49
阅读次数：
207
1 题目Given a list of non negative integers, arrange them such that they form the largest number.For example, given[3, 30, 34, 5, 9], the largest formed...
分类：
其他好文 时间：
2015-02-09 00:43:28
阅读次数：
173
Given a list of non negative integers, arrange them such that they form the largest number.For example, given[3, 30, 34, 5, 9], the largest formed num...
分类：
其他好文 时间：
2015-02-09 00:37:33
阅读次数：
218
Sum of Digits is PrimeDaoyi PengAugust 19, 2014For an integer $q\geqslant2$ let $s_q(n)$ denote the $q$-ary sum-of-digits function of a non-negative i...
分类：
其他好文 时间：
2015-02-08 00:14:19
阅读次数：
182
题目要求：Jump Game IIGiven an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array repre...
分类：
其他好文 时间：
2015-02-07 21:37:00
阅读次数：
179
题目要求：Trapping Rain WaterGivennnon-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able ...
分类：
移动开发 时间：
2015-02-07 21:33:12
阅读次数：
145
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximu...
分类：
其他好文 时间：
2015-02-07 20:16:49
阅读次数：
123
