# 122. Best Time to Buy and Sell Stock II
## 1.問題
* **股票最高獲利? (可以買賣多次)**
## 2.想法
* 提問
* 確認題意:
* function header, parameter
* test input
* 觀察
* 有點像是動態規劃的概念, 假設買賣只差了一天, 那麼每天所記錄的就是兩天間的價差
* 說明想法
* 將正的價差全部相加
* 測試計算複雜度
## **3.程式碼**
```
class Solution {
public:
int maxProfit(vector& prices) {
int sum = 0;
for (int i = 1; i < prices.size(); i++) {
int tmp = prices[i] - prices[i - 1];
if (tmp > 0) {
sum += tmp;
}
}
return sum;
}
};
```
---
# 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://jenhsuan.gitbook.io/algorithm/leetcode/122.-best-time-to-buy-and-sell-stock-ii.md?ask=
```
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.