括号匹配及表达式计算
2015-08-16 11:43
363 查看
/*
* rule:
* () -> 2
* [] -> 3
* [()] / ([]) -> 3* 2 / 2 * 3
* ()() -> 2 + 2
* [][] -> 3 + 3
* ()[] -> 2 + 3
*
*
* test cases:
* (()[[]])([]) -> 28
* ()([][][]) -> 20
*
* */
#include <stdio.h>
#define MAX 1024
int Answer;
char a[MAX];
int s0[MAX];
int idx0;
int main()
{
int t,T;
int i;
int temp0,temp1;
freopen("sample_input.txt", "r", stdin);
setbuf(stdout, NULL);
scanf("%d", &T);
for(t = 1; t <= T; ++t)
{
scanf("%s", &a);
//printf("%s", a);
idx0 = 0;
Answer = 0;
for(i = 0; a[i] != '\0'; ++i)
{
if(a[i] == '(' || a[i] == '[')
{
s0[idx0++] = a[i];
}
else if(a[i] == ')')
{
temp0 = s0[--idx0];
s0[idx0] = 0;//reset
if(temp0 == '(')
{
s0[idx0++] = 2;
/*
if(idx0 > 1)
{
temp0 = s0[--idx0];
if(s0[idx0-1] != '(' && s0[idx0-1] != '[')//two int
{
temp1 = s0[--idx0];
temp0 = temp0 + temp1;
s0[idx0++] = temp0;
}
else
{
s0[idx0++] = temp0;
}
}
*/
}
else if(temp0 != '(')
{
temp1 = s0[--idx0];
s0[idx0] = 0;
if(temp1 == '(')
{
temp0 = temp0 * 2;
s0[idx0++] = temp0;
/*
if(idx0 > 1)
{
temp0 = s0[--idx0];
if(s0[idx0-1] != '(' && s0[idx0-1] != '[')//two int
{
temp1 = s0[--idx0];
temp0 = temp0 + temp1;
s0[idx0++] = temp0;
}
else
{
s0[idx0++] = temp0;
}
}
*/
}
}
if(idx0 > 1)
{
temp0 = s0[--idx0];
s0[idx0] = 0;
if(s0[idx0-1] != '(' && s0[idx0-1] != '[')//two int
{
temp1 = s0[--idx0];
s0[idx0] = 0;
temp0 = temp0 + temp1;
s0[idx0++] = temp0;
}
else
{
s0[idx0++] = temp0;
}
}
}
else if(a[i] == ']')
{
temp0 = s0[--idx0];
s0[idx0] = 0;
if(temp0 == '[')
{
s0[idx0++] = 3;
/*
if(idx0 > 1)
{
temp0 = s0[--idx0];
if(s0[idx0-1] != '[' && s0[idx0-1] != '(')//two int
{
temp1 = s0[--idx0];
temp0 = temp0 + temp1;
s0[idx0++] = temp0;
}
else
{
s0[idx0++] = temp0;
}
}
*/
}
else if(temp0 != '[')
{
temp1 = s0[--idx0];
s0[idx0] = 0;
if(temp1 == '[')
{
temp0 = temp0 * 3;
s0[idx0++] = temp0;
/*
if(idx0 > 1)
{
temp0 = s0[--idx0];
if(s0[idx0-1] != '[' && s0[idx0-1] != '(')//two int
{
temp1 = s0[--idx0];
temp0 = temp0 + temp1;
s0[idx0++] = temp0;
}
else
{
s0[idx0++] = temp0;
}
}
*/
}
}
if(idx0 > 1)
{
temp0 = s0[--idx0];
s0[idx0] = 0;
if(s0[idx0-1] != '(' && s0[idx0-1] != '[')//two int
{
temp1 = s0[--idx0];
s0[idx0] = 0;
temp0 = temp0 + temp1;
s0[idx0++] = temp0;
}
else
{
s0[idx0++] = temp0;
}
}
}
}
if(idx0 == 1)//just int and in stack postion 0
{
Answer = s0[--idx0];
}
else
{
Answer = 0;
}
printf("Case#%d:", t);
printf("%d %d\n", idx0, Answer);
}
return 0;
}
* rule:
* () -> 2
* [] -> 3
* [()] / ([]) -> 3* 2 / 2 * 3
* ()() -> 2 + 2
* [][] -> 3 + 3
* ()[] -> 2 + 3
*
*
* test cases:
* (()[[]])([]) -> 28
* ()([][][]) -> 20
*
* */
#include <stdio.h>
#define MAX 1024
int Answer;
char a[MAX];
int s0[MAX];
int idx0;
int main()
{
int t,T;
int i;
int temp0,temp1;
freopen("sample_input.txt", "r", stdin);
setbuf(stdout, NULL);
scanf("%d", &T);
for(t = 1; t <= T; ++t)
{
scanf("%s", &a);
//printf("%s", a);
idx0 = 0;
Answer = 0;
for(i = 0; a[i] != '\0'; ++i)
{
if(a[i] == '(' || a[i] == '[')
{
s0[idx0++] = a[i];
}
else if(a[i] == ')')
{
temp0 = s0[--idx0];
s0[idx0] = 0;//reset
if(temp0 == '(')
{
s0[idx0++] = 2;
/*
if(idx0 > 1)
{
temp0 = s0[--idx0];
if(s0[idx0-1] != '(' && s0[idx0-1] != '[')//two int
{
temp1 = s0[--idx0];
temp0 = temp0 + temp1;
s0[idx0++] = temp0;
}
else
{
s0[idx0++] = temp0;
}
}
*/
}
else if(temp0 != '(')
{
temp1 = s0[--idx0];
s0[idx0] = 0;
if(temp1 == '(')
{
temp0 = temp0 * 2;
s0[idx0++] = temp0;
/*
if(idx0 > 1)
{
temp0 = s0[--idx0];
if(s0[idx0-1] != '(' && s0[idx0-1] != '[')//two int
{
temp1 = s0[--idx0];
temp0 = temp0 + temp1;
s0[idx0++] = temp0;
}
else
{
s0[idx0++] = temp0;
}
}
*/
}
}
if(idx0 > 1)
{
temp0 = s0[--idx0];
s0[idx0] = 0;
if(s0[idx0-1] != '(' && s0[idx0-1] != '[')//two int
{
temp1 = s0[--idx0];
s0[idx0] = 0;
temp0 = temp0 + temp1;
s0[idx0++] = temp0;
}
else
{
s0[idx0++] = temp0;
}
}
}
else if(a[i] == ']')
{
temp0 = s0[--idx0];
s0[idx0] = 0;
if(temp0 == '[')
{
s0[idx0++] = 3;
/*
if(idx0 > 1)
{
temp0 = s0[--idx0];
if(s0[idx0-1] != '[' && s0[idx0-1] != '(')//two int
{
temp1 = s0[--idx0];
temp0 = temp0 + temp1;
s0[idx0++] = temp0;
}
else
{
s0[idx0++] = temp0;
}
}
*/
}
else if(temp0 != '[')
{
temp1 = s0[--idx0];
s0[idx0] = 0;
if(temp1 == '[')
{
temp0 = temp0 * 3;
s0[idx0++] = temp0;
/*
if(idx0 > 1)
{
temp0 = s0[--idx0];
if(s0[idx0-1] != '[' && s0[idx0-1] != '(')//two int
{
temp1 = s0[--idx0];
temp0 = temp0 + temp1;
s0[idx0++] = temp0;
}
else
{
s0[idx0++] = temp0;
}
}
*/
}
}
if(idx0 > 1)
{
temp0 = s0[--idx0];
s0[idx0] = 0;
if(s0[idx0-1] != '(' && s0[idx0-1] != '[')//two int
{
temp1 = s0[--idx0];
s0[idx0] = 0;
temp0 = temp0 + temp1;
s0[idx0++] = temp0;
}
else
{
s0[idx0++] = temp0;
}
}
}
}
if(idx0 == 1)//just int and in stack postion 0
{
Answer = s0[--idx0];
}
else
{
Answer = 0;
}
printf("Case#%d:", t);
printf("%d %d\n", idx0, Answer);
}
return 0;
}
相关文章推荐
- vetor和数组的区别 vector和List的区别
- 【转】精简深拷贝ArrayList实例
- 【转】关于Adapter的The content of the adapter has changed问题分析 关于Adapter的The content of the adapter has changed问题分析
- JavaScript全局函数
- 任何事都不要指望别人
- Watch OS 2 Complication开发教程(三)基本数据(持续连载中)
- 2.05米的绳子
- 【转】Java如何克隆集合——深度拷贝ArrayList和HashSet
- Remove Element
- OpenCV空洞填充算法
- Python初学(1)
- android体系结构以及源代码阅读环境搭建
- [Linux]curl输出原始数据,不对网页解压
- Android进程间通信模型之思考Binder和Service_manager的模型
- OpenCV空洞填充算法
- 【转】解决java.lang.IllegalStateException: The content of the adapter has changed but ListView...的问题
- Solarized配色方案
- Find them, Catch them
- HDU 1598 find the most comfortable road
- 一小时了解数据挖掘⑤数据挖掘步骤&常用的聚类、决策树和CRISP-DM概念