Lintcode 3656 · Design Snake Game (贪吃蛇,设计题)

3656 · Design Snake Game

Medium

Description

In this question, you need to design a snake game class SnakeGame.

Snake Game: There exists a snake in a matrix. Food will appear continuously in this matrix, and we need to control the snake to move continuously (through the four directions of up, down, left, and right) to eat the food. after eating food. The length of the snake will increase by one bit. At the same time, the game score will be increased by 1. Afterwards, the next food will be refreshed (the position occupied by the snake will not be refreshed). If the snake hits the wall or eats its own body while eating the food, the game is over.

The function's constructor receives the following parameters:

width: the number of columns in the snake matrix interface

height: the number of rows in the snake matrix interface

foods: The coordinates of the food, represented by a two-dimensional array, where the first element of each array is the row coordinate, and the second element is the column coordinate

In addition, you need to complete the move() function, which will receive a string indicating the direction. Indicates that the snake needs to move one space in this direction. You need to return the Snake score after the move (initial score is 0). Returns -1 if the game ends after the snake moves.

Only $39.9 for the "Twitter Comment System Project Practice" within a limited time of 7 days!

WeChat Notes Twitter for more information(WeChat ID jiuzhang104)

Example

Example 1

Input:

3

2

\[1, 2\], \[0, 0\]

"r", "d", "r", "u", "l", "l", "l"

Output:

0, 0, 1, 1, 1, 1, 2, -1

Explanation:

The initial state is as follows:

s | |

| | f

Among them, s represents the snake, and f represents the current food.

After action "r":

| s |

| | f

...

After eating the first food:

f | |

| s |s

...

After eating the second food:

s | s | s

| |

Example 2

Input:

3

2

\[0, 1\], \[1, 1\], \[1, 0\], \[0, 2\]

"r", "d", "l", "u", "r", "r", "d", "l", "u"

Output:

1, 2, 3, 3, 3, 4, 4, 4, -1

解法1:蛇的身体用deque。另外再用set判重(如果吃到自己的身体的话)。

食物可以用queue,因为是按先后顺序一个一个出现。

为什么蛇的身体用deque呢,因为吃到食物要pop_tail,而在游走的过程中要pop_front。

cpp 复制代码
class SnakeGame {
public:
    SnakeGame(int width, int height, vector<vector<int>>& foods) : width(width), height(height) {
        for (auto food : foods) {
            foodQueue.push({food[0], food[1]});
        }
        currPos = {0, 0}; //initial position (0,0)
        score = 0;
    }

    /**
     * @param direction: the direction of the move
     * @return: the score after the move
     */
    int move(string &direction) {
        int n = direction.size();
        switch (direction[0]) {
            case 'r':
                currPos.second++;
                break;
            case 'l':
                currPos.second--;
                break;
            case 'd':
                currPos.first++;
                break;
            case 'u':
                currPos.first--;
                break;
        }
        if (currPos.first < 0 || currPos.first >= height) return -1;
        if (currPos.second < 0 || currPos.second >= width) return -1;
        if (bodySet.find(currPos) != bodySet.end()) return -1;
        bodySet.insert(currPos);
        bodyQueue.push_back(currPos);
        if (!foodQueue.empty() && currPos == foodQueue.front()) {
            foodQueue.pop();
            score++;
        } else {
            bodySet.erase(bodyQueue.front());
            bodyQueue.pop_front();
        }
       
        return score;
    }
private:
    queue<pair<int, int>> foodQueue;
    int width, height;
    set<pair<int, int>> bodySet; // snake body set
    deque<pair<int, int>> bodyQueue; // snake body queue
    pair<int, int> currPos;
    int score;
};
相关推荐
naruto_lnq14 小时前
分布式系统安全通信
开发语言·c++·算法
Jasmine_llq15 小时前
《P3157 [CQOI2011] 动态逆序对》
算法·cdq 分治·动态问题静态化+双向偏序统计·树状数组(高效统计元素大小关系·排序算法(预处理偏序和时间戳)·前缀和(合并单个贡献为总逆序对·动态问题静态化
爱吃rabbit的mq15 小时前
第09章:随机森林:集成学习的威力
算法·随机森林·集成学习
(❁´◡`❁)Jimmy(❁´◡`❁)16 小时前
Exgcd 学习笔记
笔记·学习·算法
YYuCChi16 小时前
代码随想录算法训练营第三十七天 | 52.携带研究材料(卡码网)、518.零钱兑换||、377.组合总和IV、57.爬楼梯(卡码网)
算法·动态规划
不能隔夜的咖喱17 小时前
牛客网刷题(2)
java·开发语言·算法
VT.馒头17 小时前
【力扣】2721. 并行执行异步函数
前端·javascript·算法·leetcode·typescript
进击的小头17 小时前
实战案例:51单片机低功耗场景下的简易滤波实现
c语言·单片机·算法·51单片机
咖丨喱19 小时前
IP校验和算法解析与实现
网络·tcp/ip·算法
罗湖老棍子19 小时前
括号配对(信息学奥赛一本通- P1572)
算法·动态规划·区间dp·字符串匹配·区间动态规划