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;
};
相关推荐
可编程芯片开发4 小时前
基于MATLAB的PEF湍流风场生成器模拟与仿真
算法
罗西的思考4 小时前
【Agentic RL / 强化学习 / OPD】OpenClaw-RL 源码阅读笔记 --- (9)--- Reward Judging
人工智能·算法·机器学习
2401_841495645 小时前
【数据结构】B+树
数据结构·数据库·c++·b+树·概念·结构·操作原理
Mr.HeBoYan6 小时前
一次持续三天才出现的丢包故障——深入解析 DPDK Memory Ordering、rte_ring 与 CPU Memory Barrier (下)
linux·网络·算法·架构·dpdk
wabs6666 小时前
关于图论【深度优先搜索的理论基础】
算法·深度优先·图论
皓月斯语7 小时前
【C++基础】三目运算符
开发语言·数据结构·c++
先吃饱再说7 小时前
LeetCode 101. 对称二叉树
算法
是Dream呀8 小时前
人眼看不出的伪造,AI如何识别?实测合合信息跨模态鉴伪与去反光技术
算法
QN1幻化引擎8 小时前
SFA 信号场注意力:用8KB参数换248x KV Cache压缩,边缘设备也能跑长序列
人工智能·算法·gitee·gitlab
剑锋所指,所向披靡!8 小时前
数据结构之拓扑排序
数据结构