題目

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; } }


代碼下載：https://github.com/jimenbian/GarvinLeetCode

/********************************

* 本文來自博客 ?“李博Garvin“

* 轉載請標明出處:http://blog.csdn.net/buptgshengod

******************************************/

總結

以上是生活随笔為你收集整理的【LeetCode从零单排】No121Best Time to Buy and Sell Stock的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。