Leetcode习题最接近的三数之和，有效的括号，合并两个有序链表

最接近的三数之和

class Solution:
    def threeSumClosest(self, nums: List[int], target: int) -> int:
    
        nums.sort()
        n=len(nums)
        bestNum=nums[0]+nums[1]+nums[2]for i in range(n-2):
        L=i+1
        R=n-1

        while L<R:
            minNum=nums[L]+nums[L+1]+nums[i]
            if target<minNum:
                if abs(bestNum-target)>abs(minNum-target):
                    bestNum=minNum
                break

            maxNum=nums[R-1]+nums[R]+nums[i]
            if target>maxNum:
                if abs(bestNum-target)>abs(maxNum-target):
                    bestNum=maxNum
                break
            
            tempNum=nums[L]+nums[i]+nums[R]
            if tempNum==target:
                return tempNum

            if abs(tempNum-target)<abs(bestNum-target):
                bestNum=tempNum

            if tempNum>target:
                R-=1
                while (L<R and nums[R]==nums[R+1]): #重复，注意符号
                    R-=1
                
            else:
                L+=1
                while (L<R and nums[L]==nums[L-1]): 
                    L+=1

        while i<n-2 and nums[i]==nums[i+1]:
            i+=1
    
    return bestNum

有效的括号

class Solution:
    def isValid(self, s: str) -> bool:
        hashs={')':'(',']':'[','}':'{'}
        stack=[]   
        
    	for i in s:
        	if i not in hashs:
            	stack.append(i)
        	if i in hashs:
            	if stack and hashs[i]==stack[-1]:
                	stack.pop() #栈顶元素与字典值一样释放
                else:
                	return False
    		return not stack        

合并两个有序链表

class Solution:
    def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
        if not l1:
            return l2 #终止条件-两个链表都为空
        if not l2:
            return l1
        #递归调用
        if l1.val<l2.val:
            l1.next=self.mergeTwoLists(l1.next,l2)
            return l1
        else:
            l2.next=self.mergeTwoLists(l1,l2.next)
            return l2