7.8 股票交易
Input: s = "aab", p = "c*a*b"
Output: true
ca
dpdp[i][j]ij
dp
bool isMatch(string s, string p) { int m = s.size(), n = p.size();
vector<vector<bool>> dp(m + 1, vector<bool>(n + 1, false));
dp[0][0] = true;
for (int i = 1; i < n + 1; ++i) { if (p[i-1] == ’*’) {
dp[0][i] = dp[0][i-2];
} }
for (int i = 1; i < m + 1; ++i) { for (int j = 1; j < n + 1; ++j) {
if (p[j-1] == ’.’) { dp[i][j] = dp[i-1][j-1];
} else if (p[j-1] != ’*’) { dp[i][j] = dp[i-1][j-1] && p[j-1] == s[i-1];
} else if (p[j-2] != s[i-1] && p[j-2] != ’.’) { dp[i][j] = dp[i][j-2];
} else { dp[i][j] = dp[i][j-1] || dp[i-1][j] || dp[i][j-2];
} }
} return dp[m][n];
}
7.8
121. Best Time to Buy and Sell Stock (Easy)
Input: [7,1,5,3,6,4] Output: 5
16
ii
int maxProfit(vector<int>& prices) { int sell = 0, buy = INT_MIN;
for (int i = 0; i < prices.size(); ++i) { buy = max(buy, -prices[i]);
sell = max(sell, buy + prices[i]);
} return sell;
}
188. Best Time to Buy and Sell Stock IV (Hard)
k
k
Input: [3,2,6,5,0,3], k = 2 Output: 7
26 03
kk buysellbuy[j]j
sell[j]j
// int maxProfit(int k, vector<int>& prices) {
int days = prices.size();
if (days < 2) { return 0;
return maxProfitUnlimited(prices);
} vector<int> buy(k + 1, INT_MIN), sell(k + 1, 0);
for (int i = 0; i < days; ++i) { for (int j = 1; j <= k; ++j) {
buy[j] = max(buy[j], sell[j-1] - prices[i]);
sell[j] = max(sell[j], buy[j] + prices[i]);
} }
return sell[k];
}
// int maxProfitUnlimited(vector<int> prices) {
int maxProfit = 0;
for (int i = 1; i < prices.size(); ++i) { if (prices[i] > prices[i-1]) {
maxProfit += prices[i] - prices[i-1];
} }
return maxProfit;
}
309. Best Time to Buy and Sell Stock with Cooldown (Medium)
Input: [1,2,3,0,2] Output: 3
全站分卷索引 · 68 卷
- 11 题目分类
- 22 最易懂的贪心算法
- 32.3 区间问题
- 42.4 练习
- 53 玩转双指针
- 63.2 Two Sum
- 73.4 快慢指针
- 83.5 滑动窗口
- 93.6 练习
- 104 居合斩!二分查找
- 114.3 查找区间
- 124.4 旋转数组查找数字
- 134.5 练习
- 145 千奇百怪的排序算法
- 155.2 快速选择
- 165.3 桶排序
- 175.4 练习
- 186 一切皆可搜索
- 196.3 回溯法
- 206.4 广度优先搜索
- 216.5 练习
- 227 深入浅出动态规划
- 237.3 基本动态规划:二维
- 247.4 分割类型题
- 257.5 子序列问题
- 267.6 背包问题
- 277.7 字符串编辑
- 287.8 股票交易
- 297.9 练习
- 308 化繁为简的分治法
- 318.3 练习
- 329 巧解数学问题
- 339.4 数字处理
- 349.5 随机与取样
- 359.6 练习
- 3610 神奇的位运算
- 3710.3 二进制特性
- 3810.4 练习
- 3911 妙用数据结构
- 4011.2 数组
- 4111.3 栈和队列
- 4211.4 单调栈
- 4311.5 优先队列
- 4411.6 双端队列
- 4511.7 哈希表
- 4611.8 多重集合和映射
- 4711.9 前缀和与积分图
- 4811.10 练习
- 11.10
- 566. Reshape the Matrix (Easy)
- 225. Implement Stack using Queues (Easy)
- 503. Next Greater Element II (Medium)
- 217. Contains Duplicate (Easy)
- 697. Degree of an Array (Easy)
- 594. Longest Harmonious Subsequence (Easy)
- 287. Find the Duplicate Number (Medium)
- 313. Super Ugly Number (Medium)
- 870. Advantage Shuffle (Medium)
- 307. Range Sum Query - Mutable (Medium)
- 4912 令人头大的字符串
- 5012.3 字符串理解
- 5112.4 字符串匹配
- 5212.5 练习
- 5313 指针三剑客之一:链表
- 5413.3 其它链表技巧
- 5513.4 练习
- 5614 指针三剑客之二:树
- 5714.3 层次遍历
- 5814.4 前中后序遍历
- 5914.5 二叉查找树
- 6014.6 字典树
- 6114.7 练习
- 14.7
- 226. Invert Binary Tree (Easy)
- 617. Merge Two Binary Trees (Easy)
- 572. Subtree of Another Tree (Easy)
- 404. Sum of Left Leaves (Easy)
- 513. Find Bottom Left Tree Value (Easy)
- 538. Convert BST to Greater Tree (Easy)
- 235. Lowest Common Ancestor of a Binary Search Tree (Easy)
- 530. Minimum Absolute Difference in BST (Easy)
- 889. Construct Binary Tree from Preorder and Postorder Traversal (Medium)
- 106. Construct Binary Tree from Inorder and Postorder Traversal (Medium)
- 94. Binary Tree Inorder Traversal (Medium)
- 6215 指针三剑客之三:图
- 6315.3 拓扑排序
- 6415.4 练习
- 6516 更加复杂的数据结构
- 6616.3 复合数据结构
- 6716.4 练习
- 6817 后记