Leetcode notes: Best time to Buy and Sell Stock

I. Title Description

Say you had an array for which the i-th element was the price of a given stock on day I.
If you were-permitted-to-complete at most one transaction (ie, buy one and sell one share of the stock), design an AL Gorithm to find the maximum profit.

Two. Topic analysis

The title means to enter an array that represents a stock price per day, and the first i element represents i the stock price of the day, allowing only one buy and sell, asking how to trade to make the most profit?

The first thought is to transform the original valuation sequence into a differential sequence, which can be converted to the maximum sub-segment of the array.

Or, you can use the idea of a dynamic plan, assuming that the i day you buy, when you can make the most money? It's all i + 1 n about choosing the largest share price minus the i day's share price in the first day.

Three. Sample code

//second method#include <iostream>#include <vector>using namespace STD;classSolution { Public:intMaxprofit ( vector<int>&prices) {if(prices.size () = =0)return 0;intMaxprice = Prices[prices.size ()-1];intProfit =0; for(size_t i = prices.size ()-1; I >=0;            i--) {maxprice = max (Maxprice, prices[i]);        Profit = Max (profit, Maxprice-prices[i]); }returnProfit }};

Four. Summary

There are several questions related to the problem. Subsequent updates ...

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Leetcode notes: Best time to Buy and Sell Stock