The n-queenspuzzleistheproblemofplacing n queensonan n×n chessboardsuchthatnotwoqueensattackeachother.Givenaninteger n,returnalldi...

Supposeasortedarrayisrotatedatsomepivotunknowntoyoubeforehand.(i.e., Followup for"FindMinimuminRotatedSortedArray":Whatif duplicates&nb...

3Ddp问题 classSolution{public:boolisScramble(strings1,strings2){//StarttypingyourC/C++solutionbelow//DONOTwriteintmain()functionintN=s1.size();if(N!=s2.size(...

/***Definitionforsingly-linkedlist.*structListNode{*intval;*ListNode*next;*ListNode(intx):val(x),next(NULL){}*};*/classSolution{public:ListNode*partition(ListNo...

Givenanarrayofintegers,everyelementappears#twiceexceptforone.Findthatsingleone.classSolution(object):defsingleNumber(self,nums):""":typenums:List[int]:rtype:int...

 Givenastring s consistsofupper/lower-casealphabetsandemptyspacecharacters '',returnthelengthoflastwordinthestring.Ifthelastworddoesnotexist...

 Givenanintegerarray nums,findthecontiguoussubarray (containingatleastonenumber)whichhasthelargestsumandreturnitssum.classSolution(object):defmax...

 Givenacollectionof distinct integers,returnallpossiblepermutations.classSolution(object):defpermute(self,nums):""":typenums:List[int]:rtype:List...

 classSolution(object):defdivide(self,dividend,divisor):""":typedividend:int:typedivisor:int:rtype:int"""ispositive=Trueifdividend>0anddivisor<0:ispo...

 #Definitionforsingly-linkedlist.#classListNode(object):#def__init__(self,x):#self.val=x#self.next=NoneclassSolution(object):defremoveNthFromEnd(self,head,...

 classSolution(object):deffourSum(self,nums,target):""":typenums:List[int]:typetarget:int:rtype:List[List[int]]"""l=len(nums)nums.sort()ifl<4:return[]re...

 classSolution(object):defletterCombinations(self,digits):""":typedigits:str:rtype:List[str]"""ifdigits=="":return[]nums_to_letters={2:"abc",3:"def",4:"ghi...

 Givenanarray nums of n integersandaninteger target,findthreeintegersin nums suchthatthesumisclosestto target.Retur...

 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<...

 note：Allgiveninputsareinlowercaseletters a-z.classSolution(object):deflongestCommonPrefix(self,strs):""":typestrs:List[str]:rtype:str"""iflen(strs)==...