题目：Palindrome Pairs Given a list of unique words, find all pairs of distinct indices (i, j) in the given list, so that the concatenation of the two wo ...
分类：
其他好文 时间：
2017-08-10 23:36:23
阅读次数：
162
Rikka with Graph Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 425 Accepted Submission(s): 270 ...
分类：
其他好文 时间：
2017-08-09 12:49:15
阅读次数：
162
Max Sum Plus Plus Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30478 Accepted Submission(s): 1 ...
分类：
其他好文 时间：
2017-08-08 00:29:20
阅读次数：
142
You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing way. The null node needs to be rep ...
分类：
其他好文 时间：
2017-08-07 20:33:41
阅读次数：
142
The inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i < j and ai > aj. For a given sequence o ...
分类：
编程语言 时间：
2017-08-05 18:50:31
阅读次数：
244
DNA Pairing DNA 链缺少配对的碱基。依据每一个碱基，为其找到配对的碱基，然后将结果作为第二个数组返回。 Base pairs（碱基对） 是一对 AT 和 CG，为给定的字母匹配缺失的碱基。 在每一个数组中将给定的字母作为第一个碱基返回。 例如，对于输入的 GCG，相应地返回 [["G" ...
分类：
编程语言 时间：
2017-08-02 21:06:22
阅读次数：
172
Truck History Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 28675 Accepted: 11187 Description Advanced Cargo Movement, Ltd. uses trucks o ...
分类：
其他好文 时间：
2017-08-02 13:21:22
阅读次数：
134
Problem Description KazaQ wears socks everyday.At the beginning, he has n pairs of socks numbered from 1 to n in his closets. Every morning, he puts o ...
分类：
其他好文 时间：
2017-07-31 12:35:25
阅读次数：
123
Description KazaQ wears socks everyday. At the beginning, he has nn pairs of socks numbered from 11 to nn in his closets. Every morning, he puts on a ...
分类：
其他好文 时间：
2017-07-30 20:29:59
阅读次数：
170
Surprising Strings Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7225 Accepted: 4663 Description The D-pairs of a string of letters are t ...
分类：
其他好文 时间：
2017-07-29 20:25:32
阅读次数：
129
