Generate Parentheses

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.

For example, given n = 3, a solution set is:

"((()))", "(()())", "(())()", "()(())", "()()()"

Have you been asked this question in an interview? 
DFS 典型题目

public class Solution {
    public List<String> generateParenthesis(int n) {
        List<String> res = new ArrayList<String>();
        getPair(res, "", n, n);
        return res;
    }
    private void getPair(List<String> res, String s, int left, int right) {
        if (left < 0 ||right < 0 || left > right) {
            return;
        }
        if (left == 0 && right == 0) {
            res.add(s);
            return;
        }
        getPair(res, s+ "(", left - 1, right);
        getPair(res, s + ")", left, right - 1);
    }
}