泳池迷宫

最近在看各类Java电子书，遇到Head.First.Java里的算法题，附上题目以及答案，有兴趣的小伙伴可以尝试一下。

1.

 

2. 

 

 

 

-------------------------------------------------------------------------华丽的分割线------------------------------------------------------------------------------

 

 

答案：

1.

public class PoolPuzzleOne {
    public static void main (String[] args) {
        int x = 0;
        while (x < 4){
            System.out.print("a");
            if(x < 1){
                System.out.print(" ");
            }
            System.out.print("n");
            if(x > 1){
                System.out.print(" oyster");
                x = x + 2;
            }
            if(x == 1){
                System.out.print("noys");
            }
            if(x < 1){
                System.out.print("oise");
            }
            System.out.println("");
            x = x + 1;
        }
    }
}

2.

最后一行输出10

public class EchoTestDrive {
    public static void main(String[] args){
        Echo e1 = new Echo();
        Echo e2 = new Echo();
        int x = 0;
        while(x < 4){
            e1.hello();
            e1.count = e1.count + 1;
            if(x == 4){
                e2.count = e2.count + 1;
            }
            if(x < 5){
                e2.count = e2.count + e1.count;
            }
            x = x + 1;
        }
        System.out.println(e2.count);
    }
}

public class Echo {
    int count = 0;
    void hello(){
        System.out.println("helloooo...");
    }
}

最后一行输出24

public class EchoTestDrive {
    public static void main(String[] args){
        Echo e1 = new Echo();
        Echo e2 = e1;
        int x = 0;
        while(x < 4){
            e1.hello();
            e1.count = e1.count + 1;
            if(x == 3){
                e2.count = e2.count + 1;
            }
            if(x > 0){
                e2.count = e2.count + e1.count;
            }
            x = x + 1;
        }
        System.out.println(e2.count);
    }
}

public class Echo {
    int count = 0;
    void hello(){
        System.out.println("helloooo...");
    }
}