【java】控制台实现贪吃蛇小游戏-LinkedList、Scanner

package com.myproj.snake;

public class Node {
    private int i,j;
    public Node(){}
    public Node(int i, int j) {
        super();
        this.i = i;
        this.j = j;
    }

    public int getI() {
        return i;
    }

    public void setI(int i) {
        this.i = i;
    }

    public int getJ() {
        return j;
    }

    public void setJ(int j) {
        this.j = j;
    }
    @Override
    public int hashCode() {
        final int prime = 31;
        int result = 1;
        result = prime * result + i;
        result = prime * result + j;
        return result;
    }
    @Override
    public boolean equals(Object obj) {
        if (this == obj)
            return true;
        if (obj == null)
            return false;
        if (getClass() != obj.getClass())
            return false;
        Node other = (Node) obj;
        if (i != other.i)
            return false;
        if (j != other.j)
            return false;
        return true;
    }
    
}

package com.myproj.snake;

import java.util.LinkedList;

public class Snake {
    private LinkedList<Node> nodes=new LinkedList<Node>();
    public static final int UP=-5;
    public static final int DOWN=5;
    public static final int LEFT=-1;
    public static final int RIGHT=1;
    private int dir;//当前方向；
    public Snake(){
        nodes.add(new Node(3,9));
        nodes.add(new Node(4,9));
        nodes.add(new Node(5,9));
        nodes.add(new Node(5,10));
        nodes.add(new Node(5,11));
        nodes.add(new Node(6,11));
        nodes.add(new Node(7,11));
        this.dir=RIGHT;
    }
    public boolean contains(int i,int j){
        return nodes.contains(new Node(i,j));
    }
    public void move(){
        nodes.removeLast();
        Node head=nodes.getFirst();
        int i=head.getI()+dir/5;
        int j=head.getJ()+dir%5;
        nodes.addFirst(new Node(i,j));
    }
    public void move(int dir){
        if(this.dir+dir==0){
            System.out.println("不能逆向行驶！");
            System.out.println("游戏终止！");
            System.exit(0);
        }
        this.dir=dir;
        move();
    }
}

package com.myproj.snake;

public class SnakePan {
    private Snake snake=new Snake();
    public Snake getSnake() {
        return snake;
    }
    public void setSnake(Snake snake) {
        this.snake = snake;
    }
    public void paint(){
        for(int i=0;i<=15;i++){
            for(int j=0;j<=40;j++){
                if(i==0||i==15){
                    System.out.print("-");
                }else if(j==0||j==40){
                    System.out.print("|");
                }else if(snake.contains(i,j)){
                    System.out.print("■");
                }else{
                    System.out.print(" ");
                }
            }
            System.out.println();
        }
    }
}

package com.myproj.snake;

import java.util.Scanner;

public class SnakeTest {
    public static void main(String[] args){
        SnakePan snakePan=new SnakePan();
        Snake snake=snakePan.getSnake();
        snakePan.paint();
        /*for(int i=0;i<10;i++){
            snakePan.paint();
            snake.move();
            try {
                Thread.sleep(1000);
            } catch (InterruptedException e) {
                // TODO Auto-generated catch block
                e.printStackTrace();
            }
        }*/
        
        Scanner scanner=new Scanner(System.in);
        System.out.println("请输入方向【上（U）、下（D）、左（L）、右（R）】：");
        while(true){
            String dir=scanner.nextLine();
            if(dir.equalsIgnoreCase("U")){
                snake.move(snake.UP);
            }else if(dir.equalsIgnoreCase("D")){
                snake.move(snake.DOWN);
            }else if(dir.equalsIgnoreCase("L")){
                snake.move(snake.LEFT);
            }else if(dir.equalsIgnoreCase("R")){
                snake.move(snake.RIGHT);
            }else{
                System.exit(0);
            }
            snakePan.paint();
        }        
    }
}