zoukankan      html  css  js  c++  java
  • Python汉诺塔问题

    实现和线上汉诺塔移动问题

    def hannuo(n,a,b,c):
        if n == 1:
            print(a,"->",c)
        else:
            hannuo(n-1,a,c,b)#将最后一个盘子移到c
            print(a,"->",c)#将剩余的盘子移动c 
            hannuo(n-1,b,a,c)
    n = int(input())
    hannuo(n,"A","B","C")

    汉诺塔问题可视化

    #(参考修改于https://blog.csdn.net/weixin_44046046/article/details/88858031)
    import turtle
    turtle.setup(width=0.99, height=0.99)
    class Stack:
        def __init__(self):
           self.items = []
        def isEmpty(self):
            return len(self.items) == 0
        def push(self, item):
            self.items.append(item)
        def pop(self):
            return self.items.pop()
        def peek(self):
            if not self.isEmpty():
                return self.items[len(self.items) - 1]
        def size(self):
            return len(self.items)
    turtle.done
    def drawpole_3():
        t = turtle.Turtle()
        t.hideturtle()
        def drawpole_1(k):
            t.up()
            t.pensize(10)
            t.speed(100)
            t.goto(400*(k-1), 300)
            t.down()
            t.goto(400*(k-1), -100)
            t.goto(400*(k-1)-20, -100)
            t.goto(400*(k-1)+20, -100)
        drawpole_1(0)
        drawpole_1(1)
        drawpole_1(2)
    def creat_plates(n):
        plates=[turtle.Turtle() for i in range(n)]
        for i in range(n):
            plates[i].up()
            plates[i].hideturtle()
            plates[i].shape("square")
            plates[i].shapesize(1,20-i)
            plates[i].goto(-400,-90+20*i)
            plates[i].showturtle()
        return plates
    def pole_stack():
        poles=[Stack() for i in range(3)]
        return poles
    def moveDisk(plates,poles,fp,tp):
        mov=poles[fp].peek()
        plates[mov].goto((fp-1)*400,300)
        plates[mov].goto((tp-1)*400,300)
        l=poles[tp].size()
        plates[mov].goto((tp-1)*400,-90+20*l)
    def moveTower(plates,poles,height,fromPole, toPole, withPole): 
        if height >= 1:
            moveTower(plates,poles,height-1,fromPole,withPole,toPole)
            moveDisk(plates,poles,fromPole,toPole)
            poles[toPole].push(poles[fromPole].pop())
            moveTower(plates,poles,height-1,withPole,toPole,fromPole)
    myscreen=turtle.Screen()
    drawpole_3()
    n=3
    plates=creat_plates(n)
    poles=pole_stack()
    for i in range(n):
        poles[0].push(i)
    moveTower(plates,poles,n,0,2,1)
    myscreen.exitonclick()
  • 相关阅读:
    POJ2503——Babelfish
    深入理解Spring AOP之二代理对象生成
    怎样让索引仅仅能被一个SQL使用
    Linux下改动Oracle数据库字符集命令
    LeetCode15:3Sum
    【C语言】编写函数实现库函数atoi,把字符串转换成整形
    Scala入门到精通——第二十二节 高级类型 (一)
    J2SE核心开发实战(一)——认识J2SE
    A glance on VDBI
    zookeeper 配置文件说明(zoo.cfg)
  • 原文地址:https://www.cnblogs.com/linjiaxin59/p/12601852.html
Copyright © 2011-2022 走看看