A level Stack problem:用栈实现十进制到二进制的转换

露娜酱酱

已于 2022-09-13 14:03:04 修改

阅读量140

点赞数

分类专栏： ADT 文章标签： python

于 2022-09-13 14:02:38 首次发布

本文链接：https://blog.csdn.net/u010146618/article/details/126832193

版权

9. Write a program that reads in a positive integer and prints the binary representation of that integer.  Hint:  divide the integer by 2.

Stack 定义，pop和push函数定义

stack = [None for index in range(0, 10)]
basePointer = 0
topPointer = -1
stackFull = 10
item = None


def pop():
    global topPointer, basePointer, item
    item = None
    if topPointer == basePointer - 1:
        print("Stack is empty,cannot pop")
    else:
        item = stack[topPointer]
        stack[topPointer] = None
        topPointer = topPointer - 1

    return item



def push(item):
    global topPointer
    if topPointer < stackFull - 1:
        topPointer = topPointer + 1
        stack[topPointer] = item
    else:
        print("Stack is full, cannot push")