LeetCode - Medium - 22. Generate Parentheses

Topic

  • String
  • Backtracking

Description

https://leetcode.com/problems/generate-parentheses/

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

Example 1:

Input: n = 3
Output: ["((()))","(()())","(())()","()(())","()()()"]

Example 2:

Input: n = 1
Output: ["()"]

Constraints:

  • 1 <= n <= 8

Analysis

方法一:暴力算法,生成可能结果,然后验证排除结果,时杂O(2²ⁿ),效率不高。

方法二:回溯算法。根据代码理解下面n=3例子树图:

                (
              /   \
            /       \
          /           \
        ((            ()
      /     \           \
    (((     (()         ()(
    /     /    \       /    \
  ((()  (()(  (())   ()((   ()()
  /      |     |      |      |
((())  (()()  (())(  ()(()  ()()(
 |       |     |      |      |
((())) (()()) (())() ()(()) ()()()

在这里插入图片描述
在这里插入图片描述

Submission

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

public class GenerateParentheses {

	public List<String> generateParenthesis(int n) {
		List<String> list = new ArrayList<>();
		backtracking(list, new StringBuilder(), 0, 0, n);
		return list;
	}

	private void backtracking(List<String> list, StringBuilder sb, int open, int close, int max) {

		if (open == max && close == max) {
			list.add(sb.toString());
			return;
		}

		if (open < max) {
			backtracking(list, sb.append('('), open + 1, close, max);
			sb.setLength(sb.length() - 1);
		}

		if (close < open) {
			backtracking(list, sb.append(')'), open, close + 1, max);
			sb.setLength(sb.length() - 1);
		}
	}
}

Test

import static org.junit.Assert.*;

import org.hamcrest.collection.IsIterableContainingInAnyOrder;
import org.hamcrest.core.IsCollectionContaining;
import org.junit.Test;

public class GenerateParenthesesTest {

	@Test
	public void test() {
		GenerateParentheses obj = new GenerateParentheses();

		assertThat(obj.generateParenthesis(3), //
				IsIterableContainingInAnyOrder.containsInAnyOrder("((()))", "(()())", "(())()", "()(())", "()()()"));

		assertThat(obj.generateParenthesis(1), IsCollectionContaining.hasItem("()"));
	}
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值