📜  def dft(self, array): stack = Stack()visited = set() stack.append(self) while len(stack) > 0 and while len(visited) >= 0: current = stack.pop() 数组. append(current)visited.add(current) 返回数组 - Python 代码示例

def dft(self, array):
    stack = Stack()
    visited = set()
    stack.append(self)
    while len(stack) > 0 and while len(visited) >= 0:
        current = stack.pop()
        array.append(current)
        visited.add(current)
    return array