Designing a Class Interface
设计类接口
The Objective-C syntax for creating a class is very simple. It typically comes in two parts.
创建类的语法是很简单的，通常包括两部分。
The class interface is u...
分类：
其他好文 时间：
2014-07-08 16:24:27
阅读次数：
168
Given n non-negative integers a1, a2,
..., an, where each represents a point at coordinate (i, ai). n vertical
lines are drawn such that the two endpoints of line i is at (i, ai) and (i,
0). Fin...
分类：
其他好文 时间：
2014-07-08 14:21:56
阅读次数：
190
The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains two or more digits, those digits are summed and the process ...
分类：
其他好文 时间：
2014-07-08 14:12:32
阅读次数：
226
Implement an algorithm to find the kth to last element of a singly linked list.Classical "Runner" Technique of linkedlist/*Use two pointers, forward o...
分类：
其他好文 时间：
2014-07-08 00:37:17
阅读次数：
315
SharePoint Tips about Permissions: What you need to knowI have been writing tips about SharePoint from last two years now. After a great popularity an...
分类：
其他好文 时间：
2014-07-08 00:36:33
阅读次数：
262
题目：
* 将 电话号码 one two 。。。nine zero 翻译成1 2 。。9 0
*
* 中间会有double
*
* 例如
* 输入：OneTwoThree
* 输出：123
* 输入：OneTwoDoubleTwo
* 输出：1222
* 输入：1Two2
* 输出：ERRO...
分类：
其他好文 时间：
2014-07-06 09:24:44
阅读次数：
229
;; Fermat's Little Theorem:
;; If N is a prime number and A is any positive integer less
;; than N, then A raised to the N-th power is congruent to A modulo N
;; Two numbers are said to be congruent...
分类：
其他好文 时间：
2014-07-06 09:05:22
阅读次数：
158
Power Strings
Time Limit: 3000MS
Memory Limit: 65536K
Total Submissions: 31093
Accepted: 12974
Description
Given two strings a and b we define a*b to be their concate...
分类：
其他好文 时间：
2014-07-06 00:33:22
阅读次数：
253
Euclid's Game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1880 Accepted Submission(s): 825
Problem Description
Two players, Stan...
分类：
其他好文 时间：
2014-07-06 00:02:49
阅读次数：
253
There are two sorted arrays A and B of size m and n respectively.
Find the median of the two sorted arrays.
The overall run time complexity should be O(log (m+n)).
有两个已排序的数组A和B，大小为m 和 n。
找出两数组的中...
分类：
其他好文 时间：
2014-07-05 22:54:17
阅读次数：
244
