02 2025 档案

dp4
摘要：最后一块石头的重量 II class Solution { public: int lastStoneWeightII(vector<int>& stones) { int n = stones.size(); int s = reduce(stones.begin(), stones.end()) 阅读全文
posted @ 2025-02-22 16:47 skyler886 阅读(13) 评论(0) 推荐(0)
dp3
摘要：0-1背包 二维 #include <iostream> #include <vector> using namespace std; int main() { int m, n; cin >> m >> n; vector<int> weight(m + 1, 0); vector<int> va 阅读全文
posted @ 2025-02-16 19:39 skyler886 阅读(6) 评论(0) 推荐(0)
dp2
摘要：不同路径 class Solution { public: int uniquePaths(int m, int n) { int answer = 0; vector<vector<int>> dp(m, vector<int>(n, 0)); for(int i = 0; i < m; i++) 阅读全文
posted @ 2025-02-16 17:29 skyler886 阅读(14) 评论(0) 推荐(0)
dp1
摘要：斐波那契数 class Solution { public: int fib(int n) { if(n == 0) return 0; if(n == 1) return 1; vector<int> dp(n + 1); dp[0] = 0; dp[1] = 1; for(int i = 2;i 阅读全文
posted @ 2025-02-15 22:44 skyler886 阅读(7) 评论(0) 推荐(0)
贪心5
摘要：合并区间 class Solution { public: vector<vector<int>> merge(vector<vector<int>>& intervals) { sort(intervals.begin(), intervals.end(), [](const vector<int 阅读全文
posted @ 2025-02-15 20:51 skyler886 阅读(8) 评论(0) 推荐(0)
贪心4
摘要：用最少数量的箭引爆气球 class Solution { public: int findMinArrowShots(vector<vector<int>>& points) { int answer = 1; sort(points.begin(), points.end(), [](vector 阅读全文
posted @ 2025-02-15 20:41 skyler886 阅读(7) 评论(0) 推荐(0)
贪心3
摘要：加油站 class Solution { public: int canCompleteCircuit(vector<int>& gas, vector<int>& cost) { int n = gas.size(); int ans = 0; int min_s = 0, s = 0; for( 阅读全文
posted @ 2025-02-14 21:37 skyler886 阅读(7) 评论(0) 推荐(0)
贪心2
摘要：买卖股票的最佳时机 II class Solution { public: int maxProfit(vector<int>& prices) { int answer = 0; for(int i = 1 ; i < prices.size(); i++) { if(prices[i] - pr 阅读全文
posted @ 2025-02-13 20:45 skyler886 阅读(13) 评论(0) 推荐(0)
贪心1
摘要：分发饼干 class Solution { public int findContentChildren(int[] g, int[] s) { Arrays.sort(g); Arrays.sort(s); int m = g.length, n = s.length; int count = 0 阅读全文
posted @ 2025-02-13 19:39 skyler886 阅读(17) 评论(0) 推荐(0)
回溯4
摘要：非递减子序列 class Solution { public: vector<vector<int>> result; vector<int> path; void backTracking(vector<int>& nums, int startIndex) { if(path.size() > 阅读全文
posted @ 2025-02-12 16:19 skyler886 阅读(11) 评论(0) 推荐(0)
回溯第三天
摘要：93.复原IP地址 class Solution { public: vector<string> result; bool isValid(string & s, int start, int end) { if(start > end) return false; if(s[start] == 阅读全文
posted @ 2025-02-12 15:15 skyler886 阅读(10) 评论(0) 推荐(0)
回溯第二天
摘要：组合总和 class Solution { public: vector<vector<int>> result; vector<int> temp; void backTracking(int startIndex, int& Sum, vector<int>& candidates, int t 阅读全文
posted @ 2025-02-11 21:44 skyler886 阅读(12) 评论(0) 推荐(0)
回溯第一天
摘要：回溯算法理论基础 题目分类：组合 分割 子集 排列 棋盘 其他 模板 ` void backtracking(参数) { if (终止条件) { 存放结果; return; } for (选择：本层集合中元素（树中节点孩子的数量就是集合的大小）) { 处理节点; backtracking(路径，选择 阅读全文
posted @ 2025-02-08 16:25 skyler886 阅读(9) 评论(0) 推荐(0)