中缀表达式转后缀表达式(用自己手写的栈库)

# ifndef LINKSTACK_H
# define LINKSTACK_H

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


//链式栈的结点
typedef struct LINKNODE
{
	struct LINKNODE* next;
}LinkNode;

//链式栈
typedef struct LINKSTACK
{
	LinkNode head;
	int size;
}LinkStack;

//初始化函数
LinkStack* Init_LinkStack();
//入栈
void Push_LinkStack(LinkStack* stack, LinkNode* data);
//出栈
void Pop_LinkStack(LinkStack* stack);
//返回栈顶元素
LinkNode* Top_LinkStack(LinkStack* stack);
//返回栈元素的个数
int Size_LinkStack(LinkStack* stack);
//清空栈
void Clear_SeqStack(LinkStack* stack);
//销毁
void FreeSpace_SeqStack(LinkStack* stack);

# endif


# include "LinkStack.h"

//初始化函数
LinkStack* Init_LinkStack()
{
	LinkStack* stack = (LinkStack*)malloc(sizeof(LinkStack));
	stack->head.next = NULL;
	stack->size = 0;
	return stack;
}
//入栈
void Push_LinkStack(LinkStack* stack, LinkNode* data)
{
	if(stack == NULL)
	{
		return ;
	}
	if(data == NULL)
	{
		return ;
	}

	data->next = stack->head.next;
	stack->head.next = data;
	stack->size++;
}
//出栈
void Pop_LinkStack(LinkStack* stack)
{
	if(stack == NULL)
	{
		return ;
	}
	if(stack->size == 0)
	{
		return ;
	}
	//第一个有效结点
	LinkNode* pNext = stack->head.next;
	stack->head.next = pNext->next;
	stack->size--;
}
//返回栈顶元素
LinkNode* Top_LinkStack(LinkStack* stack)
{
	if(stack == NULL)
	{
		return NULL;
	}
	if(stack->size == 0)
	{
		return NULL;
	}
	return stack->head.next;
}
//返回栈元素的个数
int Size_LinkStack(LinkStack* stack)
{
	if(stack == NULL)
	{
		return -1;
	}
	return stack->size;
}
//清空栈
void Clear_SeqStack(LinkStack* stack)
{
	if(stack == NULL)
	{
		return ;
	}
	stack->head.next = NULL;
	stack->size = 0;

}
//销毁
void FreeSpace_SeqStack(LinkStack* stack)
{
	if(stack == NULL)
	{
		return ;
	}
}


# include "LinkStack.h"

//判断是不是数字
int IsNumbre(char c)
{
	return c>= '0' && c <= '9';
}

//判断是不是左括号
int IsLeft(char c)
{
	return c == '(';
}
//判断是不是右括号
int IsRight(char c)
{
	return c == ')';
}
//判断是不是运算符号
int IsOperator(char c)
{
	return c == '+' || c == '-' || c == '*'|| c == '/';
}
//返回运算符号优先级
int GetPrioity(char c)
{
	if(c == '*'|| c== '/')
	{
		return 2;
	}
	else if(c == '+'|| c== '-')
	{
		return 1;
	}
	else 
	{
		return 0;
	}
}

typedef struct MYCHAR
{
	LinkNode node;
	char* p;
}MyChar;


//对数字的操作
void NUmbreOperator(char* p)
{
	printf("%c", *p);
}

//创建MyChar
MyChar* CreateMyChar(char* p)
{
	MyChar* mychar = (MyChar*)malloc(sizeof(MyChar));
	mychar->p = p;
	return mychar;
}

//对左括号的操作
void LeftOperator(LinkStack* stack, char* p)
{
	Push_LinkStack(stack, (LinkNode*)CreateMyChar(p));
}
//对右括号的操作
void RightOperator(LinkStack* stack)
{
	//先判断栈中有没有元素
			while(Size_LinkStack(stack))
			{
				MyChar* mychar = (MyChar*)Top_LinkStack(stack);
				//如果匹配的左括号就弹出
				if(IsLeft(*(mychar->p)))
				{
					Pop_LinkStack(stack);
					break;
				}
				//输出
				printf("%c",*(mychar->p));
				//弹出
				Pop_LinkStack(stack);
				//释放内存
				free(mychar);
			}
}

//运算符号的操作
void OperatorOperate(LinkStack* stack, char* p)
{
	//先取出栈顶符号
	MyChar* mychar = (MyChar*)Top_LinkStack(stack);
	if(mychar == NULL)
	{
		Push_LinkStack(stack, (LinkNode*)CreateMyChar(p));
		return ;
	}
	//如果栈顶优先级低于当前字符的优先级 直接入栈
	if(GetPrioity(*(mychar->p)) < GetPrioity(*p))
	{
		Push_LinkStack(stack, (LinkNode*)CreateMyChar(p));
		return ;
	}
	//如果栈顶符号优先级不低
	else
	{
		while(Size_LinkStack(stack))
		{
			MyChar* mychar2 = (MyChar*)Top_LinkStack(stack);
			//如果优先级低 当前符号入栈
			if(GetPrioity(*(mychar2->p)) <  GetPrioity(*p))
			{
				Push_LinkStack(stack, (LinkNode*)CreateMyChar(p));
				break;
			}
			//输出
			printf("%c",*(mychar2->p));
			//弹出
			Pop_LinkStack(stack);
			//释放
			free(mychar2);
		}
	}
	
	
}

int main(int argc, char *argv[])
{
	char* str = "8+(3-1)*5";
	char* p = str;

	//创建栈
	LinkStack* stack = Init_LinkStack();

	while(*p != '\0')
	{
		//如果是数字
		if(IsNumbre(*p))
		{
			//直接输出
			NUmbreOperator(p);
		}
		//如果左括号直接进栈
		 if(IsLeft(*p))
		{
			LeftOperator(stack, p);
		}
		//如果是右括号
		 if(IsRight(*p))
		{
			RightOperator(stack);
		}
		//如果是运算符号
		 if(IsOperator(*p))
		{
			OperatorOperate(stack, p);
		}
		p++;
	}
	while(Size_LinkStack(stack))
	{
		MyChar* mychar = (MyChar*)Top_LinkStack(stack);
		printf("%c", *(mychar->p));
		Pop_LinkStack(stack);
		free(mychar);
	}
	printf("\n"); 
	return 0;
}