leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

0188.cpp (422B)

0 class Solution { 1 public: 2 int maxProfit(const int k, const vector<int> &prices) const { 3 vector<int> cost(k + 1, INT_MAX), profit(k + 1, 0); 4 5 for (const int price : prices) { 6 for (int i = 1; i <= k; i++) { 7 cost[i] = min(cost[i], price - profit[i - 1]); 8 profit[i] = max(profit[i], price - cost[i]); 9 } 10 } 11 12 return profit[k]; 13 } 14 };