day 24:backtracking!

Leetcode 77. Combinations:

class Solution:
    def __init__(self):
        self.path = []
        self.res = []
    def combine(self,n , k):
        nums = [i+1 for i in range(n)]
        self.dfs(nums, k)
        return self.res
    def dfs(self, nums, k):
        if nums == None: return
        if len(self.path)==k: 
            self.res.append(self.path[:])
            return
        for i in range(len(nums)):
            self.path.append(nums[i])
            self.dfs(nums[i+1:], k)
            self.path.pop()      

无敌，看完教程直接过啦