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;
};
相关推荐
Black蜡笔小新6 小时前
自动化AI算法训练服务器DLTM助力医学影像分析进入AI智能分析新时代
人工智能·算法·自动化
手写码匠7 小时前
深入解析大模型架构之争:全能通用模型 vs 领域专精模型
人工智能·深度学习·算法·aigc
浅念-7 小时前
LeetCode 回溯算法题——综合练习
数据结构·c++·算法·leetcode·职场和发展·深度优先·dfs
列星随旋8 小时前
线段树和树状数组的学习
学习·算法
全糖可乐气泡水10 小时前
Codex适配国产信创环境安装部署与技术适配全解析
开发语言·git·python·算法·百度
h_a_o777oah10 小时前
状态机+划分型 DP :深度解析K-划分问题下 DP 状态的转移逻辑(洛谷P2679 P2331 附C++代码)
c++·算法·动态规划·acm·状态机dp·划分型dp·滚动数组优化
05候补工程师10 小时前
从算法理想向工程现实的跨越:SLAM 核心架构、思维误区与 Nav2 实战避坑指南
人工智能·算法·安全·架构·机器人
手写码匠12 小时前
Android 17 适配实战指南:新特性解读、隐私变更与迁移全攻略
人工智能·深度学习·算法·aigc
珊瑚里的鱼12 小时前
leetcode42雨水
算法·leetcode