Question
Best Time to Buy and Sell Stock 2
You are given an integer array prices where prices[i] is the price of a given stock on the ith day.
On each day, you may decide to buy and/or sell the stock. You can only hold at most one share of the stock at any time. However, you can buy it then immediately sell it on the same day.
Find and return the maximum profit you can achieve.
Input
User Task
Since this is a functional problem, you don't have to input anything. You just need to complete the maxProfit() function that takes an integer array prices as a parameter and returns an integer representing the maximum profit you can achieve.
Custom Input
The first line of the input contains a single integer n, representing the size of the array prices.
The second line of the input contains n space-separated integers representing elements of the array prices.
Since this is a functional problem, you don't have to input anything. You just need to complete the maxProfit() function that takes an integer array prices as a parameter and returns an integer representing the maximum profit you can achieve.
Custom Input
The first line of the input contains a single integer n, representing the size of the array prices.
The second line of the input contains n space-separated integers representing elements of the array prices.
Output
Return an integer representing the maximum profit you can achieve.
Example
Input
6
7 1 5 3 6 4
Output
7
Explanation
Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5 - 1 = 4.
Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6 - 3 = 3.
Total profit is 4 + 3 = 7.
6
7 1 5 3 6 4
Output
7
Explanation
Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5 - 1 = 4.
Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6 - 3 = 3.
Total profit is 4 + 3 = 7.