10 2018 档案
摘要:Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring. Example 1: Exampl
阅读全文
posted @ 2018-10-30 21:45
messi2017
摘要:We are given S, a length n string of characters from the set {'D', 'I'}. (These letters stand for "decreasing" and "increasing".) A valid permutation
阅读全文
posted @ 2018-10-30 09:37
messi2017

浙公网安备 33010602011771号