LeetCode Generate Parentheses

Description:

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

Solution:

A dfs can solve this problem,

We can imagine this problem as setting every digit one by one. Then we have only to care the left or right side of a parentheses.

Suppose we only care the left parentheses. For the ith left parentheses, if the (i-1)th left is on the position num, so the ith left can range from [ num+1, 2*i ) --- this range can guarantee the validation of the generated string.

And a dfs can help make left or right parenthesis in supposed position.

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;

public class Solution {
	public List<String> generateParenthesis(int n) {
		List<String> list = new ArrayList<String>();
		dfs(list, 2, 2, n, "(");
		return list;
	}

	void dfs(List<String> list, int num, int tot, int n, String str) {
		if (num == n + 1 || tot == n * 2 + 1) {
			for (int i = str.length(); i < n * 2; i++)
				str = str + ")";
			// System.out.println(str);
			list.add(str);
		} else {
			String temp = "";
			for (int i = tot; i < num * 2; i++) {
				dfs(list, num + 1, i + 1, n, str + temp + "(");
				temp += ")";
			}
		}
	}
}