int a= 10 ; printf("a = %d\n", a); char number = 'H'; printf("number = %c\n", number); //打印字符对应的 ASCII值（十进制） printf("number = %d\n", number); sh...
分类：
其他好文 时间：
2015-01-13 23:13:38
阅读次数：
215
Largest NumberGiven a list of non negative integers, arrange them such that they form the largest number.For example, given[3, 30, 34, 5, 9], the larg...
分类：
其他好文 时间：
2015-01-13 23:04:26
阅读次数：
307
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
For example, given the array [?2,1,?3,4,?1,2,1,?5,4],
the contiguous subarray [4,?1,2,1] ha...
分类：
其他好文 时间：
2015-01-13 21:46:20
阅读次数：
181
题目要求：
The string "PAYPALISHIRING" is written in a zigzag pattern on a given
number of rows like this: (you may want to display this pattern in a fixed font for better legibility)
P A H N
A...
分类：
其他好文 时间：
2015-01-13 19:57:52
阅读次数：
141
这大家可以这么想
一共有50瓶，
喝完三瓶 + 1
喝完三瓶 + 1
那么 50 - 3 + 1 -3 + 1
以此类推知道。。。最后剩余的可乐数小于3退出。那么依旧题意可以写出。
package cccc;
public class Buy {
public static void main(String[] args) {
int number = 50; /...
分类：
其他好文 时间：
2015-01-13 19:50:47
阅读次数：
795
Givennpoints on a 2D plane, find the maximum number of points that lie on the same straight line.两层循环，将在同一直线上的点放入hash table，找到hash table中的最大值。 1 int m...
分类：
其他好文 时间：
2015-01-13 19:36:55
阅读次数：
95
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 the code, print the sequence of ...
分类：
其他好文 时间：
2015-01-13 17:45:19
阅读次数：
140
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-01-13 17:36:57
阅读次数：
97
【题目】
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 number is 9534330.
Note: The result...
分类：
其他好文 时间：
2015-01-13 16:04:41
阅读次数：
147
Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.
Calling next() will
return the next smallest number in the BST.
Note: next() a...
分类：
编程语言 时间：
2015-01-13 14:25:39
阅读次数：
240
