content = "已完成 {} 道\n\n".format(frame_count) + table + "\n\n"

H = frame.shape[0]

"3321"

| 1358 | 包含所有三种字符的子字符串数目 | | [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-substrings-containing-all-three-characters) [🔗](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters) |

| 3306 | 元音辅音字符串计数 II | | [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii) [🔗](https://leetcode.com/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii) |

| 3208 | 交替组 II | | [`数组`](/tag/array.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/alternating-groups-ii) [🔗](https://leetcode.com/problems/alternating-groups-ii) |

| 2529 | 正整数和负整数的最大计数 | | [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`计数`](/tag/counting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-count-of-positive-integer-and-negative-integer) [🔗](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer) |

| 1358 | 包含所有三种字符的子字符串数目 | | [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`滑动窗口`](/tag/sliding-window.md) | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-substrings-containing-all-three-characters) [🔗](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters) |

1. **动态规划：**定义一个二维数组 `dp`，其中 `dp[i][0]` 表示第 `i` 天不持有股票时的最大利润， `dp[i][1]` 表示第 `i` 天持有股票时的最大利润。

3. **边界条件：**第一天（`i == 0`）时，`dp[0][0] = 0`，`dp[0][1] = -prices[0]`。

4. **初始化：**初始化利润为 0。

5. **返回最大利润：**最后返回 `dp[n - 1][0]`，即最后一天不持有股票的最大利润，因为若最后一天还持有股票没有卖出，收益肯定小于做了一次交易的情况。

const subset = (nums, sum) => {

const dp = new Array(sum + 1).fill(0);

dp[0] = 1;

for (let num of nums) {

for (let j = sum; j >= 0; j--) {

if (j >= num) {

dp[j] = dp[j - num] + dp[j];

}

}

return dp[sum];

};

return subset(nums, (sum + target) / 2);

| 2529 | 正整数和负整数的最大计数 | | [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`计数`](/tag/counting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-count-of-positive-integer-and-negative-integer) [🔗](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer) |

| 2529 | 正整数和负整数的最大计数 | | [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`计数`](/tag/counting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/maximum-count-of-positive-integer-and-negative-integer) [🔗](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer) |