GCD and LCM
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 78 Accepted Submission(s): 43
Problem Description
Given two positive integ...
分类：
其他好文 时间：
2014-11-02 09:30:22
阅读次数：
185
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-11-02 07:03:37
阅读次数：
177
题目：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...
分类：
编程语言 时间：
2014-11-02 00:36:25
阅读次数：
215
Given a strings1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation...
分类：
其他好文 时间：
2014-11-01 17:46:15
阅读次数：
151
DescriptionThere is a special number sequence which has n+1 integers. For each number in sequence, we have two rules:● ai∈ [0,n]● ai≠ aj( i ≠ j )For s...
分类：
其他好文 时间：
2014-11-01 17:39:38
阅读次数：
162
大意：有两个杯子 三种操作You are given two pots, having the volume ofAandBliters respectively. The following operations can be performed:FILL(i) fill the poti(1 ≤...
分类：
其他好文 时间：
2014-11-01 09:42:07
阅读次数：
332
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-11-01 06:12:44
阅读次数：
273
Given two arrays A, B with size n, you could justify the positions of number in array B to maximum the sum[abs(ai-bi)], i from 0 to n or minimize the sum[abs(ai-bi)].
--------------------------------...
分类：
编程语言 时间：
2014-10-31 20:43:45
阅读次数：
353
一、直接插入排序 1 class Program 2 { 3 /// 4 /// swap two number 5 /// 6 /// 7 /// 8 static void S...
分类：
编程语言 时间：
2014-10-31 15:21:27
阅读次数：
182
Puppet configures systems in two main stages:Compile a catalogApply the catalogThe Agent/Master ArchitecturePuppet usually runs in an agent/master arc...
分类：
其他好文 时间：
2014-10-31 15:02:15
阅读次数：
239
