将下面代码转换改写成Python：public int trap6(int[] height) { int sum = 0; Stack<Integer> stack = new Stack<>(); int current = 0; while (current < height.length) { //如果栈不空并且当前指向的高度大于栈顶高度就一直循环 while (!stack.empty() && height[current] > height[stack.peek()]) { int h = height[stack.peek()]; //取出要出栈的元素 stack.pop(); //出栈 if (stack.empty()) { // 栈空就出去 break; } int distance = current - stack.peek() - 1; //两堵墙之前的距离。 int min = Math.min(height[stack.peek()], height[current]); sum = sum + distance * (min - h); } stack.push(current); //当前指向的墙入栈 current++; //指针后移 } return sum; }

以下是Python版的代码实现：

def trap6(height: List[int]) -> int:
    sum = 0
    stack = []
    current = 0
    while current < len(height):
        # 如果栈不空并且当前指向的高度大于栈顶高度就一直循环
        while len(stack) > 0 and height[current] > height[stack[-1]]:
            h = height[stack[-1]] # 取出要出栈的元素
            stack.pop() # 出栈
            if len(stack) == 0: # 栈空就出去
                break
            distance = current - stack[-1] - 1 # 两堵墙之间的距离
            min_height = min(height[stack[-1]], height[current])
            sum += distance * (min_height - h)
        stack.append(current) # 当前指向的墙入栈
        current += 1 # 指针后移
    return sum