Leetcode 301. Remove Invalid Parentheses

最新推荐文章于 2019-02-07 15:04:48 发布

weixin_43476349

最新推荐文章于 2019-02-07 15:04:48 发布

阅读量116

点赞数

分类专栏： leetcode 文章标签： algorithm data structure BFS

本文链接：https://blog.csdn.net/weixin_43476349/article/details/83787419

版权

leetcode 专栏收录该内容

35 篇文章 0 订阅

订阅专栏

本文详细解析了LeetCode上一道经典题目“移除无效括号”的算法实现。通过使用BFS算法和辅助数据结构如队列和无序集合，文章展示了如何找到并移除最小数量的无效括号，使输入字符串变为有效。代码中包含了完整的C++实现，包括判断字符串是否有效的函数。

摘要由CSDN通过智能技术生成

https://leetcode.com/problems/remove-invalid-parentheses/description/
Remove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results.

又是一道经典题。
算法用BFS，
data structure：queue，unordered_set

class Solution {
public:
    vector<string> removeInvalidParentheses(string s) {
        vector<string>res;
        if(s.size() < 1)
        {
            res.push_back(s);
            return res;
        }
        
        queue<string>q;
        unordered_set<string>tovisit;
        q.push(s);
        tovisit.insert(s);
        bool found = false;
        while(!q.empty())
        {
            string cur = q.front();
            q.pop();
            if(isvalid(cur))
            {
                res.push_back(cur);
                found = true;
            }
            //the found is to avoid further search once found since the goal is to remove the minimun invalid
            //use "continue" instead of "break" is to search the same level since the goal is to dump all possible result
            if(found == true)
            {              
                continue;
            }
            
            for(int i = 0; i < cur.size(); i++)
            {
                if(cur[i] != '(' && cur[i] != ')') continue;
                string newstr = cur.substr(0,i) + cur.substr(i+1);
                if(tovisit.find(newstr) == tovisit.end())
                {
                    tovisit.insert(newstr);
                    q.push(newstr);
                }
            }
                
        }
        
        return res;
    }
    
    bool isvalid(string str)
    {
        int count = 0;
        for(auto c : str)
        {
            if(c == '(')
            {
                count ++;
            }
            else if(c == ')')
            {
                if(count == 0)
                {
                    return false;
                }
                count --;
            }
        }
        
        return count == 0;
    }
};