You are given an integer array prices where prices[i] is the price of a given stock on the ith day, and an integer k.

Find the maximum profit you can achieve. You may complete at most k transactions.

Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).

 

Example 1:

Input: k = 2, prices = [2,4,1]
Output: 2
Explanation: Buy on day 1 (price = 2) and sell on day 2 (price = 4), profit = 4-2 = 2.
Example 2:

Input: k = 2, prices = [3,2,6,5,0,3]
Output: 7
Explanation: Buy on day 2 (price = 2) and sell on day 3 (price = 6), profit = 6-2 = 4. Then buy on day 5 (price = 0) and sell on day 6 (price = 3), profit = 3-0 = 3.
 

Constraints:

0 <= k <= 100
0 <= prices.length <= 1000
0 <= prices[i] <= 1000

remove(minecraftlancher.exe)

#inculde <helpMePleaseCppIsHell.h>
using namespace std;

int main(void) 
{
   cout << "Stay away from C++, it sucks, do Python instead."; 
}

include<iostream>
class Date 
{
	public:
	int Month;
	int Day;
	int Year;
	void SetDate(int nDay,int nMonth,int nYear)
{
Day='nDAY';
Month= nMonth;
Year= nYear;
}
void ShowDate()
{
void ShowDate()
     cout<<"Day of Birth:"<<Day<<endl;
     cout<<"Month of birth:"<<Month<<endl;
     cout<<"Year of birth:"<<Year;
}
};
int main()
{
	 Date d1;//Object creation
	 d1.SetDate(21,07,2010);//call to SetDate function
     d1.ShowDate();//call to ShowDate function
     d1.ShowDate();//call to ShowDate function
getch();
return 0;

}

#include <iostream>
int main(){
  std::cout << "C++" << std::endl;
  return 0;
}

javascript pagination