码迷,mamicode.com
首页 >  
搜索关键字:most water    ( 6947个结果
Best Time to Buy and Sell Stock(动态规划)
Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie...
分类:其他好文   时间:2014-12-28 18:12:08    阅读次数:170
【LeetCode】Longest Substring with At Most Two Distinct Characters (2 solutions)
Longest Substring with At Most Two Distinct CharactersGiven a string, find the length of the longest substring T that contains at most 2 distinct char...
分类:其他好文   时间:2014-12-28 16:53:21    阅读次数:198
(中等) POJ 2886 Who Gets the Most Candies? , 反素数+线段树。
Description Nchildren are sitting in a circle to play a game. The children are numbered from 1 toNin clockwise order. Each of them has a card with a.....
分类:其他好文   时间:2014-12-28 15:33:01    阅读次数:291
LeetCode31:Best Time to Buy and Sell Stock
Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),...
分类:其他好文   时间:2014-12-26 16:41:15    阅读次数:136
water Waves Demo
效果图:工程图:代码:#import "ViewController.h"//加入头文件#import "VWWWaterView.h"@interface ViewController ()@end@implementation ViewController- (void)viewDidLoad ...
分类:其他好文   时间:2014-12-26 11:01:34    阅读次数:117
leetcode Longest Substring with At Most Two Distinct Characters
找到最多含有两个不同字符的子串的最长长度。例如:eoeabc,最长的是eoe为3,其他都为2.思路:用p1,p2表示两种字符串的最后一个出现的下标位置。初始p1为0. p2为-1.start初始化为0,表示两种字符串的开头。只要遍历一次string就可以得到结果了。首先我们要确定p2的值,那么i要一...
分类:其他好文   时间:2014-12-25 21:47:44    阅读次数:150
【oracle】oracledba24 use the CONFIGURE command to reconfigure the recovery window to 60 days
You set the recovery window to seven days and the backup optimiza tion to ON using the CONFIGURE command of Recovery Manager (RMAN). The most recent backup of the TOOLStablespace to disk was taken o...
分类:数据库   时间:2014-12-25 16:31:34    阅读次数:155
[C++]LeetCode: 54 Best Time to Buy and Sell Stock
题目: Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the ...
分类:编程语言   时间:2014-12-25 16:25:25    阅读次数:146
LeetCode:Container With Most Water
题目描述: Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i...
分类:其他好文   时间:2014-12-25 11:24:50    阅读次数:163
HDU 2295 Radar(DLX可重复覆盖)
Problem Description N cities of the Java Kingdom need to be covered by radars for being in a state of war. Since the kingdom has M radar stations but only K operators, we can at most operate K rada...
分类:其他好文   时间:2014-12-25 01:30:48    阅读次数:460
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!