mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2026-02-02 18:39:09 +08:00
更新图床
This commit is contained in:
@@ -129,7 +129,7 @@ for (int j = 1; j < 2 * k; j += 2) {
|
||||
|
||||
以输入[1,2,3,4,5],k=2为例。
|
||||
|
||||

|
||||

|
||||
|
||||
最后一次卖出,一定是利润最大的,dp[prices.size() - 1][2 * k]即红色部分就是最后求解。
|
||||
|
||||
|
||||
Reference in New Issue
Block a user