a天河朔夜a

分类

/ 注册

全部文章（共72篇）

题解 | #最长上升子序列(一)#

class Solution { public: int LIS(vector<int>& arr) { if(arr.size()==0)return 0; vector<int>dp(arr.size()+10,0x3f3f3f3f...

2023-03-19

0 207

题解 | #兑换零钱(一)#

class Solution { public: int minMoney(vector<int>& arr, int aim) { vector<int>dp(aim+1,0x3f3f3f3f); dp[0]=0; fo...

2023-03-19

0 235

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

class Solution { public: int solve(string nums) { nums=nums; vector<pair<int,int>>dp(nums.length()+1,{0,0}); if...

2023-03-18

0 279

题解 | #矩阵的最小路径和#

class Solution { public: int minPathSum(vector<vector<int> >& matrix) { vector<int>dp(matrix[0].size()+1,0x3f3f3f3f); ...

2023-03-18

0 231

题解 | #不同路径的数目(一)#

class Solution { public: int uniquePaths(int m, int n) { vector<int>dp(n+10,0); dp[1]=1; for(int i=1;i<=m;i++) ...

2023-03-18

0 213

题解 | #最长公共子串#

class Solution { public: string LCS(string s1, string s2) { s1=" "+s1,s2=" "+s2; int ma=0xc0c0c0c0; string res=""; ...

2023-03-18

0 248

题解 | #最长公共子序列(二)#

class Solution { public: string LCS(string s1, string s2) { s1=" "+s1,s2=" "+s2; vector<pair<int,string>>dpnow(s2.lengt...

2023-03-18

0 296

题解 | #最小花费爬楼梯#

class Solution { public: int minCostClimbingStairs(vector<int>& cost) { vector<int>dp(cost.size()+1,0); for(int i=2;i&...

2023-03-18

0 211

题解 | #跳台阶#

class Solution { public: int jumpFloor(int number) { int a=1,b=2,res; if(number==1)res=1; else res=2; for(int i=3;...

2023-03-18

0 244

题解 | #斐波那契数列#

class Solution { public: int Fibonacci(int n) { if(n<=2)return 1; return Fibonacci(n-1)+Fibonacci(n-2); } };

2023-03-18

0 255