Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) You have
分类：
其他好文 时间：
2016-03-20 14:41:10
阅读次数：
169
Calculate the a^n % b where a, b and n are all 32bit integers. For 2^31 % 3 = 2 For 100^1000 % 1000 = 0 这道题有个值得注意的问题，当n为奇数的时候，如果把递归写成： long num = fast
分类：
其他好文 时间：
2016-03-20 14:40:17
阅读次数：
128
Divide two integers without using multiplication, division and mod operator. If it is overflow, return 2147483647 Given dividend = 100 and divisor = 9
分类：
其他好文 时间：
2016-03-20 14:27:14
阅读次数：
173
Evaluate the value of an arithmetic expression inReverse Polish Notation. Valid operators are +, -, *, /. Each operand may be an integer or another ex
分类：
其他好文 时间：
2016-03-20 14:21:01
阅读次数：
135
Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new string which is formed from t
分类：
其他好文 时间：
2016-03-20 08:09:33
阅读次数：
194
Given string A representative a positive integer which has N digits, remove any k digits of the number, the remaining digits are arranged according to
分类：
其他好文 时间：
2016-03-18 13:29:04
阅读次数：
177
Count the number of k's between 0 and n. k can be 0 - 9. if n=12, k=1 in [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12], we have FIVE 1's(1, 10, 11, 12)
分类：
其他好文 时间：
2016-03-18 13:24:35
阅读次数：
156
转自：http://www.cnblogs.com/luochengqiuse/p/4678020.html?utm_source=tuicool&utm_medium=referral 最近的项目中用到了mq，之前自己一直在码农一样的照葫芦画瓢。最近几天研究了下，把自己所有看下来的文档和了解总结一
分类：
编程语言 时间：
2016-03-18 01:40:15
阅读次数：
385
A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy
分类：
其他好文 时间：
2016-03-16 14:03:12
阅读次数：
161
Given an integer array, find a continuous subarray where the sum of numbers is the biggest. Your code should return the index of the first number and
分类：
其他好文 时间：
2016-03-16 13:57:57
阅读次数：
172
