Description
Let A1, A2, ... , AN be N elements. You need to deal with two kinds of operations. One type of operation is to add a given number to a few numbers in a given interval. The other is to q...
分类：
编程语言 时间：
2014-10-18 16:59:56
阅读次数：
321
The Other Two Trees另两棵树没看懂题目，搜了下题解，都是直接给出了简化后的题意和解法...自己再读读原题意吧
分类：
编程语言 时间：
2014-10-18 12:34:19
阅读次数：
222
Two Famous CompaniesTime Limit: 15000msMemory Limit: 32768KBThis problem will be judged onHDU. Original ID:425364-bit integer IO format:%I64d Java cla...
分类：
其他好文 时间：
2014-10-18 12:23:16
阅读次数：
175
题目描述：Given two binary strings, return their sum (also a binary string).For example,a ="11"b ="1"Return"100".解题方案： 1 class Solution { 2 public: 3 s...
分类：
其他好文 时间：
2014-10-18 10:56:14
阅读次数：
160
4Clojure上的一道题：[4Clojure 最长上升子序列算法][1] 描述如下： > Given a vector of integers, find the longest consecutive sub-sequence of increasing numbers. If two sub-sequences have the same le...
分类：
编程语言 时间：
2014-10-18 09:55:22
阅读次数：
259
Binary String Matching
时间限制：3000 ms | 内存限制：65535 KB
难度：3
描述Given two strings A and B, whose alphabet consist only ‘0’ and ‘1’. Your task is only to tell how many times does A appear as ...
分类：
编程语言 时间：
2014-10-18 09:50:53
阅读次数：
238
Then-queens puzzle is the problem of placingnqueens on ann×nchessboard such that no two queens attack each other.Given an integern, return all distinc...
分类：
其他好文 时间：
2014-10-18 07:33:43
阅读次数：
263
Problem Description
To prove two sets A and B are equivalent, we can first prove A is a subset of B, and then prove B is a subset of A, so finally we got that these two sets are equivalent.
You ar...
分类：
其他好文 时间：
2014-10-18 03:05:05
阅读次数：
290
Binary String Matching
时间限制：3000 ms | 内存限制：65535 KB
难度：3
描述Given two strings A and B, whose alphabet consist only ‘0’ and ‘1’. Your task is only to tell how many times does A appear as ...
分类：
编程语言 时间：
2014-10-17 23:28:22
阅读次数：
391
Dict创建somedict = {}somedict = {"key": value}a = dict(one=1, two=2, three=3)c = dict(zip(['one', 'two', 'three'], [1, 2, 3]))d = dict([('two', 2), ('on...
分类：
编程语言 时间：
2014-10-17 23:15:55
阅读次数：
195
