mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-25 13:34:54 +08:00
Format code with prettier (#3375)
This commit is contained in:
@ -4,7 +4,12 @@ import java.util.Scanner;
|
||||
|
||||
class TowerOfHanoi {
|
||||
|
||||
public static void shift(int n, String startPole, String intermediatePole, String endPole) {
|
||||
public static void shift(
|
||||
int n,
|
||||
String startPole,
|
||||
String intermediatePole,
|
||||
String endPole
|
||||
) {
|
||||
// if n becomes zero the program returns thus ending the loop.
|
||||
if (n != 0) {
|
||||
// Shift function is called in recursion for swapping the n-1 disc from the startPole to the
|
||||
|
Reference in New Issue
Block a user