Problem DescriptionGiven three strings, you are to determine whether the third string can be formed by combining the characters in the first two strin...
分类：
其他好文 时间：
2014-08-18 17:46:52
阅读次数：
244
①原题 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)). ②乡村英语翻译一下 给你两个...
分类：
其他好文 时间：
2014-08-18 16:40:32
阅读次数：
155
Problem Description
Teacher Mai finds that many problems about arithmetic function can be reduced to the following problem:
Maintain an array a with index from 1 to l. There are two kinds of ope...
分类：
其他好文 时间：
2014-08-18 16:26:42
阅读次数：
248
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.)...
分类：
其他好文 时间：
2014-08-18 16:21:57
阅读次数：
148
Berserk RookAs you may know,chessis an ancient game for which almost everyone has at least a basic understanding of the rules. Chess is a two-player s...
分类：
其他好文 时间：
2014-08-18 15:45:02
阅读次数：
179
3231 - Fair ShareAsia - Seoul - 2004/2005You are given N processors and M jobs to be processed. Two processors are specified to each job. To processth...
分类：
其他好文 时间：
2014-08-18 14:14:32
阅读次数：
278
Given two binary strings, return their sum (also a binary string).For example,a ="11"b ="1"Return"100".分析：该题需要注意的地方：1）两个string的长度可能不同 2）近位借鉴leetcode-c...
分类：
其他好文 时间：
2014-08-18 14:13:42
阅读次数：
167
Problem You receive a credit C at a local store and would like to buy two items. You first walk through the store and create a list L of all available items. From this list you would like to buy tw...
分类：
其他好文 时间：
2014-08-18 12:42:04
阅读次数：
222
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 t...
分类：
其他好文 时间：
2014-08-18 12:20:34
阅读次数：
148
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other....
分类：
其他好文 时间：
2014-08-18 10:51:34
阅读次数：
121
