/**
*20152101033
*裴文君
**/

import?java.util.Stack;
import?java.util.regex.Pattern;

public?class?change{

????private?change（）?{
????}

????public?static?int?error（String?infix）?{
????????int?error=0;
????????int?length?=?infix.length（）+1;
????????int?k=0;
????????int?num=0;
????????int?n=0;
????????int[]?a=new?int?[length];
????????for?（int?i?=?0;?i?????????	a[i]=0;
????????}
????????for?（int?i?=?0;?i?????????{
????????????Character?temp;
????????????char?c?=?infix.charAt（i）;
????????????switch?（c）?{
????????????//?忽略空格
????????????case?‘?‘:
????????????????break;
????????????//?碰到‘（‘，push到棧
????????????case?‘（‘:
????????????????n++;k++;num=0;
????????????????temp=infix.charAt（i+1）;
????????????????
????????????????if（temp>=‘0‘&&temp<=‘9‘）?n++;
????????????????else?if（temp!=‘（‘）{a[n]=1;}
????????????????int?p=i+1;?Boolean?b=false;
????????????????while（p????????????????{
????????????????	if（infix.charAt（p）==‘+‘||infix.charAt（p）==‘-‘||infix.charAt（p）==‘*‘||infix.charAt（p）==‘/‘）
????????????????	????{b=true;}
????????????????	p++;
????????????	}
????????????????if（!b）?{a[n]=2;}?
????????????????break;
????????????//?碰到‘+‘‘-‘，將棧中所有運算符彈出，送到輸出隊列中
????????????case?‘+‘:
????????????case?‘-‘:
????????????case?‘*‘:
????????????case?‘/‘:
????????????	if（num!=1&&n==0）?{a[n]=1;}
????????????	n++;
????????????	if（i+1>=length-1）?a[n]=1;
????????????	else?
????????????		{temp=infix.charAt（i+1）;
????????????		if（temp>=‘0‘&&temp<=‘9‘）?n++;
????????????		else?if（temp!=‘（‘）?{a[n]=1;}
????????????????	?
????????????		}
????????????	num=0;
????????????????break;
????????????//?碰到‘*‘‘/‘，將棧中所有乘除運算符彈出，送到輸出隊列中
????????????
????????????//?碰到右括號，將靠近棧頂的第一個左括號上面的運算符全部依次彈出，送至輸出隊列后，再丟棄左括號
????????????case?‘）‘:
????????????????n++;k--;
????????????????if（i+1????????????????{temp=infix.charAt（i+1）;
????????????	if（temp>=‘0‘&&temp<=‘9‘||temp==‘（‘）?{a[n]=2;}}
????????????	num=0;
????????????????break;
????????????//如果是數字，直接送至輸出序列
????????????default:
????????????????if（num==0）?num=1;
????????????????if（i+1????????????????{temp=infix.charAt（i+1）;
????????????????if（temp==‘（‘）{a[n]=1;}
????????????????}
????????????????break;
????????}
????????????
????????}
???????
????????if（k!=0）?{System.out.println（“括號不匹配“）;error++;}
????????
????????for?（int?i?=?0;?i?????????	int?kk=i+1;
????????	if（a[i]==1）??
????????	{
????????		if（i==0）?
????????			{System.out.println（“第1個字符前缺少運算量“）;error++;}
????????		else?
????????			{System.out.println（“第“+kk+“個字符后缺少運算量“）;error++;}
????????	}
????????	else?if（a[i]==2）
????????		{System.out.println（“第“+kk+“個字符后缺少運算符“）;error++;}
????????
????????}
????????return?error;
????}
????//方法：中綴表達式轉成后綴表達式
????public?static?String?infixToSuffix（String?infix）?{
????????Stack?stack?=?new?Stack（）;
????????String?suffix?=?““;
????????int?length?=?infix.length（）;
????????for?（int?i?=?0;?i?????????????Character?temp;
?????????