• ㊗️
• 大家
• offer
• 多多！

## Problem

Design a Snake game that is played on a device with screen size height x width. Play the game online if you are not familiar with the game.

The snake is initially positioned at the top left corner (0, 0) with a length of 1 unit.

You are given an array food where food[i] = (ri, ci) is the row and column position of a piece of food that the snake can eat. When a snake eats a piece of food, its length and the game’s score both increase by 1.

Each piece of food appears one by one on the screen, meaning the second piece of food will not appear until the snake eats the first piece of food.

When a piece of food appears on the screen, it is guaranteed that it will not appear on a block occupied by the snake.

The game is over if the snake goes out of bounds (hits a wall) or if its head occupies a space that its body occupies after moving (i.e. a snake of length 4 cannot run into itself).

Implement the SnakeGame class:

SnakeGame(int width, int height, int[][] food) Initializes the object with a screen of size height x width and the positions of the food. int move(String direction) Returns the score of the game after applying one direction move by the snake. If the game is over, return -1.

Example 1:

Input
["SnakeGame", "move", "move", "move", "move", "move", "move"]
[[3, 2, [[1, 2], [0, 1]]], ["R"], ["D"], ["R"], ["U"], ["L"], ["U"]]
Output
[null, 0, 0, 1, 1, 2, -1]

Explanation
SnakeGame snakeGame = new SnakeGame(3, 2, [[1, 2], [0, 1]]);
snakeGame.move("R"); // return 0
snakeGame.move("D"); // return 0
snakeGame.move("R"); // return 1, snake eats the first piece of food. The second piece of food appears
// at (0, 1).
snakeGame.move("U"); // return 1
snakeGame.move("L"); // return 2, snake eats the second food. No more food appears.
snakeGame.move("U"); // return -1, game over because snake collides with border


## Code

class SnakeGame {
// 记录自己的位置,包括全部的身体
// 因此也可以从这个set来判断是不是撞到了自己
HashSet<Integer> set;
// 当前蛇的情况,全部坐标
Deque<Integer> deque;
// 当前得分
int score;
// 第几个食物
int foodIndex;
int width;
int height;
// 食物坐标
int[][] food;

/** Initialize your data structure here.
@param width - screen width
@param height - screen height
@param food - A list of food positions
E.g food = [[1,1], [1,0]] means the first food is positioned at [1,1], the second is at [1,0]. */
public SnakeGame(int width, int height, int[][] food) {
this.width = width;
this.height = height;
this.food = food;
set = new HashSet<>();
score = 0;
foodIndex = 0;
deque.offerLast(0);
}

/** Moves the snake.
@param direction - 'U' = Up, 'L' = Left, 'R' = Right, 'D' = Down
@return The game's score after the move. Return -1 if game over.
Game over when snake crosses the screen boundary or bites its body. */
public int move(String direction) {
// 当前头部的坐标
int rowHead = deque.peekFirst() / width;
int colHead = deque.peekFirst() % width;

switch(direction){
break;
break;
break;
}

// 新头部的位置
// 删除尾部,因为马上要走下一步了,尾部会往前移动
// 尾部不可能有食物
set.remove(deque.peekLast());
// 1. 撞到墙或者自己
return -1;
}

// 2. 吃东西或者走路

// 是不是吃到了食物
// foodIndex记录了第几个food
// foodIndex < food.length表示还有食物可以吃
// 并且此时新的头部还正好在食物的位置
foodIndex++;
score++;
// 身体有增长了!!
// 在set中再把尾部加上
// 同时不对deque进行poll()