You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single ...
分类：
其他好文 时间：
2015-04-21 22:22:16
阅读次数：
128
Givennnon-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histog...
分类：
其他好文 时间：
2015-04-21 22:06:27
阅读次数：
155
【题目】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 ma...
分类：
其他好文 时间：
2015-04-21 20:35:09
阅读次数：
108
Palindrome NumberDetermine whether an integer is a palindrome. Do this without extra space.Some hints:Could negative integers be palindromes? (ie, -1)...
分类：
其他好文 时间：
2015-04-21 20:22:35
阅读次数：
130
【题目】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 ma...
分类：
其他好文 时间：
2015-04-21 20:10:33
阅读次数：
117
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-04-21 17:55:03
阅读次数：
104
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-04-20 20:46:31
阅读次数：
113
先上实例: ????????System.out.println(Math.pow(1d,?0)?+?"?If?the?second?argument?is?positive?or?negative?zero,?then?the?result?is?1.0.");
????????System.out.println(...
分类：
编程语言 时间：
2015-04-20 19:27:33
阅读次数：
240
一：Leetcode 89 Gray Code
题目：The gray code is a binary numeral system where two successive values differ in only one bit.
Given a non-negative integer n representing the total number of bits in ...
分类：
其他好文 时间：
2015-04-20 17:10:42
阅读次数：
148
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]...
分类：
移动开发 时间：
2015-04-20 09:23:52
阅读次数：
238
