How to achieve the maximum profit of the stock by golang's leetcode skills

Editor to share with you golang leetcode skills how to achieve the maximum profits of the stock, I believe that most people do not know much about it, so share this article for your reference, I hope you will learn a lot after reading this article, let's go to know it!

Suppose the price of a stock is stored in an array in chronological order, what is the maximum profit that can be made by buying and selling the stock at one time?

Example 1:

Input: [7, 1, 5, 3, 6, 4]

Output: 5

Explanation: buy on day 2 (stock price = 1) and sell on day 5 (stock price = 6). Maximum profit = 6-1 = 5.

Note that the profit cannot be 7-1 = 6, because the selling price needs to be greater than the buying price.

Example 2:

Input: [7, 6, 4, 3, 1]

Output: 0

Explanation: in this case, no transaction is completed, so the maximum profit is 0.

Restrictions:

0