a天河朔夜a

分类

/ 注册

全部文章（共72篇）

题解 | #买卖股票的最好时机(三)#

class Solution { public: int maxProfit(vector<int>& prices) { int d1=-prices[0],d2=0,d3=d1,d4=0; for(auto x:prices) {...

2023-03-20

0 268

题解 | #买卖股票的最好时机(二)#

class Solution { public: int maxProfit(vector<int>& prices) { int count=0,in=prices[0],out=in; for(auto x:prices) { ...

2023-03-20

0 258

题解 | #买卖股票的最好时机(一)#

class Solution { public: int maxProfit(vector<int>& prices) { int in=0x3f3f3f3f,out=0; for(auto x:prices)in=min(in,x),out=max...

2023-03-20

0 243

题解 | #打家劫舍(二)#

class Solution { public: int rob(vector<int>& nums) { vector<int>dp(nums.size()+10,0); int res1,res2; dp[1]=nu...

2023-03-20

0 252

题解 | #打家劫舍(一)#

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

2023-03-20

0 265

题解 | #最长的括号子串#

class Solution { public: int longestValidParentheses(string s) { s=" "+s; vector<int>dp(s.length()+10,0); int res=0; for(int...

2023-03-19

0 226

题解 | #正则表达式匹配#

class Solution { public: bool match(string str, string pattern) { vector<vector<bool>>dp(str.length()+10,vector<bool>(pat...

2023-03-19

0 278

题解 | #编辑距离(一)#

class Solution { public: int editDistance(string str1, string str2) { vector<vector<int>>dp(str1.length()+10,vector<int>(s...

2023-03-19

0 326

题解 | #最长回文子串#

class Solution { public: string change(string&b) { string res="&#"; for(auto x:b)res=res+x+'#'; return res+'*'; } ...

2023-03-19

0 254

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

class Solution { public: int FindGreatestSumOfSubArray(vector<int> array) { int res=0xc0c0c0c0,ma=res; for(auto x:array)res=...

2023-03-19

0 208