30.有效括号生成：leetcode22

   
  leetcode / 算法
  a few seconds read (About 109 words)

problem

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

  DFS, backtracking
  Read More
  Follow

Tag Cloud

BST DFS array backtracking binary-search dequeue greedy linux map notbest priorityQueue queue redis stack tree two-pointers 栈 链表

Recent

Archives

Tags

BST 1
DFS 1
array 1
backtracking 1
binary-search 1
dequeue 1
greedy 1
linux 1
map 2
notbest 1
priorityQueue 2
queue 3
redis 1
stack 1
tree 4
two-pointers 1
栈 1
链表 3
Your browser is out-of-date!

Update your browser to view this website correctly. Update my browser now

×