擅长:python、mysql、java
<p>您应该迭代并更新当前的开括号数,并保持循环时的最大值。如果长度大于max的curren length,则可以将所有开括号放在用作堆栈的字符串上,并使用此字符串更新max</p>
<pre><code>OPEN = "<[({"
CLOSED = ">])}"
def is_nested(str):
stack = []
deepest =[]
for c in str:
if c in OPEN:
stack.append(c)
if len(stack)>len(deepest):
deepest.append(c)
elif c in CLOSED:
x = stack.pop()
if OPEN.index(x) != CLOSED.index(c):
return "Error"
return ''.join(deepest)
</code></pre>