2014年12月17日
【leetcode】 Longest Valid Parentheses (hard)★
摘要： Given a string containing just the characters'('and')', find the length of the longest valid (well-formed) parentheses substring.For"(()", the longest... 阅读全文
posted @ 2014-12-17 16:57 匡子语 阅读(203) 评论(0) 推荐(0)
【leetcode】 Scramble String (hard)★
摘要： Given a strings1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation... 阅读全文
posted @ 2014-12-17 11:43 匡子语 阅读(271) 评论(0) 推荐(0)