首页 > ACM题库 > UVA > UVA 673 Parentheses Balance-栈[解题报告]
2014
01-15

UVA 673 Parentheses Balance-栈[解题报告]

UVA 673 Parentheses Balance

题意就是判断左右括号是否匹配。用数组模拟栈,左括号就入栈,右括号遇到栈顶是对应的左括号,就将左括号出栈,否则就是NO,字符串结束后,若栈不为空,就NO。水过

#include <stdio.h>
#include <string.h>

int n;
char sb[205];
char stack[205];
int main()
{
	scanf("%d", &n);
	getchar();
	while (n --)
	{
		int i;
		memset(stack, 0, sizeof(stack));
		gets(sb);
		int t =0;
		int len = strlen(sb);
		for (i = 0; i < len; i ++)
		{
			if (sb[i] == '(' || sb[i] =='[')
			{
				stack[t] = sb[i];
				t ++;
			}
			if (sb[i] == ')')
			{
				if (stack[t - 1] == '(')
				{
					stack[t - 1] = '\0';
					t --;
				}
				else
				{
					stack[t] = sb[i];
					t ++;
				}
			}
			if (sb[i] == ']')
			{
				if (stack[t - 1] == '[')
				{
					stack[t - 1] = '\0';
					t --;
				}
				else
				{
					stack[t] = sb[i];
					t ++;
				}
			}
		}
		if (stack[0] == '\0')
			printf("Yes\n");
		else
			printf("No\n");
	}
	return 0;
}

  1. Thanks for taking the time to examine this, I really feel strongly about it and love studying a lot more on this topic. If possible, as you acquire experience

  2. Gucci New Fall Arrivals

    This is really nice to know. I hope it will be successful in the future. Good job on this and keep up the good work.

  3. 算法是程序的灵魂,算法分简单和复杂,如果不搞大数据类,程序员了解一下简单点的算法也是可以的,但是会算法的一定要会编程才行,程序员不一定要会算法,利于自己项目需要的可以简单了解。