problem：
Given an array of integers, every element appears twice except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement ...
分类：
其他好文 时间：
2015-04-29 17:09:50
阅读次数：
112
In Keil C, it is necessary to implement char putchar(char c), or the powerful function printf would not work.
We should notice in here : new line command for serial output be "\r\n" (line feed:LF,...
分类：
其他好文 时间：
2015-04-29 07:18:43
阅读次数：
128
Next Permutation
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.
If such arrangement is not possible, it must rearrange it ...
分类：
其他好文 时间：
2015-04-28 22:50:49
阅读次数：
222
Implement regular expression matching with support for'.'and'*'.'.' Matches any single character.'*' Matches zero or more of the preceding element.The...
分类：
其他好文 时间：
2015-04-28 01:34:19
阅读次数：
127
Wednesday, 9 February 201102:03 AMIf you look at the ASP.NET Web Pages (aka Razor) tutorials on the ASP.NET web site, there's achapterdevoted to addin...
分类：
Web程序 时间：
2015-04-27 21:22:47
阅读次数：
197
题目：
Implement atoi to convert a string to an integer.
Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible...
分类：
其他好文 时间：
2015-04-27 18:30:50
阅读次数：
137
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possibl...
分类：
其他好文 时间：
2015-04-27 15:07:57
阅读次数：
114
Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below a...
分类：
其他好文 时间：
2015-04-27 08:13:22
阅读次数：
125
题目描述Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get the value (will always be positive) of the key if t...
分类：
系统相关 时间：
2015-04-26 12:26:48
阅读次数：
133
Implement pow(x, n).
这道题要求完成pow()，即求出x的n次方的结果。二分法，注意n<0的情况。
1. 若n = 0，二分递归求解。例如，求2^5，可以先算2^2=4，2^2=4，然后4*4 = 16，最后16*2=32.double power(double x, int n){...
分类：
其他好文 时间：
2015-04-26 10:56:38
阅读次数：
111
