algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-06 23:28:29 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0123.买卖股票的最佳时机III.md

Browse Source 
0123.买卖股票的最佳时机III新增C语言实现
This commit is contained in:
a12bb
2024-03-12 21:44:50 +08:00
parent 1b9ae455df
commit d40d61e265
1 changed files with 28 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

29
problems/0123.买卖股票的最佳时机III.md
View File

@ -413,6 +413,34 @@ function maxProfit(prices: number[]): number {
};
```
### C:
```c
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) > (b) ? (b) : (a))
int maxProfit(int* prices, int pricesSize) {
int buy1 = prices[0], buy2 = prices[0];
int profit1 = 0, profit2 = 0;
for (int i = 0; i < pricesSize; ++i) {
// 寻找最低点买入
buy1 = min(buy1, prices[i]);
// 找到第一次交易的最大盈利,并不断维护这一最大值
profit1 = max(profit1, prices[i] - buy1);
// 寻找第二次交易的最低投资点，并且考虑前一次交易的成本
// 当前价格 - 第一次操作的盈利=新的投入成本（
// 为了让盈利最大，要寻找最小的成本）
buy2 = min(buy2, prices[i] - profit1);
// 第二次卖出后的盈利：当前价格减去成本，不断维护这一最大的总利润
profit2 = max(profit2, prices[i] - buy2);
}
return profit2;
}
```
### Rust：
> 版本一
@ -465,4 +493,3 @@ impl Solution {
<a href="https://programmercarl.com/other/kstar.html" target="_blank">
<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
</a>