LeetCode #353. Design Snake Game

题目描述：

Design a Snake game that is played on a device with screen size = width x height. 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 length = 1 unit.

You are given a list of food's positions in row-column order. When a snake eats the food, its length and the game's score both increase by 1.

Each food appears one by one on the screen. For example, the second food will not appear until the first food was eaten by the snake.

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

Example:

Given width = 3, height = 2, and food = [[1,2],[0,1]].

Snake snake = new Snake(width, height, food);

Initially the snake appears at position (0,0) and the food at (1,2).

|S| | |
| | |F|

snake.move("R"); -> Returns 0

| |S| |
| | |F|

snake.move("D"); -> Returns 0

| | | |
| |S|F|

snake.move("R"); -> Returns 1 (Snake eats the first food and right after that, the second food appears at (0,1) )

| |F| |
| |S|S|

snake.move("U"); -> Returns 1

| |F|S|
| | |S|

snake.move("L"); -> Returns 2 (Snake eats the second food)

| |S|S|
| | |S|

snake.move("U"); -> Returns -1 (Game over because snake collides with border)

class SnakeGame {
public:
    /** 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]. */
    SnakeGame(int width, int height, vector<vector<int>>& food) {
        i=0, m=height, n=width;
        f=food;
        q.push_front({0,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. */
    int move(string direction) {
        // 计算下一步位置
        int x=q.front().first, y=q.front().second;
        if(direction=="U") x--;
        if(direction=="D") x++;
        if(direction=="L") y--;
        if(direction=="R") y++;
        
        int tail_x=q.back().first, tail_y=q.back().second;
        q.pop_back(); // 必须先将尾去除，再判断下一步和身体是否相碰
        // 食物不会和身体重叠，所以吃到食物的情况肯定不会和尾部碰撞
        if(x<0||x>=m||y<0||y>=n) return -1;
        if(collide_body(x,y)) return -1;
        
        q.push_front({x,y}); // 头在判断完是否碰撞之后再加上
        // 先判断是否还有食物
        if(i>=f.size()) return i;
        // 如果发现吃到食物，将尾部加上
        if(x==f[i][0]&&y==f[i][1])
        {
            q.push_back({tail_x,tail_y});
            i++;
        }
        return i;
    }
    
    bool collide_body(int x, int y)
    {
        int l=q.size();
        for(int k=0;k<l;k++)
        {
            if(q.front().first==x&&q.front().second==y) return true;
            else
            {
                q.push_back({q.front().first, q.front().second});
                q.pop_front();
            }
        }
        return false;
    }
    
private:
    deque<pair<int,int>> q;
    int i, m, n;
    vector<vector<int>> f;
};