Leetcode 22. Generate Parentheses | | Leetcode 22. Generate Parentheses 文章作者:Tyan博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution12345678910111213141516171819202122232425262728class Solution {public: vector<string> generateParenthesis(int n) { vector<string> result; push(0, 0, result, "", n, '('); return result; } private: void push(int left, int right, vector<string>& result, string s, const int n, char ch) { s += ch; if(ch == '(') { left++; } else { right++; } if(left > n || right > n || right > left) { return; } if(s.length() == 2 * n) { result.push_back(s); return; } push(left, right, result, s, n, '('); push(left, right, result, s, n, ')'); }}; Reference https://leetcode.com/problems/generate-parentheses/description/ 如果有收获,可以请我喝杯咖啡! 赏 微信打赏 支付宝打赏