题库
比赛
话题
编译器
近期比赛
报文仓库
登录
题目描述
题解
我的提交
1046.Parentheses
查看全部提交
提交状态
耗时
内存
语言
提交时间
1046.Parentheses
时间限制:1000MS 内存限制:65535KB
题目描述
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 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 the minimum number of parentheses that need to be inserted to make it into a well formed string.
示例
输入样例
(()(() (())
输出样例
2 0
提示
相关标签
发布题解
个题解
GNU C++ 9.3.0
GNU C 9.3.0
Python 3.8.4
Lua 5.3
GO 1.12.4
JS - (nodejs 10.19.0)
登陆后才可以提交
测试输入
执行结果
(()(() (())
请先执行代码
控制台
代码编辑器配置
字体设置
调整适合你的字体大小。
12px
13px
14px
15px
16px
18px
20px
主题设置
切换不同的代码编辑器主题，选择适合你的语法高亮。
Visual Studio
Visual Studio Dark
High Contrast Dark
行宽限制
设置每一行代码的最大字符个数，设置为0则不限制。
0
80
100
120
登陆后才可以提交
