leetcode@ [121]Best Time to Buy and Sell Stock

 

Best Time to Buy and Sell Stock

Total Accepted: 69292 Total Submissions: 206193 Difficulty: Medium

 

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.

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