generateParenthesis——leetcode
2016-07-19 19:56
369 查看
原文地址：http://www.cnblogs.com/codingmylife/archive/2012/09/09/2677428.html
void unguarded_generate(vector<string> &result, string curr, int m, int n)
{if (m == 0 && n == 0)
{result.push_back(curr);
}
else
{if (m != 0)
{unguarded_generate(result, curr + "(", m - 1, n);}
if (m < n && n != 0)
{unguarded_generate(result, curr + ")", m, n - 1);
}
}
}
vector<string> generateParenthesis(int n)
{vector<string> ret;
if (n > 0)
{unguarded_generate(ret, string(), n, n);
}
return ret;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解