【LeetCode從零單排】No121 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), design an algorithm to find the maximum profit.
又是時間複雜度,離真相就差一行程式碼。。。還是沒想出來,看了discuss才知道答案。程式碼
public class Solution {
public int maxProfit(int[] prices) {
if (prices.length<=0 || prices.length==1) return 0;
int maxProfit=0;
int minTemp=prices[0];
for(int i=1;i<prices.length;i++){
if(prices[i]<minTemp){
minTemp=prices[i];
}
else{
if(prices[i]-minTemp>maxProfit){
maxProfit=prices[i]-minTemp;
}
}
}
return maxProfit;
}
}
/********************************
* 本文來自部落格 “李博Garvin“
* 轉載請標明出處:http://blog.csdn.net/buptgshengod
******************************************/
相關文章
- [leetcode]Best Time to Buy and Sell StockLeetCode
- Leetcode Best Time to Buy and Sell StockLeetCode
- Leetcode Best Time to Buy and Sell Stock IILeetCode
- Best Time to Buy and Sell Stock III -- LeetCodeLeetCode
- Best Time to Buy and Sell Stock leetcode javaLeetCodeJava
- leetcode_best-time-to-buy-and-sell-stock-iiLeetCode
- LeetCode-Best Time to Buy and Sell Stock with CooldownLeetCode
- LeetCode-Best Time to Buy and Sell Stock IVLeetCode
- Leetcode-Best Time to Buy and Sell Stock IIILeetCode
- Best Time to Buy and Sell Stock II leetcode javaLeetCodeJava
- Best Time to Buy and Sell Stock III leetcode javaLeetCodeJava
- Best Time to Buy and Sell Stock系列分析
- leetcode best-time-to-buy-and-sell-stock-iii(Java)LeetCodeJava
- LeetCode 714 Best Time to Buy and Sell Stock with Transaction FeeLeetCode
- LeetCode(188) Best Time to Buy and Sell Stock IV (Java)LeetCodeJava
- LeetCode 309. Best Time to Buy and Sell Stock with CooldownLeetCode
- 【Lintcode】393. Best Time to Buy and Sell Stock IV
- 【LeetCode】 Best Time to Buy and Sell Stock I II III IV 解題報告LeetCode
- 【LeetCode】309. Best Time to Buy and Sell Stock with Cooldown 最佳買賣股票時機含冷凍期(Medium)(JAVA)LeetCodeJava
- 【LeetCode從零單排】No38.CountAndSayLeetCode
- 【LeetCode從零單排】No.7 Reverse IntegerLeetCode
- 【LeetCode從零單排】No20.ValidParenthesesLeetCode
- 【LeetCode從零單排】No19.RemoveNthNodeFromEndofListLeetCodeREM
- 【LeetCode從零單排】No21.MergeTwoSortedListsLeetCode
- 【LeetCode從零單排】No27.Remove ElementLeetCodeREM
- 【LeetCode從零單排】No28 Implement strStr()LeetCode
- 【LeetCode從零單排】No22.Generate ParenthesesLeetCode
- 【LeetCode從零單排】No58.Length of Last WordLeetCodeAST
- 【LeetCode從零單排】No67.AddBinaryLeetCode
- 【LeetCode從零單排】No70.ClimbingStairsLeetCodeAI
- 【LeetCode從零單排】No.9 Palindrome NumberLeetCode
- 【LeetCode從零單排】No14.LongestCommonPrefixLeetCode
- 【LeetCode從零單排】No36 Valid SudokuLeetCode
- 【LeetCode從零單排】No221.Maximal SquareLeetCode
- 【LeetCode從零單排】No15 3SumLeetCode
- 【LeetCode從零單排】No189 .Rotate ArrayLeetCode
- 【LeetCode從零單排】No88.Merge Sorted ArrayLeetCode
- Mysql從零單排-1MySql