leetcode第77题组合--DFS、迭代（栈）

class Solution(object):
    def combine(self, n, k):
        stack_temp=[]
        stack_re=[]
        def DFS(j,deepth):
            if deepth==k+1:
                stack_re.append(stack_temp[:])
            else:
                for i in range(j,n+1):
                    stack_temp.append(i)
                    DFS(i+1,deepth+1)
                    stack_temp.pop(-1)
        DFS(1,1)
        return stack_re