摘要：
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: 解 阅读全文
posted @ 2017-02-18 23:53
Strugglion
阅读(414)
评论(0)
推荐(0)
摘要：
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 解法： 新建一个 阅读全文
posted @ 2017-02-18 21:36
Strugglion
阅读(221)
评论(0)
推荐(0)
摘要：
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. The brackets must close in the 阅读全文
posted @ 2017-02-18 17:32
Strugglion
阅读(162)
评论(0)
推荐(0)
摘要：
Given a linked list, remove the nth node from the end of list and return its head. For example, Note:Given n will always be valid.Try to do this in on 阅读全文
posted @ 2017-02-18 17:02
Strugglion
阅读(135)
评论(0)
推荐(0)
摘要：
Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array whic 阅读全文
posted @ 2017-02-18 00:44
Strugglion
阅读(3336)
评论(0)
推荐(0)
浙公网安备 33010602011771号