Solve the Hanoi Tower problem [modified version]

Solving the tower of Hanoi problem 【 Revised edition 】

【 Common topics 】

Title Description ：
Given a by n A tower of disks , These disks are sleeved on the first column in a decreasing way . Now move the whole tower to the third column , Only one disc can be moved at a time , And the larger disc cannot be placed on the smaller disc during movement .
Input ：
Enter only one positive integer n
Output ：
Next, each line outputs one move step .

Here it is , We discuss a simple and well understood approach —— Recursive approach , Since recursion , We just have to think about recursive functions , Let's leave the rest to the function .

【 Code 】

package pers.keafmd.accumulate.codeinterviewguide.hanoi;

import java.util.ArrayList