前缀、中缀、后缀表达式转换C++

#include <iostream>
#include <stack>
#include <cctype>
using namespace std;

//优先级 
int you(char c){
	if(c=='+'||c=='-')
		return 0;
	else
		return 1;
}

//中缀转前缀,从后向前扫描,然后翻转 
void in2pre(char A[], char B[], int n){
	stack<char> sign;//符号栈 
	int j = 0;//B中元素个数 
	for(int i=n-1; i>=0; --i){
		//数字直接入栈 
		if(isdigit(A[i]))
			B[j++] = A[i];
		else if(A[i]==')')
			sign.push(A[i]);
		else if(A[i]=='('){
			while(sign.top()!=')'){
				B[j++] = sign.top();
				sign.pop();
			}
			sign.pop();//删掉右括号 
		}
		//符号比较优先级 
		else{
			if(sign.empty())
				sign.push(A[i]);
			else{
				//A[i]与栈顶元素比较优先级，直到遇到')'或者栈空 
				while(!sign.empty() && sign.top()!=')' && you(A[i])<you(sign.top())){
					B[j++] = sign.top();
					sign.pop();
				}
				sign.push(A[i]);
			}
		} 
	} 
	//栈中如果还有符号，直接添加到B中就ok 
	while(!sign.empty()){
		B[j++] = sign.top();
		sign.pop();
	}
	//翻转
	for(int i=0; i<j/2; ++i){
		int t = B[i];
		B[i] = B[j-i-1];
		B[j-i-1] = t;
	} 
} 

//中缀转后缀 
void in2post(char A[], char B[], int n){
	stack<char> sign;//符号栈 
	int j = 0;//B中元素个数 
	for(int i=0; i<n; ++i){
		//数字直接入栈 
		if(isdigit(A[i]))
			B[j++] = A[i];
		else if(A[i]=='(')
			sign.push(A[i]);
		else if(A[i]==')'){
			while(sign.top()!='('){
				B[j++] = sign.top();
				sign.pop();
			}
			sign.pop();//删掉左括号 
		}
		//符号比较优先级 
		else{
			if(sign.empty())
				sign.push(A[i]);
			else{
				//A[i]与栈顶元素比较优先级，直到遇到'('或者栈空 
				while(!sign.empty() && sign.top()!='(' && you(A[i])<you(sign.top())){
					B[j++] = sign.top();
					sign.pop();
				}
				sign.push(A[i]);
			}
		} 
	} 
	//栈中如果还有符号，直接添加到B中就ok 
	while(!sign.empty()){
		B[j++] = sign.top();
		sign.pop();
	}
} 

int main(){
	char A[16] = "1+2*3+(4*5+6)*7";
	char B[16] = {0};
	in2post(A, B, 15);
	for(int i=0; i<15; ++i){
		cout << B[i] << ' ';
	}
	return 0;
}