Zuma Game

最新推荐文章于 2022-01-30 13:15:32 发布

小灰灰52309

最新推荐文章于 2022-01-30 13:15:32 发布

阅读量485

点赞数

分类专栏： leetcode ACM 文章标签： Zuma Game

本文链接：https://blog.csdn.net/xiaohuihui52309/article/details/71087510

版权

leetcode 同时被 2 个专栏收录

185 篇文章 0 订阅

订阅专栏

ACM

127 篇文章 0 订阅

订阅专栏

Zuma Game

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 -> WW

Input: "WWRRBBWW", "WRBRW"
Output: 2
Explanation: WWRRBBWW -> WWRR[R]BBWW -> WWBBWW -> WWBB[B]WW -> WWWW -> empty

Input:"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'.

解析：

递归遍历每种情况，找到最小满足条件的解，给的一些条件提示可以使用暴力的解法。

代码：

class Solution {
public:
    int findMinStep(string board, string hand) {
        
        unordered_map<char,int>m;
        for (int i=0; i<hand.size(); i++)
        {
            if (m.find(hand[i])!=m.end())
            {
                m[hand[i]]++;
            }
            else
            {
                m[hand[i]]=1;
            }
        }
        
        
        int ans=Helper(board,m);
        ans=(ans==INT_MAX?-1:ans);
        return ans;
    }
    
    int Helper(string board,unordered_map<char,int>m)
    {
        int ans=INT_MAX;
        
        board=CancelCon(board);
        if (board.empty())
        return 0;
        
        int j=0;
        for (int i=0; i<=board.size(); i++)
        {
            if (i<board.size()&&board[i]==board[j])
            continue;
            int need=3-(i-j);
            if (need<=m[board[j]])
            {
                m[board[j]]-=need;
                int temp=Helper(board.substr(0,j)+board.substr(i),m);
                if (temp!=INT_MAX)
                {
                     ans=min(ans,need+temp);
                }
                 m[board[j]]+=need;
            }
           
            
            j=i;
        }
        return ans;
    }
    
    string CancelCon(string board)
    {
        int j=0;
        for (int i=0; i<=board.size(); i++)
        {
            if (i<board.size()&&board[i]==board[j])
            continue;
            if ((i-j)>=3)
            {
                return CancelCon(board.substr(0,j)+board.substr(i));
            }
            else
            {
                j=i;
            }
        }
        return board;
    }
    
};