Fork me on GitHub
2017年5月26日
[leetcode-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: [ 阅读全文
posted @ 2017-05-26 18:20 hellowOOOrld 阅读(120) 评论(0) 推荐(0)
[leetcode-12-Integer to Roman]
摘要： Given an integer, convert it to a roman numeral. 阅读全文
posted @ 2017-05-26 10:15 hellowOOOrld 阅读(84) 评论(0) 推荐(0)
[leetcode-20-Valid Parentheses]
摘要： Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. The brackets must close in the 阅读全文
posted @ 2017-05-26 09:46 hellowOOOrld 阅读(94) 评论(0) 推荐(0)