https://leetcode.cn/problems/form-array-by-concatenating-subarrays-of-another-array/ https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown/

Author: masx200

README.md

@@ -45,6 +45,10 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/form-array-by-concatenating-subarrays-of-another-array/
+
+https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown/
+
 https://leetcode-cn.com/problems/minimum-elements-to-add-to-form-a-given-sum/
 
 https://leetcode.cn/problems/checking-existence-of-edge-length-limited-paths-ii/

best-time-to-buy-and-sell-stock-with-cooldown/index.ts

@@ -0,0 +1,16 @@
+function maxProfit(prices: number[]): number {
+    const n = prices.length;
+    let r1 = -prices[0];
+    let r2 = 0;
+    let r3 = 0;
+    for (let i = 1; i < n; i++) {
+        const newR1 = Math.max(r1, r3 - prices[i]);
+        const newR2 = r1 + prices[i];
+        const newR3 = Math.max(r3, r2);
+        r1 = newR1;
+        r2 = newR2;
+        r3 = newR3;
+    }
+    return Math.max(r3, r2);
+}
+export default maxProfit;

form-array-by-concatenating-subarrays-of-another-array/index.ts

@@ -0,0 +1,25 @@
+function canChoose(groups: number[][], nums: number[]): boolean {
+    let i = 0;
+    for (let k = 0; k < nums.length && i < groups.length;) {
+        if (check(groups[i], nums, k)) {
+            k += groups[i].length;
+            i++;
+        } else {
+            k++;
+        }
+    }
+    return i === groups.length;
+}
+
+function check(g: number[], nums: number[], k: number) {
+    if (k + g.length > nums.length) {
+        return false;
+    }
+    for (let j = 0; j < g.length; j++) {
+        if (g[j] !== nums[k + j]) {
+            return false;
+        }
+    }
+    return true;
+}
+export default canChoose;

minimum-elements-to-add-to-form-a-given-sum/index.ts

@@ -1,5 +1,4 @@
 function minElements(nums: number[], limit: number, goal: number): number {
-
-  return Math.ceil(Math.abs(goal - nums.reduce((a, b) => a + b)) / limit);
+    return Math.ceil(Math.abs(goal - nums.reduce((a, b) => a + b)) / limit);
 }
-export default minElements
+export default minElements;