Java 在小程序中调用函数repaint()后,如何重新绘制?

Java 在小程序中调用函数repaint()后,如何重新绘制?,java,swing,applet,paint,repaint,Java,Swing,Applet,Paint,Repaint,我知道repaint()函数不会立即重新绘制帧。但是,这里的repait方法是在递归函数期间调用的,并且仅在towerOfHanoi函数完成后重新绘制。在递归函数的每次迭代过程中,是否有一种方法可以立即调用paint函数重新绘制 public void actionPerformed(ActionEvent e) { if (e.getSource() == start) { num = number.getText().trim(); numDisk

我知道repaint()函数不会立即重新绘制帧。但是,这里的repait方法是在递归函数期间调用的,并且仅在towerOfHanoi函数完成后重新绘制。在递归函数的每次迭代过程中,是否有一种方法可以立即调用paint函数重新绘制

public void actionPerformed(ActionEvent e) {
    if (e.getSource() == start) {
        num = number.getText().trim();  
        numDisks = Integer.parseInt(num);

        //start the tower of hanoi function catch block used because of the delay function
        repaint();

        height[0].changeHeight(numDisks);
        begin = true;
        towerOfHanoi(numDisks, 0, 2, 1);
        //repaint();
    }

}


//initialize the pegs; first thing called when applet starts
public void paint(Graphics g) {
    g.setColor(Color.BLUE);
    g.fillRect(20, 190, 560, 10); //base
    g.fillRect(70, 60, 10, 150); //first peg
    g.fillRect(300, 60, 10, 150); //second peg
    g.fillRect(530, 60, 10, 150); //third peg

    //create the painting based on the amount of disks, starting with the biggest disk. 
    //when this is repainted, it will draw the new disks in different pegs with different coordinates
    g.setColor(Color.RED);
    for (int i = 0; i < numDisks; i++) {
        g.fillRect(disks[i].xPos, disks[i].yPos, disks[i].width, 10);
    }
}

public void update(Graphics g) {
    paint(g);
}


public void towerOfHanoi(int N, int from, int to, int temp) {

    if (N == 1) {
        moveTo(from, to, N);
    }
    else {
        towerOfHanoi(N - 1, from, temp, to);
        moveTo(from, to, N);
        towerOfHanoi(N - 1, temp, to, from);
    }
}

//change move to function move disks from 1st stack to the 3rd stack
public void moveTo(int from, int to, int diskNum)  {        
    System.out.println(from + "->" + to);

    //adjust the disk number to match the indexing of the way I 
    //used the disk number, as an index of arrays starting from
    //the bottom up at 0.
    if (numDisks == 1) {
        if (diskNum == 1) { diskNum = 0;}
    }
    else if (numDisks == 2) {
        if (diskNum == 1) {diskNum = 1; }
        else if (diskNum == 2) {diskNum = 0; }
    }
    else if (numDisks == 3) {
        if (diskNum == 1) { diskNum = 2;}
        else if (diskNum == 2) {diskNum = 1;}
        else if (diskNum == 3) {diskNum = 0;}
    }
    else if (numDisks == 4) {
        if (diskNum == 1) { diskNum = 3;}
        else if (diskNum == 2) {diskNum = 2;}
        else if (diskNum == 3) {diskNum = 1;}
        else if (diskNum == 4) {diskNum = 0;}
    }
    else if (numDisks == 5) {
        if (diskNum == 1) { diskNum = 4;}
        else if (diskNum == 2) {diskNum = 3;}
        else if (diskNum == 3) {diskNum = 2;}
        else if (diskNum == 4) {diskNum = 1;}
        else if (diskNum == 5) {diskNum = 0;}
    }
    else if (numDisks == 6) {
        if (diskNum == 1) { diskNum = 5;}
        else if (diskNum == 2) {diskNum = 4;}
        else if (diskNum == 3) {diskNum = 3;}
        else if (diskNum == 4) {diskNum = 2;}
        else if (diskNum == 5) {diskNum = 1;}
        else if (diskNum == 6) {diskNum = 0;}
    }
    else if (numDisks == 7) {
        if (diskNum == 1) { diskNum = 6;}
        else if (diskNum == 2) {diskNum = 5;}
        else if (diskNum == 3) {diskNum = 4;}
        else if (diskNum == 4) {diskNum = 3;}
        else if (diskNum == 5) {diskNum = 2;}
        else if (diskNum == 6) {diskNum = 1;}
        else if (diskNum == 7) {diskNum = 0;}
    }   


    //diskNum += height[from].height;
    System.out.println("Disk moving is disk # " + diskNum);
    topDisk = diskNum;

    height[from].pop();
    height[to].push();

    System.out.println("Height of Peg 1: " + height[0].height);
    System.out.println("Height of Peg 2: " + height[1].height);
    System.out.println("Height of Peg 3: " + height[2].height);
    /* we can do this the hard way and calculate the xPos and yPos
     * We might just have to create the disk1 - disk7 each with its own widths, every disk 
     * has the same height. Every disk has its own xPos and yPos.
     * when we do that, we will then need to calculate the appropriate xPos for each..
     * but how do we calculate the yPos????? 
     * yPos is calculated based on the height of the pegs...
     * So now how do we calculate what the top disk number is?
     *  
    */  


    if (from == 0 && to == 1) { //adjust the new xPos
        disks[topDisk].from0to1(); //change xPos
        if (height[1].height == 0) { //adjusts the new yPos
            disks[topDisk].yPos = 175;
        } else if (height[1].height == 1) {
            disks[topDisk].yPos = 165;
        } else if (height[1].height == 2) {
            disks[topDisk].yPos = 155;
        } else if (height[1].height == 3) {
            disks[topDisk].yPos = 145;
        } else if (height[1].height == 4) {
            disks[topDisk].yPos = 135;
        } else if (height[1].height == 5) {
            disks[topDisk].yPos = 125;
        } else if (height[1].height == 6) {
            disks[topDisk].yPos = 115;
        } else if (height[1].height == 7) {
            disks[topDisk].yPos = 105;
        }
    } else if (from == 1 && to == 2) {
        disks[topDisk].from1to2();
        if (height[2].height == 0) { //adjusts the new yPos
            disks[topDisk].yPos = 175;
        } else if (height[2].height == 1) {
            disks[topDisk].yPos = 165;
        } else if (height[2].height == 2) {
            disks[topDisk].yPos = 155;
        } else if (height[2].height == 3) {
            disks[topDisk].yPos = 145;
        } else if (height[2].height == 4) {
            disks[topDisk].yPos = 135;
        } else if (height[2].height == 5) {
            disks[topDisk].yPos = 125;
        } else if (height[2].height == 6) {
            disks[topDisk].yPos = 115;
        } else if (height[2].height == 7) {
            disks[topDisk].yPos = 105;
        }
    } else if (from == 0 && to == 2) {
        disks[topDisk].from0to2();
        if (height[2].height == 0) { //adjusts the new yPos
            disks[topDisk].yPos = 175;
        } else if (height[2].height == 1) {
            disks[topDisk].yPos = 165;
        } else if (height[2].height == 2) {
            disks[topDisk].yPos = 155;
        } else if (height[2].height == 3) {
            disks[topDisk].yPos = 145;
        } else if (height[2].height == 4) {
            disks[topDisk].yPos = 135;
        } else if (height[2].height == 5) {
            disks[topDisk].yPos = 125;
        } else if (height[2].height == 6) {
            disks[topDisk].yPos = 115;
        } else if (height[2].height == 7) {
            disks[topDisk].yPos = 105;
        }
    } else if (from == 1 && to == 0) {
        disks[topDisk].from1to0();
        if (height[0].height == 0) { //adjusts the new yPos
            disks[topDisk].yPos = 175;
        } else if (height[0].height == 1) {
            disks[topDisk].yPos = 165;
        } else if (height[0].height == 2) {
            disks[topDisk].yPos = 155;
        } else if (height[0].height == 3) {
            disks[topDisk].yPos = 145;
        } else if (height[0].height == 4) {
            disks[topDisk].yPos = 135;
        } else if (height[0].height == 5) {
            disks[topDisk].yPos = 125;
        } else if (height[0].height == 6) {
            disks[topDisk].yPos = 115;
        } else if (height[0].height == 7) {
            disks[topDisk].yPos = 105;
        }
    } else if (from == 2 && to == 0) {
        disks[topDisk].from2to0();
        if (height[0].height == 0) { //adjusts the new yPos
            disks[topDisk].yPos = 175;
        } else if (height[0].height == 1) {
            disks[topDisk].yPos = 165;
        } else if (height[0].height == 2) {
            disks[topDisk].yPos = 155;
        } else if (height[0].height == 3) {
            disks[topDisk].yPos = 145;
        } else if (height[0].height == 4) {
            disks[topDisk].yPos = 135;
        } else if (height[0].height == 5) {
            disks[topDisk].yPos = 125;
        } else if (height[0].height == 6) {
            disks[topDisk].yPos = 115;
        } else if (height[0].height == 7) {
            disks[topDisk].yPos = 105;
        }
    } else if (from == 2 && to == 1) {
        disks[topDisk].from2to1();
        if (height[1].height == 0) { //adjusts the new yPos
            disks[topDisk].yPos = 175;
        } else if (height[1].height == 1) {
            disks[topDisk].yPos = 165;
        } else if (height[1].height == 2) {
            disks[topDisk].yPos = 155;
        } else if (height[1].height == 3) {
            disks[topDisk].yPos = 145;
        } else if (height[1].height == 4) {
            disks[topDisk].yPos = 135;
        } else if (height[1].height == 5) {
            disks[topDisk].yPos = 125;
        } else if (height[1].height == 6) {
            disks[topDisk].yPos = 115;
        } else if (height[1].height == 7) {
            disks[topDisk].yPos = 105;
        }
    }
    try {
        Thread.sleep(50);
    } catch(Exception ex) {

    }
    repaint();
}
public void actionPerformed(ActionEvent e){
如果(如getSource()==开始){
num=number.getText().trim();
numDisks=Integer.parseInt(num);
//启动因延迟功能而使用的河内塔功能捕捉块
重新油漆();
高度[0]。更改高度(numDisks);
开始=真;
towerOfHanoi(numDisks,0,2,1);
//重新油漆();
}
}
//初始化销钉;小程序启动时调用的第一件事
公共空间涂料(图g){
g、 setColor(Color.BLUE);
g、 fillRect(2019056010);//base
g、 fillRect(70,60,10150);//第一个销钉
g、 fillRect(300,60,10,150);//第二个peg
g、 fillRect(530,60,10150);//第三个peg
//根据磁盘数量创建绘图,从最大的磁盘开始。
//重新绘制时,它将以不同的坐标在不同的桩中绘制新磁盘
g、 setColor(Color.RED);
对于(int i=0;i”+到);
//调整磁盘编号,使其与I方式的索引匹配
//使用磁盘号作为从
//底部向上为0。
如果(numDisks==1){
如果(diskNum==1){diskNum=0;}
}
else if(numDisks==2){
如果(diskNum==1){diskNum=1;}
如果(diskNum==2){diskNum=0;}
}
否则如果(numDisks==3){
如果(diskNum==1){diskNum=2;}
如果(diskNum==2){diskNum=1;}
如果(diskNum==3){diskNum=0;}
}
else if(numDisks==4){
如果(diskNum==1){diskNum=3;}
如果(diskNum==2){diskNum=2;}
如果(diskNum==3){diskNum=1;}
如果(diskNum==4){diskNum=0;}
}
否则如果(numDisks==5){
如果(diskNum==1){diskNum=4;}
如果(diskNum==2){diskNum=3;}
如果(diskNum==3){diskNum=2;}
如果(diskNum==4){diskNum=1;}
如果(diskNum==5){diskNum=0;}
}
else if(numDisks==6){
如果(diskNum==1){diskNum=5;}
如果(diskNum==2){diskNum=4;}
如果(diskNum==3){diskNum=3;}
如果(diskNum==4){diskNum=2;}
如果(diskNum==5){diskNum=1;}
如果(diskNum==6){diskNum=0;}
}
else if(numDisks==7){
如果(diskNum==1){diskNum=6;}
如果(diskNum==2){diskNum=5;}
如果(diskNum==3){diskNum=4;}
如果(diskNum==4){diskNum=3;}
如果(diskNum==5){diskNum=2;}
如果(diskNum==6){diskNum=1;}
如果(diskNum==7){diskNum=0;}
}   
//diskNum+=高度[from]。高度;
System.out.println(“磁盘移动是磁盘#”+diskNum);
topDisk=diskNum;
高度[from].pop();
高度[to].push();
System.out.println(“桩1的高度:+Height[0]。Height”);
System.out.println(“桩的高度2:+Height[1]。Height”);
System.out.println(“桩的高度3:+Height[2]。Height”);
/*我们可以用很难的方法来计算xpo和ypo
*我们可能只需要创建disk1-disk7,每个磁盘都有自己的宽度
*具有相同的高度。每个磁盘都有自己的XPO和YPO。
*当我们这样做的时候,我们将需要为每个..计算适当的XPO。。
*但我们如何计算YPO?????
*yPos是根据桩的高度计算的。。。
*那么现在我们如何计算最上面的磁盘数呢?
*  
*/  
如果(from==0&&to==1){//调整新的XPO
磁盘[topDisk]。从0到1();//更改XPO
如果(高度[1]。高度==0){//调整新的YPO
磁盘[topDisk].yPos=175;
}else if(高度[1]。高度==1){
磁盘[topDisk].yPos=165;
}else if(高度[1]。高度==2){
磁盘[topDisk].yPos=155;
}else if(高度[1]。高度==3){
磁盘[topDisk].yPos=145;
}else if(高度[1]。高度==4){
磁盘[topDisk].yPos=135;
}else if(高度[1]。高度==5){
磁盘[topDisk].yPos=125;
}else if(高度[1]。高度==6){
磁盘[topDisk].yPos=115;
}else if(高度[1]。高度==7){
磁盘[topDisk].yPos=105;
}
}else if(from==1&&to==2){
磁盘[topDisk].from1to2();
如果(高度[2]。高度==0){//调整新的YPO
磁盘[topDisk].yPos=175;
}else if(高度[2]。高度==1){
磁盘[topDisk].yPos=165;
}else if(高度[2]。高度==2){
磁盘[topDisk].yPos=155;
}else if(高度[2]。高度==3){
磁盘[topDisk].yPos=145;
}else if(高度[2]。高度==4){
磁盘[topDisk].yPos=135;
}else if(高度[2]。高度==5){
磁盘[topDisk].yPos=125;
}else if(高度[2]。高度==6){
磁盘[topDisk].yPos=115;
}else if(高度[2]。高度==7){
磁盘[topDisk].yPos=105