Description
Fermat's theorem states that for any prime number p and for any integer
a > 1, ap == a (mod p). That is, if we raise a to the
pth power and divide by p, the remainder is a. Some (but ...
分类：
其他好文 时间：
2015-04-03 09:33:09
阅读次数：
93
Implement wildcard pattern matching with support for '?' and '*'.
'?' Matches any single character.
'*' Matches any sequence of characters (including the empty sequence).
The matching should cove...
分类：
其他好文 时间：
2015-04-02 15:13:28
阅读次数：
111
problem:
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).
The robot can only move either down or right at any point in time. The robot is...
分类：
其他好文 时间：
2015-04-02 11:42:24
阅读次数：
188
我用git remote add origin git@github.com:michaelliao/learngit.git添加远程库时提示：fatal: Not a git repository (or any of the parent directories): .git提示说没有.git这...
分类：
其他好文 时间：
2015-04-02 01:14:24
阅读次数：
960
protected internal
The type or member can be accessed by any code in the assembly in which it is declared, or from within a derived class in another assembly. Access from another assembly must take p...
Implement regular expression matching with support for '.' and '*'.
'.' Matches any single character.
'*' Matches zero or more of the preceding element.
The matching should cover the entire input...
分类：
其他好文 时间：
2015-04-01 15:30:32
阅读次数：
153
Nim is a 2-player game featuring several piles of stones. Players alternate turns, and on his/her turn, a player’s move consists of removing one or more stones from any single pile. Play ends when all the stones have been removed, at which point the last p...
分类：
其他好文 时间：
2015-04-01 15:21:45
阅读次数：
197
Socket socketWitch = new Socket(AddressFamily.InterNetwork, SocketType.Stream, ProtocolType.Tcp); IPAddress ip = IPAddress.Any; ...
分类：
其他好文 时间：
2015-04-01 13:04:32
阅读次数：
97
转载自：http://stackoverflow.com/questions/10558465/memcached-vs-redisUpdated 10/9/2014Today marks the day that memcached no longer has any significant ad...
分类：
系统相关 时间：
2015-04-01 12:55:44
阅读次数：
227
Given a binary tree, find the maximum path sum.
The path may start and end at any node in the tree.
For example:
Given the below binary tree,
1
/ 2 3
Return 6.
i...
分类：
其他好文 时间：
2015-03-31 18:01:18
阅读次数：
119
