leetcode 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.

• 核心问题: 给定一个数组,在数组中找出两个元素对(a,b), 满足b-a最大.

  如果存在这样的元素对,输出b-a

  否则输出0

• 思考:

  遍历数组,使用两个索引left(初始为0), right(初始为1), 再定义一个result存储结果,初始为0,

代码:

class Solution {
public:
    int maxProfit(vector<int>& prices) {
     	int left = 0, right = 1;
		int result = 0;
		while (right < prices.size())
		{
			if (prices[left] > prices[right])
			{
				left = right;
				right++;
			}
			else if (prices[right] - prices[left] > result)
			{
				result = prices[right] - prices[left];
				right++;
			}
			else
				right++;
		}
		return result;   
    }
};

注意代码需要考虑 数组里面没有两个以上元素的情况.