mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-11 04:54:51 +08:00
更新 0122.买卖股票的最佳时机II 排版格式修复
This commit is contained in:
@ -37,9 +37,9 @@
|
|||||||
- 1 <= prices.length <= 3 \* 10 ^ 4
|
- 1 <= prices.length <= 3 \* 10 ^ 4
|
||||||
- 0 <= prices[i] <= 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">
|
<a href="https://programmercarl.com/other/kstar.html" target="_blank">
|
||||||
<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
|
<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
|
||||||
</a>
|
</a>
|
||||||
|
|
||||||
|
Reference in New Issue
Block a user