Queue = {}

    function Queue.newquene()
        return {count = 0}
    end

    function Queue.push(queue, value)
        queue.count = queue.count+1
        queue[queue.count] = value
    end

    function Queue.pop(queue)
        queue[queue.count] = nil
        queue.count = queue.count-1
    end

    --按入队顺序输出
    function Queue.print( queue )
        local i=1
        while queue[i] do
            print(queue[i])
            i = i+1
        end
    end

    --按出对顺序输出
    function Queue.printReverse( queue )
        local i=queue.count
        while queue[i] do
            print(queue[i])
            i = i-1
        end
    end

    local que = Queue.newquene()

    for i=1, 9 do
        Queue.push(que, i)
    end

    Queue.print(que)
    Queue.pop(que) 
    Queue.printReverse(que)    

 

相关文章:

  • 2021-10-19
  • 2021-08-04
  • 2021-05-07
  • 2021-08-06
  • 2021-12-19
  • 2022-01-08
  • 2021-07-02
  • 2021-08-15
猜你喜欢
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
  • 2022-01-06
  • 2021-12-18
  • 2021-10-11
相关资源
相似解决方案