LeetCode-0313

343.整数拆分

def integerBreak(self, n: int) -> int:
#小于3的数返回n-1
    if n<=3:
        return n-1
    #所有大于3的数都可拆分成2,3的加法组合，含有3的乘积更大
    a = n//3
    b = n % 3
    if b == 0:
        return pow(3,a)
    elif b == 1:
        return pow(3,a-1)*2*2
    else:
        return pow(3,a)*2

169.多数元素

#使用Hash表，时间、空间复杂度均为O(n)
def majorityElement(nums):
    thres = len(nums)//2
    from collections import Counter
    dic = Counter(nums)
    return max(dic.keys(), key=dic.get)