python leetcode Task1 分治

leetcode 50:

class Solution:
    def myPow(self, x: float, n: int) -> float:
        a=1
        if n<0:
            x=1/x
            n=-n
        if n==0:
            return 1
        while(n>0):
            if n&1:
                a*=x
                x*=x
                n>>=1
                return a

leetcode 53:

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        n=len(nums)
        if n==1:
            return nums[0]
        l=self.maxSubArray(nums[:len(nums)//2])
        r=self.maxSubArray(nums[len(nums)//2:])
        max_l=nums[len(nums)//2 -1]
        t=0
        for i in range(len(nums)//2-1,-1,-1):
            t+=nums[i]
            max_l=max(t,max_l)
        max_r=nums[len(nums)//2]
        t=0
        for i in range(len(nums)//2,len(nums)):
            t+=nums[i]
            max_r=max(t,max_r)
        return max(l,r,max_l+max_r)

leetcode 169:

class Solution:
    def majorityElement(self, nums: List[int]) -> int:
        if not nums:
            return None
        if len(nums)==1:
            return nums[0]
        l=self.majorityElement(nums[:len(nums)//2])
        r=self.majorityElement(nums[len(nums)//2:])
        if l==r:
            return l
        if nums.count(l)>nums.count(r):
            return l
        else:
            return r