Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Debris丶
Fucking Algorithm
提交
032bc7e6
F
Fucking Algorithm
项目概览
Debris丶
/
Fucking Algorithm
与 Fork 源项目一致
从无法访问的项目Fork
通知
1
Star
1
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
F
Fucking Algorithm
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
032bc7e6
编写于
6月 22, 2020
作者:
M
Miraclemin
提交者:
labuladong
6月 22, 2020
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Python3
上级
7d977471
变更
1
显示空白变更内容
内联
并排
Showing
1 changed file
with
78 addition
and
1 deletion
+78
-1
动态规划系列/团灭股票问题.md
动态规划系列/团灭股票问题.md
+78
-1
未找到文件。
动态规划系列/团灭股票问题.md
浏览文件 @
032bc7e6
...
...
@@ -391,7 +391,84 @@ int maxProfit_k_any(int max_k, int[] prices) {
**致力于把算法讲清楚!欢迎关注我的微信公众号 labuladong,查看更多通俗易懂的文章**
:
![
labuladong
](
../pictures/labuladong.png
)
[
Hanmin
](
https://github.com/Miraclemin/
)
提供 Python3 代码:
**第一题,k = 1**
```
python
def
maxProfit
(
self
,
prices
:
List
[
int
])
->
int
:
dp_i_0
,
dp_i_1
=
0
,
float
(
'-inf'
)
for
price
in
prices
:
dp_i_0
=
max
(
dp_i_0
,
dp_i_1
+
price
)
dp_i_1
=
max
(
dp_i_1
,
-
price
)
return
dp_i_0
```
**第二题,k = +infinity**
```
python
def
maxProfit_k_inf
(
self
,
prices
:
List
[
int
])
->
int
:
dp_i_0
,
dp_i_1
=
0
,
float
(
'-inf'
)
for
price
in
prices
:
temp
=
dp_i_0
dp_i_0
=
max
(
dp_i_0
,
dp_i_1
+
price
)
dp_i_1
=
max
(
dp_i_1
,
temp
-
price
)
return
dp_i_0
```
**第三题,k = +infinity with cooldown**
```
python
def
maxProfit_with_cool
(
self
,
prices
:
List
[
int
])
->
int
:
dp_i_0
,
dp_i_1
=
0
,
float
(
'-inf'
)
dp_pre_0
=
0
##代表 dp[i-2][0]
for
price
in
prices
:
temp
=
dp_i_0
dp_i_0
=
max
(
dp_i_0
,
dp_i_1
+
price
)
dp_i_1
=
max
(
dp_i_1
,
dp_pre_0
-
price
)
dp_pre_0
=
temp
return
dp_i_0
```
**第四题,k = +infinity with fee**
```
python
def
maxProfit_with_fee
(
self
,
prices
:
List
[
int
],
fee
:
int
)
->
int
:
dp_i_0
,
dp_i_1
=
0
,
float
(
'-inf'
)
for
price
in
prices
:
temp
=
dp_i_0
dp_i_0
=
max
(
dp_i_0
,
dp_i_1
+
price
)
dp_i_1
=
max
(
dp_i_1
,
temp
-
price
-
fee
)
return
dp_i_0
```
**第五题,k = 2**
```
python
def
maxProfit_k_2
(
self
,
prices
:
List
[
int
])
->
int
:
dp_i10
,
dp_i11
=
0
,
float
(
'-inf'
)
dp_i20
,
dp_i21
=
0
,
float
(
'-inf'
)
for
price
in
prices
:
dp_i20
=
max
(
dp_i20
,
dp_i21
+
price
)
dp_i21
=
max
(
dp_i21
,
dp_i10
-
price
)
dp_i10
=
max
(
dp_i10
,
dp_i11
+
price
)
dp_i11
=
max
(
dp_i11
,
-
price
)
return
dp_i20
```
**第六题,k = any integer**
```
python
def
maxProfit_k_any
(
self
,
max_k
:
int
,
prices
:
List
[
int
])
->
int
:
n
=
len
(
prices
)
if
max_k
>
n
//
2
:
return
self
.
maxProfit_k_inf
(
prices
)
else
:
dp
=
[[[
None
,
None
]
for
_
in
range
(
max_k
+
1
)]
for
_
in
range
(
n
)]
for
i
in
range
(
0
,
n
):
for
k
in
range
(
max_k
,
0
,
-
1
):
if
i
-
1
==
-
1
:
## 处理 base case
dp
[
i
][
k
][
0
]
=
0
## 解释:
## dp[i][k][0] = max(dp[-1][k][0], dp[-1][k][1] + prices[i])
## = max(0, -infinity + prices[i]) = 0
dp
[
i
][
k
][
1
]
=
-
prices
[
i
]
## 解释:
## dp[i][1] = max(dp[-1][k][1], dp[-1][k][0] - prices[i])
## = max(-infinity, 0 - prices[i]) = -prices[i]
continue
dp
[
i
][
k
][
0
]
=
max
(
dp
[
i
-
1
][
k
][
0
],
dp
[
i
-
1
][
k
][
1
]
+
prices
[
i
])
dp
[
i
][
k
][
1
]
=
max
(
dp
[
i
-
1
][
k
][
1
],
dp
[
i
-
1
][
k
-
1
][
0
]
-
prices
[
i
])
return
dp
[
n
-
1
][
max_k
][
0
];
```
[
上一篇:动态规划之KMP字符匹配算法
](
../动态规划系列/动态规划之KMP字符匹配算法.md
)
[
下一篇:团灭 LeetCode 打家劫舍问题
](
../动态规划系列/抢房子.md
)
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录