[057] LeetCode 121 演算法【Best Time to Buy and Sell Stock】 股票機器人

121. Best Time to Buy and Sell Stock (Easy)

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 (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.

Note that you cannot sell a stock before you buy one.

Example 1:

Input: [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5.
             Not 7-1 = 6, as selling price needs to be larger than buying price.

Example 2:

Input: [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.

這道題目是要妳找出Array中買入跟賣出最大的值可以是多少，這題要抓住當前的profit去計算就會比較好找，記得在記錄profit的時候要確定數組長度為0的時候要怎判斷。

大家加油。

上一篇：[056] LeetCode 45演算法【Jump Game II】跳躍遊戲 II

下一篇：[058] LeetCode 122演算法【Best Time to Buy and Sell Stock II】 股票機器人 II