LeetCode: Best Time to Buy and Stock

LeetCode: Best Time to Buy and Stock

Description:

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 every one share of the stock), design an algorithm to find the maximum profit.

Idea: traverse the array and save the minimum low of the elements that have already been traversed. Then, the maximum benefit of selling a stock on the day I is prices [I]-low, and you can find the maximum benefit of the day.

Code:

Int maxProfit (vector

 
  
& Prices) {int length = prices. size (); if (length = 0) return 0; int max_profit = 0; int low = prices [0]; for (int I = 1; I <length; I ++) {int temp = prices [I]-low; if (temp> max_profit) max_profit = temp; if (prices [I] <low) low = prices [I];} return max_profit ;}