LeetCode Best Time to Buy and Sell Stock

链接: https://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock/

开始理解错题意了..

只能买一次&&卖一次.找出最大利润

看了网上的思路...O(n)的复杂度..AC

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