/**
     * 兔子繁殖 斐波那契數列
     */
    @Test
    public void testFibonacci() {

        List<Integer> integers = new ArrayList<>();
        for (int i = 1; i <= 10; i++) {
            if (i == 1 || i == 2) {
                integers.add(1);
            } else {
                integers.add(integers.get(integers.size() 
 
- 1) + integers.get(integers.size() - 2));
            }
        }
        System.out.println(integers.toString());
    }

    /**
     * 判斷0-100之間有多少個素數，並輸出所有素數
     */
    @Test
    public void testPrime() {
        int j;
        for (int i = 0; i <= 100; i++) {
            if (i % 2 == 0 && i != 2) {
                
 
continue; //偶數和1排除
            }
            System.out.println(i);
            for (j = 2; j <= Math.sqrt(i); j++) {
                if (i % j == 0) {
                    System.out.println(i);
                    break;
                }
            }

        }
    }

    /**
     * 九九乘法表
     */
    @Test
    
 
public void testNine() {
        for (int i = 1; i <= 9; i++) {
            for (int j = 1; j <= i; j++) {
                System.out.print(j + "*" + i + "=" + i * j);
                System.out.print(" ");
            }
            System.out.println("\t");
        }
    }

    /**
     * 水仙花數
     */
    @Test
    public void shuixianhua() {
        for (int i = 100; i <= 999; i++) {
            int a = i % 10;
            int b = i / 10 % 10;
            int c = i / 100;
            if (a * a * a + b * b * b + c * c * c == i) {
                System.out.println(i);
            }
        }
    }

    /**
     * 查詢某個數所有的因數
     */
    @Test
    public void testYinShu() {
        int num = 90;
        int k = 2;
        while (num >= k) {
            if (num == k) {
                System.out.print(num);
                System.out.print("");
            } else if (num % k == 0) {
                num = num / k;
                System.out.print(k);
                System.out.print("");
            }
            k++;
        }
    }