feat: add c++ solution to lc problem: No.2291

No.2291.Maximum Profit From Trading Stocks

Author: zhaocchen

solution/2200-2299/2291.Maximum Profit From Trading Stocks/README.md

@@ -91,6 +91,24 @@ function maximumProfit(present: number[], future: number[], budget: number): num
 };
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int maximumProfit(vector<int>& present, vector<int>& future, int budget) {
+        int n = present.size();
+        vector<int>dp(budget + 1, 0);
+        for (int i = 0; i < n; i++) {
+            for (int j = budget; j >= present[i]; j--) {
+                dp[j] = max(dp[j], dp[j - present[i]] + future[i] - present[i]);
+            }
+        }
+        return dp.back();
+    }
+};
+```
+
 ### **...**
 
 ```

solution/2200-2299/2291.Maximum Profit From Trading Stocks/README_EN.md

@@ -83,6 +83,24 @@ function maximumProfit(present: number[], future: number[], budget: number): num
 };
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int maximumProfit(vector<int>& present, vector<int>& future, int budget) {
+        int n = present.size();
+        vector<int>dp(budget + 1, 0);
+        for (int i = 0; i < n; i++) {
+            for (int j = budget; j >= present[i]; j--) {
+                dp[j] = max(dp[j], dp[j - present[i]] + future[i] - present[i]);
+            }
+        }
+        return dp.back();
+    }
+};
+```
+
 ### **...**
 
 ```

solution/2200-2299/2291.Maximum Profit From Trading Stocks/Solution.cpp

@@ -0,0 +1,13 @@
+class Solution {
+public:
+    int maximumProfit(vector<int>& present, vector<int>& future, int budget) {
+        int n = present.size();
+        vector<int>dp(budget + 1, 0);
+        for (int i = 0; i < n; i++) {
+            for (int j = budget; j >= present[i]; j--) {
+                dp[j] = max(dp[j], dp[j - present[i]] + future[i] - present[i]);
+            }
+        }
+        return dp.back();
+    }
+};