Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,988 questions

51,933 answers

573 users

How to generate all combinations of well-formed N pairs of parentheses in C++

1 Answer

0 votes
#include <iostream>
#include <vector>

class Program {
public:
    std::vector<std::string> generateParenthesis(int n) {
        std::vector<std::string> result;
        
        createPairs(result, "", 0, 0, n);
        
        return result;
    }
    
    void printVector(std::vector<std::string> const &v) {
        for (auto const &n: v) {
            std::cout << n << " ";
        }
    }

private:
    void createPairs(std::vector<std::string>& result, std::string current, int left, int right, int n) {
        if (current.size() == 2 * n) {
            result.push_back(current);
            return;
        }
        if (left < n) {
            createPairs(result, current + '(', left + 1, right, n);
        }
        if (right < left) {
            createPairs(result, current + ')', left, right + 1, n);
        }
    }
};

int main()
{
    Program p;
 
    std::vector result = p.generateParenthesis(3);
 
    p.printVector(result);

}


 
/*
run:
 
((())) (()()) (())() ()(()) ()()() 
 
*/

 



answered Mar 11, 2024 by avibootz
...