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++){ ...

class Solution {public: string longestPalindrome(string s) { int n=s.size(); if(n<2) return s; string res=s.substr(0,1); int max_len=1; vector<vector<bool>> dp(n,vector<bool>(n,false)); ...

class Solution {public: bool Find(int target, vector<vector<int> > array) { int m=array.size(),n=array[0].size(); if(m==0||n==0) return false; int i=0,j=n-1; //右上角开始二分 while(i<m&&j>=0){ .

int main(){ string str; while(cin>>str){ for(int i=str.length()-1;i>=0;i--){ cout<<str[i]; } cout<<endl; } return 0;}int main(){ char ch[1001]; while(cin>>ch){...

Java:法一扫描import java.util.ArrayList;public class Solution { public int minNumberInRotateArray(int [] array) { for(int i=0;i<array.length-1;i++){ if(array[i]>array[i...

c++的string有一个find()函数,返回匹配的索引s="aeiou"s.find(a)class Solution {public: string reverseVowels(string s) { int i = 0,j=s.size()-1; string change="aeiouAEIOU"; while(i<...

给定一个非负整数c，你要判断是否存在两个整数a和b，使得a2+ b2= c。class Solution {public: bool judgeSquareSum(int c) { long i=0,j=sqrt(c); while(i<=j){ long sum=i*i+j*j; ...

给定一个已按照升序排列的有序数组，找到两个数使得它们相加之和等于目标数。函数应该返回这两个下标值 index1 和 index2，其中 index1必须小于index2。双指针class Solution: def twoSum(self, numbers: List[int], target: int) -> List[int]: i = 0 ...

给定一个仅包含大小写字母和空格' '的字符串 s，返回其最后一个单词的长度。如果字符串从左向右滚动显示，那么最后一个单词就是最后出现的单词。如果不存在最后一个单词，请返回 0。split() 通过指定分隔符对字符串进行切片，默认为所有的空字符，包括空格、换行(\n)、制表符(\t)等class Solution: def lengthOfLastWord(self, s:...

DP：nums[i-1]意为到i-1位置的最大子序和给定一个整数数组nums，找到一个具有最大和的连续子数组（子数组最少包含一个元素），返回其最大和。class Solution: def maxSubArray(self, nums: List[int]) -> int: for i in range(1,len(nums)): ...

class Solution {public: int searchInsert(vector<int>& nums, int target) { int n=nums.size(); for(int i=0;i<=n-1;i++){ if(nums[i]>=target) return i; ...

class Solution: def strStr(self, haystack: str, needle: str) -> int: m = len(needle) for i in range(len(haystack)-m+1): if haystack[i:i+m] == needle: ...

class Solution {public: int removeElement(vector<int>& nums, int val) { int len = nums.size(); int i=0,j=0; while(j<len){ if(nums[j]!=val){ ...

删除重复元素class Solution: def removeDuplicates(self, nums: List[int]) -> int: i=1 while i<=len(nums)-1: if nums[i]==nums[i-1]: del nums[i] ...

class Solution {public: ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) { ListNode* head = new ListNode(1); ListNode* ret = head; while (l1 != NULL && l2 != NU...

遍历字符串：左括号入栈右括号分三种情况：1.若此时栈为空，直接返回False2.若此时右括号和栈顶左括号不匹配，直接返回False3.若此时右括号和栈顶左括号匹配，栈顶左括号出栈遍历结束后若栈为空栈，说明所有括号都匹配完成，返回True否则，返回Falseclass Solution: def isValid(self, s: str) -> bool: ...

c++:class Solution {public: string longestCommonPrefix(vector<string>& strs) { if(strs.size()==0) return "";//空字符串 string result = ""; for (int i=0;i<strs[0].s...

给定一个整数数组 nums 和一个目标值 target，请你在该数组中找出和为目标值的那 两个 整数，并返回他们的数组下标。def twoSum(nums, target): lens = len(nums) j=-1 for i in range(1,lens): temp = nums[:i] if (target - nums[i])...

Python：class Solution(object): def isPalindrome(self, x): lst=list(str(x)); l,r = 0,len(lst)-1 while l<=r: if lst[l]!=lst[r]: return False...

C++：class Solution {public: int romanToInt(string s) { int result=0; map<char, int> mp = { {'I',1} ,{'V', 5} ,{'X', 10},{'L', 50} ,{'C', 100} ,{'D', 500} ,{'M', 1000} }; ...