在海里blueblue

分类

/ 注册

全部文章（共17篇）

题解 | 矩阵的最小路径和

class Solution { public: int minPathSum(vector<vector<int> >& matrix) { int m = matrix.size(), n = matrix[0].size(); ...

2026-01-04

0 14

题解 | 连续子数组的最大和

class Solution { public: int FindGreatestSumOfSubArray(vector<int>& array) { int ans = INT_MIN, f = 0; for (int x : arra...

2026-01-04

0 12

题解 | 跳台阶

class Solution { public: int jumpFloor(int number) { vector<int> dp(number + 1); dp[0] = 1, dp[1] = 1; for (int i = ...

2026-01-04

0 12

题解 | 打家劫舍(二)

class Solution { public: int rob(vector<int>& nums) { int n = nums.size(); if (n == 1) return nums[0]; vector<...

2026-01-04

0 10

题解 | 打家劫舍(一)

class Solution { public: int rob(vector<int>& nums) { int n = nums.size(); int f0 = 0, f1 = 0, f2 = 0; for (int ...

2026-01-04

0 16

题解 | 秘藏

#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { int n, k; cin >> n >> k; vector&l...

2025-12-24

0 18

题解 | 排座椅

// 贪心 #include <bits/stdc++.h> using namespace std; int main() { unordered_map<int, int> row_cnt, col_cnt; vector<pair<int,...

2025-12-21

0 17

题解 | 小红的口罩

// 每日一题小顶堆 #include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; priority_queue<...

2025-12-19

0 17

题解 | 二叉树的最大深度

/** * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {...

2025-12-18

0 19

题解 | 链表内指定区间反转

/** * struct ListNode { * int val; * struct ListNode *next; * ListNode(int x) : val(x), next(nullptr) {} * }; */ class Solution { public: Li...

2025-12-17

0 15