Given a string consisting of ()[]{}. Find the length of the longest Balanced Parenthesis in O(N)
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3494 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3315 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 164 |
2 | Um_nik | 163 |
3 | cry | 162 |
4 | atcoder_official | 159 |
5 | awoo | 157 |
5 | adamant | 157 |
7 | -is-this-fft- | 156 |
8 | nor | 154 |
9 | TheScrasse | 153 |
9 | Dominater069 | 153 |
Question
Given a string consisting of ()[]{}. Find the length of the longest Balanced Parenthesis in O(N)
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | Rohancoder | 2022-11-24 22:35:26 | 12 | Tiny change: 'arenthesis.' -> 'arenthesis in O(N)\n ' | ||
en1 | Rohancoder | 2022-11-24 21:58:39 | 97 | Initial revision (published) |
Name |
---|