我正在為家庭作業(yè)做河內(nèi)塔作業(yè)。我試圖將 i 變量每次增加 1，但它增加了 2。此外， ("[g]et, [p]ut... 字符串被打印兩次，而不是一次。發(fā)生了什么？！請(qǐng)幫忙！>我嘗試添加一個(gè) i--; 在 if (p) 上，但這不起作用。import java.util.Scanner;/** * Simulates a tower that can hold disks. * @author S. Camilleri * @author <your name> */public class TowersOfHanoi { public static void main(String[] args) { Scanner input = new Scanner(System.in); // This array holds the disks. A 0 represents no disk. int[] tower = new int[5]; // This index represents the first available empty spot for a disk. int index = 0; int towerCounter = 0; int length = tower.length; boolean playing = true; while (playing) { /******************** * Display the tower ********************/ System.out.println(); System.out.print("{ "); while (towerCounter < length) { tower[towerCounter] = 0; System.out.print(tower[towerCounter]); towerCounter = towerCounter + 1; } String choice; int size; for (int i=0; i<length; i++) { /******************** * Get action from user ********************/ System.out.println(); System.out.println("[g]et, [p]ut or [e]xit?"); choice = input.nextLine(); // Get if (choice.equals("g")) { tower[i] = 0; System.out.println(); towerCounter = 0; i--; System.out.print("{ "); while (towerCounter < length) { System.out.print(tower[towerCounter]); towerCounter = towerCounter + 1; } } } } } }作為回答者的請(qǐng)求，我發(fā)布了整個(gè)代碼。
2 回答
開滿天機(jī)
TA貢獻(xiàn)1786條經(jīng)驗(yàn) 獲得超13個(gè)贊
("[g]et, [p]ut... 字符串被打印兩次，因?yàn)樵谀斎氩?Enter 后，for 循環(huán)會(huì)為您輸入的輸入運(yùn)行一次，再為“enter”運(yùn)行一次輸入后按下按鈕
根據(jù)你想要的，在 else if (choice.equals("p")) this elsed if 塊中減少 i
else if (choice.equals("p")){
//your code
i--;
}
慕沐林林
TA貢獻(xiàn)2016條經(jīng)驗(yàn) 獲得超9個(gè)贊
我建議使用Recursion，“公式”要容易得多：這是代碼：
public class TowerOf_Hanoi {
public static void main(String [] args){
java.util.Scanner input=new java.util.Scanner(System.in);
System.out.print("Enter Number of Disks: ");
int numDisk=input.nextInt();
System.out.println("Moves are: ");
steps(numDisk,'A','B','C');
}
public static void steps(int n, char fromTower, char toTower, char auxTower){
//base case for Recursion
if(n==1) //if n=1 it will stop
System.out.println("Move disk "+n+" from "+fromTower+" to "+toTower);
else{
steps(n-1,fromTower,auxTower,toTower); //recursion
System.out.println("Move disk "+n+" from "+fromTower+" to "+toTower);
steps(n-1,auxTower,toTower,fromTower);
}
}
}
添加回答
舉報(bào)
0/150
提交
取消