Problem DescriptionGiven two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 2 #include 3 using namespace std; 4 .....
分类：
其他好文 时间：
2014-07-23 12:27:06
阅读次数：
252
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two nu...
分类：
其他好文 时间：
2014-07-23 12:03:26
阅读次数：
287
题目： Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 题解：....
分类：
编程语言 时间：
2014-07-23 12:01:36
阅读次数：
257
题目：Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.http....
分类：
编程语言 时间：
2014-07-23 12:01:06
阅读次数：
330
题目：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 ...
分类：
编程语言 时间：
2014-07-23 11:49:36
阅读次数：
357
DescriptionYou haveNintegers,A1,A2, ... ,AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each ...
分类：
其他好文 时间：
2014-07-23 11:31:26
阅读次数：
269
In the past few months, I have developed two simple applications on Baidu App Engine. Compared to Google App Engine, or Nitrous.Io, the documentation ...
分类：
移动开发 时间：
2014-07-23 02:36:57
阅读次数：
356
I - String
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice HDU
4821
Description
Given a string S and two integers L and M, we cons...
分类：
其他好文 时间：
2014-07-22 23:49:09
阅读次数：
328
Number Sequence
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10571 Accepted Submission(s): 4814
Problem Description
Given two ...
分类：
其他好文 时间：
2014-07-22 22:34:32
阅读次数：
194
Methods of adding more resources for a particular application fall into two broad categories: horizontal and vertical scaling.[5]
To scale horizontally (or scale out) means to add more nodes to a s...
分类：
其他好文 时间：
2014-07-22 22:33:55
阅读次数：
397
