a716121的专栏

class Solution {public: string longestPalindrome(string s) { vector<vector<int>> dp(s.size(),vector<int>(s.size(),0)); int res=0; int l=0; int r=0; for(int i=s.size()-1;i>=0;i--){ ...

class Solution {public: vector<vector<int>> threeSum(vector<int>& nums) { vector<vector<int>> res; int n=nums.size(); sort(nums.begin(),nums.end()); for(int i=0;i<n-2;i++){ ...

class Solution {public: string longestCommonPrefix(vector<string>& strs) { if(strs.size()==0) return ""; string res=""; for(int i=0;i<strs[0].size();i++){ for(int j=1;j<strs.size();j++){ ...

class Solution {public: string intToRoman(int num) { string res=""; int nums[]={1000,900,500,400,100,90,50,40,10,9,5,4,1}; string str[]={"M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I"}; int i=0; wh...

class Solution {public: int maxArea(vector<int>& height) { int res=0; int i=0; int j=height.size()-1; while(i<j){ int tmp=(j-i)*min(height[i],height[j]); res=max(res,tmp); ...

class Solution {public: bool isPalindrome(int x) { if(x<0||(x%10==0&&x!=0)) return false; int tmp=x; long rev=0; //整数反转可能溢出，保护一下 while(x!=0){ rev=rev*10+x%10; x/=10; } ...

class Solution {public: int reverse(int x) { int tmp=0; while(x!=0){ if(tmp>INT_MAX/10) return 0; if(tmp<INT_MIN/10) return 0; tmp=tmp*10+x%10; x/=10; } return tm...

class Solution {public: string convert(string s, int numRows) { if(numRows==1) return s; vector<string> rows(numRows); string res; int flag=0; int i=0; for(int k=0;k<s.size();k++){ ...

最多删除一个字符，判断是否能构成回文字符串。b = a[i:j] 表示复制a[i]到a[j-1]a[::-1]相当于倒序，也就是从最后一个元素到第一个元素复制一遍class Solution: def validPalindrome(self, s: str) -> bool: if s == s[::-1]: return True i,j=0...