leetcode: Longest Valid Parentheses

来源:互联网 发布:illustrator mac 破解 编辑:程序博客网 时间:2024/04/29 10:39

没明白为啥要递减循环

http://www.tuicool.com/articles/vUnEbi

递增循环ac好好的

class Solution:    # @param {string} s    # @return {integer}    def longestValidParentheses(self, s):        if not s:            return 0        maxlen = 0        n = len(s)        dp = [0]*n        #print dp        for i in range(1,n):            if s[i]==')':                j = i-1 - dp[i-1]                if j>=0 and s[j]=='(':                    dp[i] = dp[i-1]+2                    #combine                    if j-1 >= 0:                        dp[i] += dp[j-1]                if dp[i]>maxlen:                maxlen = dp[i]            #print 'dp[%d]=%d'%(i,dp[i])            #print dp        return maxlen


0 0
原创粉丝点击