Problems
Contests
Events
Topic
IDE
PacketHub
Login
Description
Editorial
My Submission
1046.Parentheses
Look up all submission
Status
Time
Memory
Lang.
Submit Date
1046.Parentheses
Time Limit:1000MS Memory Limit:65535KB
Description
Given a string of parentheses, you must turn it into a well formed string by inserting as few parentheses as possible, at any position (you cannot delete or change any of the existing parentheses). A well formed string of parentheses is defined by the following rules: -The empty string is well formed. -If s is a well formed string, (s) is a well formed string. -If s and t are well formed strings, their concatenation st is a well formed string. As examples, "(()())", "" and "(())()" are well formed strings and "())(", "()(" and ")" are malformed strings.
Input
Input a string par of parentheses,and the par will contain between 1 and 60 characters, inclusive.Each character of par will be an opening or closing parenthesis, i.e., '(' or ')'.Proccess to the end of file.
Output
Output the minimum number of parentheses that need to be inserted to make it into a well formed string.
Sample test
Sample input
(()(() (())
Sample output
2 0
Note
Tags
Post editorial
Editorials
GNU C++ 9.3.0
GNU C 9.3.0
Java 1.8
Python 3.8.4
Lua 5.3
GO 1.12.4
JS - (nodejs 10.19.0)
Login before submit
Test Input
Test Output
(()(() (())
Please run you code firstly.
Console
IDE Setting
字体设置
调整适合你的字体大小。
12px
13px
14px
15px
16px
18px
20px
主题设置
切换不同的代码编辑器主题，选择适合你的语法高亮。
Visual Studio
Visual Studio Dark
High Contrast Dark
行宽限制
设置每一行代码的最大字符个数，设置为0则不限制。
0
80
100
120
Login before submit
