Write a Java program for solving the Tower of Hanoi Problem.

1.	Write a Java program for solving the Tower of Hanoi Problem.
Answer» public CLASS InterviewBit{ //Recursive Method for SOLVING the Tower of hanoi. private static void TOH(CHAR source, char auxiliary, char destination, int numOfDisk){ if (numOfDisk > 0){ TOH(source, destination, auxiliary, numOfDisk-1); System.out.println("Move 1 disk from "+source+" to "+destination+" using "+auxiliary+"."); TOH(auxiliary, source, destination, numOfDisk-1); } } public static void main(String[] args) { TOH('A','B','C', 3); }} In the above code we are first moving the n-1 disk from Tower A to Tower B, then moving that nth disk from Tower A to Tower C, and finally, the remaining n-1 disk from Tower B to Tower C. And we are doing this recursively for the n-1 disk.

Answer»

public CLASS InterviewBit{ //Recursive Method for SOLVING the Tower of hanoi. private static void TOH(CHAR source, char auxiliary, char destination, int numOfDisk){ if (numOfDisk > 0){ TOH(source, destination, auxiliary, numOfDisk-1); System.out.println("Move 1 disk from "+source+" to "+destination+" using "+auxiliary+"."); TOH(auxiliary, source, destination, numOfDisk-1); } } public static void main(String[] args) { TOH('A','B','C', 3); }}

In the above code we are first moving the n-1 disk from Tower A to Tower B, then moving that nth disk from Tower A to Tower C, and finally, the remaining n-1 disk from Tower B to Tower C. And we are doing this recursively for the n-1 disk.

Discussion

No Comment Found

Related InterviewSolutions

Implement Binary Search in Java using recursion.
Write a Java program for solving the Tower of Hanoi Problem.
Write a java program to check if any number given as input is the sum of 2 prime numbers.
Write a Java program to rotate arrays 90 degree clockwise by taking matrices from user input.
Write a Java program to reverse a string.
Write a Java program to create and throw custom exceptions.
Write a Java Program to check if any number is a magic number or not. A number is said to be a magic number if after doing sum of digits in each step and inturn doing sum of digits of that sum, the ultimate result (when there is only one digit left) is 1.
Given an array of non-duplicating numbers from 1 to n where one number is missing, write an efficient java program to find that missing number.
Write a Java Program to find the factorial of a given number.
Write a Java program to check if the two strings are anagrams.