码迷,mamicode.com
首页 > 其他好文 > 详细

32. Longest Valid Parentheses

时间:2015-04-17 17:52:17      阅读:118      评论:0      收藏:0      [点我收藏+]

标签:

题目:

Given a string containing just the characters ‘(‘ and ‘)‘, find the length of the longest valid (well-formed) parentheses substring.

For "(()", the longest valid parentheses substring is "()", which has length = 2.

Another example is ")()())", where the longest valid parentheses substring is "()()", which has length = 4.

链接: http://leetcode.com/problems/longest-valid-parentheses/

题解:

测试:

 

32. Longest Valid Parentheses

标签:

原文地址:http://www.cnblogs.com/yrbbest/p/4435218.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!