# 思路1

泛化到k次交易，秒杀所有股票交易问题

dp\[k, i] = max(dp\[k, i-1], prices\[i] - prices\[j] + dp\[k-1, j-1]), j=\[0..i-1]

dp\[k, i] 表示k次交易，第i天卖（或不交易）时的最大收益

两种情况：

* i天不交易，则dp\[k,i] = dp\[k, i-1]
* i天交易(卖)，假设我们在j天买了，则dp\[k,i] = prices\[i] - prices\[j] + dp\[k-1, j-1]

j是可以等于i的，j=i，则 dp\[k,i] = max(dp\[k,i-1], dp\[k-1]\[i-1])


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://851958789.gitbook.io/notes/0123_best_time_to_buy_and_sell_stock_iii/slt.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.