Tag: Backtracking

  1. Leetcode 22 Generate Parentheses

    Problem 22 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: "((()))", "(()())", "(())()", "()(())", "()()()" Many people say it is a easy problem, but I do not think so. As the idea is easy, but writing it…

    on Leetcode Java Backtracking String