Given an unsorted array, find the maximum difference between the successive elements in its sorted form.Try to solve it in linear time/space.Return 0 ...
分类：
其他好文 时间：
2014-12-31 06:21:14
阅读次数：
281
时间处理工具类package com.tools;//时间处理类import java.util.Date;import java.text.SimpleDateFormat;public class Time { public static String getTime(){ ...
分类：
其他好文 时间：
2014-12-31 06:18:10
阅读次数：
165
Algorithm: Scan through the array, keep finding 1. prices[i] with the condition: prices[i] prices[i+1], or at the end of an ascending trend, trea...
分类：
其他好文 时间：
2014-12-31 06:16:24
阅读次数：
159
Bomb
Description
The counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number sequence of the time bomb counts from 1 to N. I...
分类：
其他好文 时间：
2014-12-30 23:44:59
阅读次数：
302
Jungle Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4572 Accepted Submission(s): 3354
Problem Description
The Head ...
分类：
编程语言 时间：
2014-12-30 23:42:48
阅读次数：
277
题目：（Math）Given an integern, return the number of trailing zeroes inn!.Note:Your solution should be in logarithmic time complexity.题解：首先列几个例子找一找规律。然后发现...
分类：
其他好文 时间：
2014-12-30 23:26:41
阅读次数：
170
一直拖、放了放久、受不了A -棋盘问题Time Limit:1000MSMemory Limit:10000KB64bit IO Format:%I64d & %I64uSubmitStatusDescription在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意...
分类：
其他好文 时间：
2014-12-30 23:24:52
阅读次数：
1766
Best Time to Buy and Sell Stock IIISay you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the...
分类：
其他好文 时间：
2014-12-30 23:16:18
阅读次数：
268
问题描述：
Say you have an array for which the ith element is the price of a given stock on day
i.
Design an algorithm to find the maximum profit. You may complete at most
two transactions.
Note:
Y...
分类：
其他好文 时间：
2014-12-30 22:08:07
阅读次数：
178
Given an integer n, return the number of trailing zeroes in n!. Note: Your solution should be in logarithmic time complexity. 这个是我的代码，但是超时 class Solut...
分类：
移动开发 时间：
2014-12-30 22:06:15
阅读次数：
169
