dianziwenyou的博客

DescriptionGiven n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:[ "((()))", "(()())", "(())()", "()

DescriptionGiven a linked list, remove the nth node from the end of list and return its head. *For example, * Given linked list: 1->2->3->4->5, and n = 2. * After removing the second node from the