algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 19:44:45 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新 0122.买卖股票的最佳时机II 排版格式修复

Browse Source
This commit is contained in:
jinbudaily
2023-07-25 14:53:02 +08:00
parent fcd25819e9
commit 7da76551ba
1 changed files with 5 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
problems/0122.买卖股票的最佳时机II.md
View File

@ -37,9 +37,9 @@
- 1 <= prices.length <= 3 \* 10 ^ 4
- 0 <= prices[i] <= 10 ^ 4
# 视频讲解
## 算法公开课
**《代码随想录》算法视频公开课：[贪心算法也能解决股票问题！LeetCode：122.买卖股票最佳时机 II](https://www.bilibili.com/video/BV1ev4y1C7na)，相信结合视频在看本篇题解，更有助于大家对本题的理解**。
**[《代码随想录》算法视频公开课](https://programmercarl.com/other/gongkaike.html)：[贪心算法也能解决股票问题！LeetCode：122.买卖股票最佳时机 II](https://www.bilibili.com/video/BV1ev4y1C7na)，相信结合视频在看本篇题解，更有助于大家对本题的理解**。
## 思路
@ -316,7 +316,7 @@ function maxProfit(prices: number[]): number {
}
```
### Rust
### Rust：
贪心：
@ -389,7 +389,7 @@ int maxProfit(int* prices, int pricesSize){
}
```
### Scala
### Scala：
贪心:
@ -411,3 +411,4 @@ object Solution {
<a href="https://programmercarl.com/other/kstar.html" target="_blank">
<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
</a>