[leetcode]488. Zuma Game

题目链接：https://leetcode.com/problems/zuma-game/description/

Think about Zuma Game. You have a row of balls on the table, colored red(R), yellow(Y), blue(B), green(G), and white(W). You also have several balls in your hand.

Each time, you may choose a ball in your hand, and insert it into the row (including the leftmost place and rightmost place). Then, if there is a group of 3 or more balls in the same color touching, remove these balls. Keep doing this until no more balls can be removed.

Find the minimal balls you have to insert to remove all the balls on the table. If you cannot remove all the balls, output -1.

Examples:
Input: "WRRBBW", "RB"
Output: -1
Explanation: WRRBBW -> WRR[R]BBW -> WBBW -> WBB[B]W -> WWInput: "WWRRBBWW", "WRBRW"
Output: 2
Explanation: WWRRBBWW -> WWRR[R]BBWW -> WWBBWW -> WWBB[B]WW -> WWWW -> emptyInput:"G", "GGGGG"
Output: 2
Explanation: G -> G[G] -> GG[G] -> empty Input: "RBYYBBRRB", "YRBGB"
Output: 3
Explanation: RBYYBBRRB -> RBYY[Y]BBRRB -> RBBBRRB -> RRRB -> B -> B[B] -> BB[B] -> empty

Note:

You may assume that the initial row of balls on the table won’t have any 3 or more consecutive balls with the same color.
The number of balls on the table won't exceed 20, and the string represents these balls is called "board" in the input.
The number of balls in your hand won't exceed 5, and the string represents these balls is called "hand" in the input.
Both input strings will be non-empty and only contain characters 'R','Y','B','G','W'.

方法一：（dfs）

class Solution {
public:int findMinStep(string board, string hand) {list<Node> board_list;vector<int> hand_count(CHAR_MAX, 0);int remain_in_hand = 0;for (int i = 0; i < board.length(); ++i) {board_list.push_back(Node(board[i], 1));if (i != board.length() - 1 && board[i] == board[i + 1]) {board_list.back().count++;i++;}}for (char ch : hand) {hand_count[ch]++;remain_in_hand ++;}int ret = DFS(board_list, hand_count, remain_in_hand);return ret == kMaxNeed ? -1 : ret;}
private:// the kMaxNeed need to  be greater than 5; const int kMaxNeed=6;struct Node{char ch;int count;Node(char c,int i):ch(c),count(i){}};void CleanBoard(list<Node> &board){auto it = board.begin();while (it != board.end()) {if (it->count >= 3) {it = board.erase(it);// Ensure iterator != end(), before you use the it// Ensure iterator != begin(), before invoking prev(it)if (it != board.begin() &&it != board.end() &&it->ch == prev(it)->ch){it->count += prev(it)->count;board.erase(prev(it));}} else {it++;}}}int DFS(list<Node> board, vector<int> &hand, int remain_in_hand) {CleanBoard(board);if (board.size() == 0)  return 0;//cannot remove all the ballsif (remain_in_hand <= 0)  return kMaxNeed;int min_need = kMaxNeed;for (auto it = board.begin(); it != board.end(); ++it) {int need = 3 - it->count;if (hand[it->ch] >= need) {hand[it->ch] -= need;it->count += need;list<Node> next_board = board;int ret = DFS(next_board, hand, remain_in_hand - need);min_need = min(min_need, ret + need);it->count -= need;hand[it->ch] += need;}}return min_need;}
};

[leetcode]488. Zuma Game相关推荐

LeetCode 488 Zuma Game 解题报告
原文链接: http://hankerzheng.com/blog/Leetcode-Zuma-Game- Problem Description LeetCode 488 Zuma Game Thi ...
Java实现 LeetCode 488 祖玛游戏
488. 祖玛游戏回忆一下祖玛游戏.现在桌上有一串球,颜色有红色®,黄色(Y),蓝色(B),绿色(G),还有白色(W). 现在你手里也有几个球. 每一次,你可以从手里的球选一个,然后把这个球插入到一 ...
488 Zuma Game 祖玛游戏
回忆一下祖玛游戏.现在桌上有一串球,颜色有红色(R),黄色(Y),蓝色(B),绿色(G),还有白色(W). 现在你手里也有几个球. 每一次,你可以从手里的球选一个,然后把这个球插入到一串球中的某个位置 ...
Leetcode 488.祖玛游戏
祖玛游戏回忆一下祖玛游戏.现在桌上有一串球,颜色有红色(R),黄色(Y),蓝色(B),绿色(G),还有白色(W). 现在你手里也有几个球. 每一次,你可以从手里的球选一个,然后把这个球插入到一串球中 ...
LeetCode 488. 祖玛游戏
题目描述回忆一下祖玛游戏.现在桌上有一串球,颜色有红色(R),黄色(Y),蓝色(B),绿色(G),还有白色(W). 现在你手里也有几个球. 每一次,你可以从手里的球选一个,然后把这个球插入到一串球中 ...
taoqick 搜索自己CSDN博客
L1 L2正则化和优化器的weight_decay参数 kaiming初始化的推导 Pytorch动态计算图 Pytorch自动微分机制 PyTorch中在反向传播前为什么要手动将梯度清零? 通俗讲解 ...
LeetCode github集合，附CMU大神整理笔记
Github LeetCode集合本人所有做过的题目都写在一个java项目中,同步到github中了,算是见证自己的进步.github目前同步的题目是2020-09-17日之后写的题.之前写过的题会 ...
LeetCode All in One 题目讲解汇总(持续更新中...)
原文地址:https://www.cnblogs.com/grandyang/p/4606334.html 终于将LeetCode的大部分题刷完了,真是漫长的第一遍啊,估计很多题都忘的差不多了,这次开 ...
算法细节系列（16）：深度优先搜索
算法细节系列(16):深度优先搜索详细代码可以fork下Github上leetcode项目,不定期更新. 题目均摘自leetcode: 1. 329 Longest Increasing Path ...

[leetcode]488. Zuma Game

[leetcode]488. Zuma Game相关推荐

最新文章

热门文章