DescriptionYour task is to calculate the sum of
some integers.InputInput contains an integer N in the first line, and then N
lines follow. Each line s...
分类:
其他好文 时间:
2014-05-23 06:41:47
阅读次数:
298
Determine whether an integer is a palindrome.
Do this without extra space.if use recursive, like check the first dig and last
dig, then remove them, c...
分类:
其他好文 时间:
2014-05-23 02:45:15
阅读次数:
230
马上要去比赛了。
今天做了一下2014北京邀请赛,出了两道题目,感觉很水啊、、、
首先H题:
H. Happy Reversal
Time Limit: 1000ms
Case Time Limit: 1000ms
Memory Limit: 65536KB
64-bit integer IO format: %lld Java class name...
分类:
其他好文 时间:
2014-05-22 23:07:32
阅读次数:
417
Jimmy writes down the decimal representations of all natural numbers between and including m and n, (m ≤ n). How many zeroes will he write down?
Input
Input starts with an integer T (≤ 11000), denot...
分类:
其他好文 时间:
2014-05-22 22:59:18
阅读次数:
354
Reverse digits of an integer.Example1:x = 123,
return 321Example2:x = -123, return -321 1 class Solution { 2 public: 3 int
reverse(int x) { 4 ...
分类:
其他好文 时间:
2014-05-22 16:26:23
阅读次数:
165
SQLite可以解析大部分的标准SQL语句:建表语句:create table 表名(主键名
integer primary key autoincrement(设置为自增列),其他列名及属性)或(主键名 integer primary key
)SQLite数据库中将所有声明为“integer p...
分类:
移动开发 时间:
2014-05-22 15:44:31
阅读次数:
380
Evaluate the value of an arithmetic expression
inReverse Polish Notation.Valid operators are+,-,*,/. Each operand may be an
integer or another express...
分类:
其他好文 时间:
2014-05-22 15:28:54
阅读次数:
175
【题目】
Given an unsorted integer array, find the first missing positive integer.
For example,
Given [1,2,0] return 3,
and [3,4,-1,1] return 2.
Your algorithm should run in O(n) time and uses constant space.
【题意】
给定一个数组,找出第一个缺失的正数。时间复杂度O(n)
...
分类:
其他好文 时间:
2014-05-21 17:13:07
阅读次数:
219
【题目】
The count-and-say sequence is the sequence of integers beginning as follows:
1, 11, 21, 1211, 111221, ...
1 is read off as "one 1" or 11.
11 is read off as "two 1s" or 21.
21 is read off as "one 2, then one 1" or 1211.
Given an integer n, generate...
分类:
其他好文 时间:
2014-05-21 15:20:07
阅读次数:
213
Description
In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn ? 1 + Fn ? 2 for n ≥ 2. For example, the first ten terms of
the Fibonacci sequence are:
0, 1, 1, 2, 3, 5, 8, 13, 21, ...
分类:
其他好文 时间:
2014-05-21 09:39:15
阅读次数:
231