【括号匹配&洛谷&进制转换】栈的实战，包教包会

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

typedef struct Stack
{
	char* a;
	int top;
	int capacity;
}Stack;


void StackInit(Stack* ps)
{
	ps->a = (char*)malloc(sizeof(char)*4);
	if (ps->a == NULL)
	{
		printf("malloc fail\n");
		exit(-1);
	}
	ps->capacity = 4;
	ps->top = 0;//ps->top初始化为0
}

void StackPush(Stack* ps,char ch)
{
    //判断是否要扩容
	if (ps->top == ps->capacity)
	{
		int newcapacity = ps->capacity * 2;
		char* temp = realloc(ps->a, sizeof(char)*newcapacity);
		if (temp == NULL)
		{
			printf("realloc fail\n");
			exit(-1);
		}
		else
		{
			ps->capacity = newcapacity;
			ps->a = temp;
		}
	}

   //以上为判断是否要扩容并完成扩容

   //入栈
	ps->a[ps->top] = ch;
	ps->top++;
}

int StackIsEmpty(Stack* ps)
{
	return ps->top == 0;//空为真，返回1
}

void StackPop(Stack* ps)
{
    assert(!StackIsEmpty());
	ps->top--;//出栈
}

int main()
{
	char ch = 0;
	Stack ST;
   //初始化栈
	StackInit(&ST);
    //循环读入字符，不用再加一个getchar清理缓冲区，因为最后的回车时已经退出循环
	while ((ch=getchar())!='@')
	{
		//当遇到左括号
		if (ch == '(') StackPush(&ST, ch);
        //当遇到右括号
		else if(ch == ')')
		{

			if (StackIsEmpty(&ST)==0)//不为空
			{
				StackPop(&ST);
			}
			else
			{
				printf("NO\n");
				return 0;
			}

		}
	}
//ch=='@'退出循环

	if (StackIsEmpty(&ST))
	{
		printf("YES\n");
	}
	else
	{
		printf("NO\n");
	}


	return 0;
}

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

typedef struct Stack
{
	char* a;
	int capacity;
	int top;
}Stack;



void StackInit(Stack* ps)
{

	ps->a = (char*)malloc(sizeof(char) * 4);
	ps->top = 0;
	ps->capacity = 4;
}

void StackPush(Stack* ps, int e)
{
	assert(ps);
	if (ps->capacity == ps->top)
	{
		int newcapacity = 2 * ps->capacity;
		char* temp = realloc(ps->a, sizeof(char) * newcapacity);
		if (temp == NULL)
		{
			printf("realloc fail\n");
			exit(-1);
		}
		else
		{
			ps->capacity = newcapacity;
			ps->a = temp;
		}
	}
	ps->a[ps->top] = e;
	ps->top++;
}

void  StackPop(Stack* ps)
{
	ps->top--;
}

int StackIsEmpty(Stack* ps)
{
	return ps->top == 0;
}


char StackTop(Stack* ps)
{
	assert(!StackIsEmpty(ps));
	return ps->a[ps->top - 1];
}



void StackDestory(Stack* ps)
{
	free(ps->a);
	ps->a = NULL;
	ps->top = ps->capacity = 0;
}


int main()
{

	char str[] = "{}()[(]";
	
	Stack ST;
	StackInit(&ST);
	char* s = str;
	while (*s)//结束条件3
	{
		if (( * s == '(' )||( * s == '{') ||( * s == '['))
		{
			StackPush(&ST,*s);
			s++;
		}
		else
		{
			if (StackIsEmpty(&ST))//结束条件1
			{
				
				StackDestory(&ST);
				printf("NO\n");
				return 0;
			}
			char ch = StackTop(&ST);//栈内不空则取栈顶元素,因为有这行代码隔开，所以下面不能用else if和上面的if匹配
			if(( * s == ')' && ch != '(')||( * s == ']' && ch != '[')||(* s == '}' && ch != '{'))    //结束条件2
			{
				
				StackDestory(&ST);
				printf("NO\n");
				return 0;
			}
			else
			{
				StackPop(&ST);
				s++;
			}
		}
	}
//正常结束循环只能说明所有的右括号都有左括号和它匹配，这里还要排除左括号多余的情况
	if (StackIsEmpty(&ST))
	{
		printf("YRS\n");
	}
	else
	{
		printf("NO\n");
	}

	StackDestory(&ST);
	return 0;


}

#define _CRT_SECURE_NO_WARNINGS 1

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

typedef struct Stack
{
	int* a;
	int capacity;
	int top;
}Stack;



void StackInit(Stack* ps)
{

	ps->a = (int*)malloc(sizeof(int) * 4);
	ps->top = 0;
	ps->capacity = 4;
}

void StackPush(Stack* ps, int e)
{
	assert(ps);
	if (ps->capacity == ps->top)
	{
		int newcapacity = 2 * ps->capacity;
		int* temp = realloc(ps->a, sizeof(int) * newcapacity);
		if (temp == NULL)
		{
			printf("realloc fail\n");
			exit(-1);
		}
		else
		{
			ps->capacity = newcapacity;
			ps->a = temp;
		}
	}
	ps->a[ps->top] = e;
	ps->top++;
}

void  StackPop(Stack* ps)
{
	ps->top--;
}

int StackIsEmpty(Stack* ps)
{
	return ps->top == 0;
}


int StackTop(Stack* ps)
{
	assert(!StackIsEmpty(ps));
	return ps->a[ps->top - 1];
}



void StackDestory(Stack* ps)
{
	free(ps->a);
	ps->a = NULL;
	ps->top = ps->capacity = 0;
}


int main()
{
	Stack ST;
	StackInit(&ST);
	int n;
	scanf("%d", &n);
	while (n != 0)
	{
		StackPush(&ST, n % 8);
		n /= 8;
	}
	while (!StackIsEmpty(&ST))
	{
		printf("%d", StackTop(&ST));
		StackPop(&ST);
	}
	StackDestory(&ST);
	return 0;
}