撒斯泰克大学2020秋季dsaa题目

先上原题

Tower of Hanoi is one of the most famous puzzles in the world. There are three different rods labeled A, B and C. The puzzle starts with the disks in ascending order of size on the A rod (The smallest at the top). You have the following rules:

1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the rods and placing it on top of another rod.
3. No disk can be placed on top of a smaller disk.Since the problem is too popular that you must know how to solve it, we add several constrains to this problem:
4. You cannot move disk between the A rod and the C rod directly.
5. You need to move n disks from the A rod to the C rod.Please write a program to print the minimum number of moves you need to do. Since the result is too large, please print the answer modular 1000000007.If you do not know the modular operation, here is the link:汉诺塔描述

解题思路

加强版的汉诺塔，核心变化是移动必须结果中间一个柱子。表达式是f(n)=3f(n-1)+2,直接写递归就AC了。

代码

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] currentN = new int[n];
        for (int i = 0; i < n; i++) {
            currentN[i] = in.nextInt();
        }
        for (int i = 0; i < n; i++) {
            System.out.println(Hanoi(currentN[i]));
        }
    }
 public static long Hanoi(int n){
            if (n==1){
                return 2;
            }else {
                return (3*Hanoi(n-1)+2)%1000000007;
            }
        }
    }