algorithm practice:(0515) 121 best time to buy and sell stock

solution1: the brute force tranveral method.

We can use nested iteration on this arrary.

First, take the value of index 0 as a buying day. Then iterate forward to find a day to sell.

move the position of buying day each time , and move the position of selling day forwardas the same time to find the maximum profit during the process.

sulution2:  Once iteration

first , define the current minimun price as the first  element of the array. 

Then iterate through the array.

For each element starting from the index1 in the array, check if current elemnt minus current miximun price is greater than the maximun profit.

If so, update the maximun profit. And also update the current minimun price during the iteration.

Finally ,after the iteration, return the maximun profit.

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        // solution1: Exceed the time limit
        int maxProfit = 0;
        // i: the sell day
        // for (int i = prices.size() - 1; i > 0; i--) {
            // j: buy day
            // for (int j = i - 1; j >= 0; j--) {
                // if (prices[i] - prices[j] > maxProfit) {
                    // maxProfit = prices[i] - prices[j];
                // }
            // }
        // }

        // solution2: iterate once and find the max prift
        int currentMinPrice = prices[0];
    
        for (int i = 1; i < prices.size(); i++) {
            if (prices[i] - currentMinPrice > maxProfit) {
                maxProfit = prices[i] - currentMinPrice;
            }
            currentMinPrice = std::min(currentMinPrice, prices[i]);
        }
        return maxProfit;
    }
};