Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal...
分类：
其他好文 时间：
2014-10-06 13:11:00
阅读次数：
167
DescriptionThere are N cities and N-1 roads in Magic-Island. You can go from one city to any other. One road only connects two cities. One day, The ki...
分类：
其他好文 时间：
2014-10-06 02:45:19
阅读次数：
292
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single ...
分类：
其他好文 时间：
2014-10-05 23:28:39
阅读次数：
357
struct Node{
int index;
int value;
};
bool compare(Node a, Node b)
{
return a.value < b.value;
}
class Solution {
public:
vector twoSum(vector &numbers, int target) {
...
分类：
其他好文 时间：
2014-10-05 22:56:39
阅读次数：
252
Two Cylinders
Special JudgeTime Limit: 10000/5000MS (Java/Others)Memory
Limit: 128000/64000KB (Java/Others)
SubmitStatisticNext
Problem
Problem Description
In this problem your t...
分类：
其他好文 时间：
2014-10-05 20:38:39
阅读次数：
184
Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-nega...
分类：
其他好文 时间：
2014-10-05 20:05:58
阅读次数：
208
题目链接：点击打开链接
给定r1,r2
表示2个圆柱体的半径
这两个圆柱体高是正无穷，互相垂直，问相交的最大面积
#include
#include
#include
#include
#define M 410
#define inf 0x3f3f3f3f
const double eps = 1e-8;
template
inline bool rd(T &ret) ...
分类：
其他好文 时间：
2014-10-05 19:47:49
阅读次数：
206
Pots
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 10071
Accepted: 4237
Special Judge
Description
You are given two pots, having the volume of A an...
分类：
其他好文 时间：
2014-10-05 17:52:28
阅读次数：
193
Flip Game
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 31227
Accepted: 13583
Description
Flip game is played on a rectangular 4x4 field with two-sided pie...
分类：
其他好文 时间：
2014-10-05 17:50:38
阅读次数：
319
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representatio...
分类：
其他好文 时间：
2014-10-05 04:01:47
阅读次数：
232
