leetcode 46-> Permutations
Givenacollectionof distinct integers,returnallpossiblepermutations.classSolution(object):defpermute(self,nums):""":typenums:List[int]:rtype:List...
leetcode 18-> 4Sum
classSolution(object):deffourSum(self,nums,target):""":typenums:List[int]:typetarget:int:rtype:List[List[int]]"""l=len(nums)nums.sort()ifl<4:return[]re...
leetcode 17-> Letter Combinations of a Phone Number
classSolution(object):defletterCombinations(self,digits):""":typedigits:str:rtype:List[str]"""ifdigits=="":return[]nums_to_letters={2:"abc",3:"def",4:"ghi...
leetcode 16-> 3Sum Closest
Givenanarray nums of n integersandaninteger target,findthreeintegersin nums suchthatthesumisclosestto target.Retur...
leetcode 15-> 3Sum
classSolution(object):defthreeSum(self,nums):res=[]nums.sort()foriinxrange(len(nums)-2):ifi>0andnums[i]==nums[i-1]:continuel,r=i+1,len(nums)-1whilel<...
leetcode 14-> Longest Common Prefix
note：Allgiveninputsareinlowercaseletters a-z.classSolution(object):deflongestCommonPrefix(self,strs):""":typestrs:List[str]:rtype:str"""iflen(strs)==...
leetcode 13 -> Roman to Integer
classSolution(object):defromanToInt(self,s):""":types:str:rtype:int"""lista={'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000}Value_sum=0last_Value=0for...
leetcode 12 -> Integer to Roman
classSolution(object):defintToRoman(self,num):""":typenum:int:rtype:str"""ifnum==0:return""ifnum>=1000:return"M"+self.intToRoman(num-1000)elifnum>=9...
leetcode 9 -> Palindrome Number
classSolution(object):defisPalindrome(self,x):""":typex:int:rtype:bool"""s=str(x)if(s==s[::-1]):returnTrueelse:returnFalse ...
leetcode 5-> Longest Palindromic Substring
classSolution(object):defget_f_l(self,s_length,s,list_all,last_d):max_l=0first_d=0last_d=0foriinrange(len(list_all)):if((i+1)==len(list_all)):breakforjinr...