[LeetCode]Best Time to Buy and Sell Stock

题目：

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.

来源：https://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock/

思路：

题目是说给定一个数组，该数组为每天股票的价格，求解出你最大的收益是多少（哪一天买，哪一天卖可以获得最多的盈利），最多只能持有一笔交易。

C++ AC代码：

class Solution {public:    int maxProfit(vector<int> &prices) {        if( prices.size() < 2 )    return 0;int maxProfit = 0;int minPrice = prices[0];for ( int i = 1; i < prices.size(); i++){    maxProfit = max(maxProfit, prices[i]-minPrice);minPrice = min(minPrice, prices[i]);}return maxProfit;    }};

运行时间 52ms