线性结构（递归）

简单的实现

package LinearStructure;

/**
 * @author lhc
 * @Title: Recursion
 * @ProjectName dataStructure
 * @Description: 递归
 * @date 2019/1/4下午 5:28
 */
public class Recursion {

    public static void main(String[] args) {
        print(10000);
    }

    public static void print(int i) {
        if (i > 0) {
            System.out.println(i);
            print(i - 1);
        }
    }

}

斐波那契数列

package LinearStructure;

/**
 * @author lhc
 * @Title: Fobonacie
 * @ProjectName dataStructure
 * @Description: 斐波那契数列
 * @date 2019/1/4下午 5:47
 */
public class Fobonacie {

    public static void main(String[] args) {
        int a = feibonaci(20);
        System.out.println(a);
    }

    public static int feibonaci(int i) {
        if (i == 1 || i == 2) {
            return 1;
        } else {
            return feibonaci(i - 1) + feibonaci(i - 2);
        }
    }
}

汉诺塔

package LinearStructure;

/**
 * @author lhc
 * @Title: Hanoi
 * @ProjectName dataStructure
 * @Description: 汉诺塔
 * @date 2019/1/5下午 9:39
 */
public class Hanoi {
    public static void main(String[] args) {
        hanioTest(5, "A", "B", "C");
    }

    /**
     * @param n    盘子数量
     * @param from 开始的柱子
     * @param in   中间的柱子
     * @param to   目标柱子
     */
    public static void hanioTest(int n, String from, String in, String to) {
        if (n == 1) {
            System.out.println("第1个盘子从" + from + "移到" + to);
        } else {
            hanioTest(n - 1, from, to, in);
            System.out.println("第" + n + "个盘子从" + from + "移到" + to);
            hanioTest(n - 1, in, from, to);
        }
    }
}