码迷,mamicode.com
首页 >  
搜索关键字:best time to buy    ( 54980个结果
LeetCode123:Best Time to Buy and Sell Stock III
题目: 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 co...
分类:其他好文   时间:2014-05-28 22:37:18    阅读次数:327
LeedCode --- Best Time to Buy and Sell Stock
题目链接题意: find the maximum positive difference between the price on the ith day and the jth day附上代码: 1 class Solution { 2 public: 3 int maxProfit(ve...
分类:其他好文   时间:2014-05-28 03:49:45    阅读次数:307
[leetcode]Climbing Stairs @ Python
原题地址:https://oj.leetcode.com/problems/climbing-stairs/题意:You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either cl...
分类:编程语言   时间:2014-05-28 03:27:49    阅读次数:267
[leetcode]_Best Time to Buy and Sell Stock I && II
一个系列三道题,我都不会做,google之答案。过了两道,第三道看不懂,放置,稍后继续。一、Best Time to Buy and Sell Stock I题目:一个数组表示一支股票的价格变换。要求只买卖一次,获得最大收益。思路:一开始我认为是寻找最大、最小值,但由于最大值不一定总是出现在最小值的...
分类:其他好文   时间:2014-05-28 01:21:52    阅读次数:262
LeetCode121: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 transac...
分类:其他好文   时间:2014-05-28 00:55:20    阅读次数:288
LeetCode122:Best Time to Buy and Sell Stock II
题目: 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 co...
分类:其他好文   时间:2014-05-28 00:53:26    阅读次数:338
HDU-1565 方格取数(1)
http://acm.hdu.edu.cn/showproblem.php?pid=1565 方格取数(1)Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submissi....
分类:其他好文   时间:2014-05-28 00:31:16    阅读次数:248
shell 生产带有作者信息的基本go源文件
#!/bin/bash# Program to output a go source file with user informationCURRENT_TIME=$(date +"%x %r %Z")cat << EOF/* Author:$USER CreatedAt:$CURRENT_TIME...
分类:其他好文   时间:2014-05-27 17:49:29    阅读次数:283
Get current time and date on Android
You could use:Calendar c =Calendar.getInstance();int seconds = c.get(Calendar.SECOND);There are plenty of constants in Calendar for everything you nee...
分类:移动开发   时间:2014-05-27 17:13:56    阅读次数:512
POJ 1699 Best Sequence(DFS)
題目鏈接題意 : 將幾個片段如圖所示方法縮成一個序列,求出最短這個序列。思路 : 其實我也不知道怎麼做。。。。。看網上都用了DP。。。。。但是我不會。。。。。這個DP不錯,還有用KMP+状压DP做的 1 //1699 2 #include 3 #include 4 #include 5 #in...
分类:其他好文   时间:2014-05-27 16:06:19    阅读次数:282
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!