我fo慈悲

分类

/ 注册

全部文章（共55篇）

题解 | #礼物的最大价值#

#include <climits> class Solution { public: /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * * * @param grid int整型vector<...

2023-09-01

0 211

题解 | #把数字翻译成字符串#

class Solution { public: /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * * 解码 * @param nums string字符串数字串 * @return int整型 ...

2023-09-01

0 236

题解 | #跳石板#

#include <climits> #include <cmath> #include <iostream> #include<vector> using namespace std; void get_div_num(int n, vector&...

2023-07-24

0 421

题解 | #按之字形顺序打印二叉树#

#include<stack> #include <queue> class Solution1 { public: vector<vector<int> > Print(TreeNode* pRoot) { vector...

2023-07-20

0 321

题解 | #求二叉树的层序遍历#

class Solution { public: vector<vector<int> > levelOrder1(TreeNode* root) { vector<vector<int>> res; if (...

2023-07-20

0 245

题解 | #链表中倒数最后k个结点#

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

2023-07-20

0 246

题解 | #删除链表的节点#

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

2023-07-20

0 244

题解 | #跳台阶#

class Solution { public: int jumpFloor(int number) { int fib[40]={1,1}; for(int i=2;i<=number;++i) { fib[i]...

2023-07-19

0 241

题解 | #没有重复项数字的全排列#

class Solution { public: void permute_(vector<int>& num,vector<vector<int>>& res,int n) { if(n==num.size()-1...

2023-07-19

0 295

题解 | #两数之和#

#include <unordered_map> class Solution { public: vector<int> twoSum(vector<int>& numbers, int target) { vector<i...

2023-07-19

0 290