首页 > 其他 > 详细

32. Longest Valid Parentheses

时间:2015-04-17 17:49:28      阅读:200      评论: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
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!