GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — JavaScript/Backtracking/generateParentheses.js at master · Randomlyclueless/JavaScript

Expand file tree

/

generateParentheses.js

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
31 lines (24 loc) · 810 Bytes
/

generateParentheses.js

Copy path

File metadata and controls

31 lines (24 loc) · 810 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
/**
* Problem Statement: Given a number n pairs of parentheses, try to Generate all combinations of valid parentheses;
* @param {number} n - number of given parentheses
* @return {string[]} res - array that contains all valid parentheses
* @see https://leetcode.com/problems/generate-parentheses/
*/
const generateParentheses = (n) => {
const res = []
const solve = (chres, openParenthese, closedParenthese) => {
if (openParenthese === n && closedParenthese === n) {
res.push(chres)
return
}
if (openParenthese <= n) {
solve(chres + '(', openParenthese + 1, closedParenthese)
}
if (closedParenthese < openParenthese) {
solve(chres + ')', openParenthese, closedParenthese + 1)
}
}
solve('', 0, 0)
return res
}
export { generateParentheses }
You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.