M – 13 括号平衡

  • Post author:
  • Post category:其他

I’m out of stories. For years I’ve been writing stories, some rather silly, just to make simple problems look difficult and complex problems look easy. But, alas, not for this one.

You’re given a non empty string made in its entirety from opening and closing braces. Your task is to find the minimum number of “operations” needed to make the string stable. The definition for being stable is as follows:

1. An empty string is stable.

2. If S is stable, then {S} is also stable.

3. If S and T are both stable, then ST (the concatenation of the two) is also stable.

All of these strings are stable: {}, {}{}, and {

{}{}}; But none of these: }{, {

{}{, nor {}{.

The only operation allowed on the string is to replace an opening brace with a closing brace, or visa-versa.


Your program will be tested on one or more data sets. Each data set is described on a single line. The line is a non-empty string of opening and closing braces and nothing else. No string has more than 2000 braces. All sequences are of even length.

The last line of the input is made of one or more ’-’ (minus signs.)


For each test case, print the following line:

k. N

Where k is the test case number (starting at one,) and N is the minimum number of operations needed to convert the given string into a balanced one.

Note: There is a blank space before N.

Sample Input


Sample Output

1. 2
2. 0
3. 1

import java.util.*;
public class Main {
   static Scanner in=new Scanner(System.in);  
	public static void main(String[] args) {
		int cnt=0;
          String s=in.next();
          int left=0,sum=0;
        	 // 最后转换后只可能剩一堆左括号
        	for (int i = 0; i < s.length(); i++) {
			   if(s.charAt(i)=='{')	//如果是左括号累加,
			   else if(s.charAt(i)=='}'&&left>0)//如果是右括号并且有配对的左括号,则左括号减少,
         System.out.println(cnt+". "+sum);






版权声明:本文为JingleLiA原创文章,遵循 CC 4.0 BY-SA 版权协议,转载请附上原文出处链接和本声明。