leetcode-python 第三周

LeetCode Online Judge
https://leetcode.com/

LeetCode题解
https://github.com/soulmachine/leetcode

1.Combination Sum III [60ms]

#方法1：按照标签提示要用数组和回溯
#做了适当的剪枝
#一直遇到的问题就是result添加了一组解后
#如果再修改会连之前的值都改变
#需要用到深复制，不然最后所有结果都是一样的
import copy
class Solution(object):
    def __init__(self) :
        self.result = []
        self.bt = []
        self.n = 0
        self.k = 0

    def dfs(self, x, j) :
        for i in range(j + 1, 10) :
            self.bt[x] = i
            if x == self.k-1 and sum(self.bt) == self.n :
                tmp = copy.deepcopy(self.bt)
                self.result.append(tmp)
            elif x < self.k-1 and sum(self.bt) < self.n :
                self.dfs(x + 1, i)
        self.bt[x] =0

    def combinationSum3(self, k, n):
        self.bt = [0 for i in range(k)]
        self.result = []
        self.n = n
        self.k = k
        self.dfs(0, 0)
        return self.result

2.Majority Element II [76ms]

#方法1：摩尔投票法
#易得最多有两个元素，所以每三个为一小组，捕捉在小组内出现两次以上的数
#记录前面两个数，如果第三个数不相同就会抵消前面的计数，直到找到大于1的
class Solution(object):
    def majorityElement(self, nums):
        n1 = n2 = 0 
        c1 = c2 = 0
        for i in range(len(nums)) :
            #判断顺序可以避免捕捉到相同的数
            if nums[i] == n1 :
                c1 += 1
            elif nums[i] == n2 :
                c2 += 1
            elif c1 == 0 :
                n1 = nums[i]
                c1 += 1
            elif c2 == 0 :
                n2 = nums[i]
                c2 += 1
            else:
                c1 -= 1
                c2 -= 1

        #再判断是否大于n/3
        c1 = c2 = 0
        for i in range(len(nums)) :
            if nums[i] == n1 : c1 += 1
            if nums[i] == n2 : c2 += 1
        result = []
        if c1 > len(nums)/3 : result.append(n1)
        if c2 > len(nums)/3 : result.append(n2)
        #防止两个都是0
        if len(result) == 2 and n1 == n2 : 
            del result[1]
        return result

3.Missing Number [66ms]

#方法1：需要一点技巧，运用求和公式然后求和做差
class Solution(object):
    def missingNumber(self, nums):
        l = len(nums)
        s = l * (l+1) / 2
        c= sum(nums)
        return int(s-c)

4.Pascal’s Triangle II [56ms]

#方法一：从后面开始遍历对于实时改变值得遍历有奇效
class Solution(object):
    def getRow(self, rowIndex):
        nums = []
        for i in range(rowIndex + 1):
            nums.append(1)
            for i in range(len(nums)-1, -1, -1):
                if i == len(nums)-1 or i == 0:
                    continue
                nums[i] = nums[i-1] + nums[i]
        return nums

5.Product Of Array Element Self [176ms]

#方法1：这题要求线性时间复杂度和常数的空间复杂度
#刚开始毫无头绪，后来参考别人的
#排除当前，先从前往后乘一遍，然后从后往前再乘一遍
class Solution(object):
    def productExceptSelf(self, nums):
        l = len(nums)
        result = [1 for i in range(l)]
        for i in range(1, l):
            result[i] = result[i-1] * nums[i-1]
        tmp = 1
        for i in range(l-1, -1, -1):
            result[i] *= tmp
            tmp *= nums[i]
        return result

6.Rotate Array [84ms]

#方法1：每次退一格，空间是O(1),但是妥妥地超时。
#方法2：直接交换，利用python的分别赋值特性可以省一些临时变量
#加入distance临时变量防止k是n整数倍时在固定几个数打转，之前没留意，参考别人的。
class Solution(object):
    def rotate(self, nums, k):
        tmp = 0
        for i in range(k):
            tmp = nums[-1]
            for i in range(-2, -len(nums)-1, -1):
                nums[i+1] = nums[i]
            nums[0] = tmp

class Solution(object):
    def rotate(self, nums, k):
        length = len(nums)
        tmp = nums[0]
        distance = 0
        index = 0
        for i in range(length):
            index = (index + k) % length
            nums[index], tmp = tmp, nums[index]

            distance = (distance + k) % length
            if distance == 0:
                index = (index + 1) % length
                tmp = nums[index]

7.Summary Range [52ms]

#方法一：整体代码并不优雅，用了太多if
#参考别人的条件
# if(i+1<len(nums) && nums[i+1] == nums[i] + 1)
#运用逻辑短路来判断，用当前元素的后面比较再移动
#而我的是用当前元素的前面来判断，这样最后一个元素还要判断一次
class Solution(object):
    def summaryRanges(self, nums):
        head = 0
        result = []
        if len(nums) == 0 : return result
        if len(nums) == 1 :
            result.append(str(nums[0]))

        for i in range(1, len(nums)):
            if nums[i] - nums[i - 1] != 1:
                if nums[i-1] == nums[head] :
                    result.append(str(nums[i-1]))
                else:
                    result.append(str(nums[head]) + "->" + str(nums[i-1]))
                head = i
            if i == len(nums) - 1:
                if nums[i] == nums[head] :
                    result.append(str(nums[i]))
                else:
                    result.append( str(nums[head]) + "->" + str(nums[i]) )
        return result