C언어- 스택Stack(C언어 코드로 구현하기)macOS

 

// Stack Example

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

int Stack[10];
int top=-1;

int push(int dat);
int pop(void);
int printstack(void);

int main(void) {
	int inval, innum;
	printf(" - Algorithm Stack - \n");
	printf("Made by POM(lovebeen04@gmail.com)\n");
	printf("=================================\n");
	printf("1. Push Value\n");
	printf("2. Pop Value\n");
	printf("3. Print Stack\n");
	printf("4. Exit\n");
	printf("=================================\n");
	printf("> Enter Number: ");
	scanf("%d", &inval);

	switch(inval) {
		case 1:
			system("clear");
			printf("> Enter Number: ");
			scanf("%d", &innum);
			push(innum);
			break;
		case 2:
			pop();
			break;
		case 3:
			printstack();
			break;
		case 4:
			printf("Bye ~ Bye~ \n");
			return 0;
		default:
			system("clear");
			printf(" Error\n");
			break;
	}

	return 0;
}

int push(int dat) {
	if(top >= 9) {
		system("clear");
		printf("Stack Overflow\n");
		getchar();
		system("clear");
		main();
	} else {
		top++;
		Stack[top] = dat;
		system("clear");
		printf("Push %d\n", dat);
		getchar();
		system("clear");
		main();
	}
}

int pop(void) {
	system("clear");
	if(top <= -1) {
		system("clear");
		printf("Stack Downflow\n");
		getchar();
		system("clear");
		main();
	} else {
		Stack[top] = 0;
		top--;
		main();
	}
}

int printstack(void) {
	int a;
	system("clear");
	printf("=================================\n");
	for(a=9; a>=0; a--) printf("%d\n", Stack[a]);
	printf("=================================\n");
	getchar();
	main();
}

 

 

 

conio.h 를 대체한 코드 getchar를 쓰자!

https://www.quora.com/What-can-be-a-standard-alternative-to-getch

What can be a standard alternative to getch()?

* Stack Example */

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

int Stack[10];
int top=-1;

int push(int dat);
int pop(void);
int printstack(void);

int main(void) {
	int inval, innum;
	printf(" - Algorithm Stack - \n");
	printf("Made by POM(lovebeen04@gmail.com)\n");
	printf("=================================\n");
	printf("1. Push Value\n");
	printf("2. Pop Value\n");
	printf("3. Print Stack\n");
	printf("4. Exit\n");
	printf("=================================\n");
	printf("> Enter Number: ");
	scanf("%d", &inval);

	switch(inval) {
		case 1:
			system("cls");
			printf("> Enter Number: ");
			scanf("%d", &innum);
			push(innum);
			break;
		case 2:
			pop();
			break;
		case 3:
			printstack();
			break;
		case 4:
			system("pause");
			break;
		default:
			system("cls");
			printf(" Error\n");
			break;
	}

	return 0;
}

int push(int dat) {
	if(top >= 9) {
		system("cls");
		printf("Stack Overflow\n");
		getch();
		system("cls");
		main();
	} else {
		top++;
		Stack[top] = dat;
		system("cls");
		printf("Push %d\n", dat);
		getch();
		system("cls");
		main();
	}
}

int pop(void) {
	system("cls");
	if(top <= -1) {
		system("cls");
		printf("Stack Downflow\n");
		getch();
		system("cls");
		main();
	} else {
		Stack[top] = 0;
		top--;
		main();
	}
}
int printstack(void) {
	int a;
	system("cls");
	printf("=================================\n");
	for(a=9; a>=0; a--) printf("%d\n", Stack[a]);
	printf("=================================\n");
	getch();
	system("cls");
	main();
}

 

 

 

 

출처 : 

 

https://ko.wikipedia.org/wiki/%EC%8A%A4%ED%83%9D#:~:text=%EC%8A%A4%ED%83%9D(stack)%EC%9D%80%20%EC%A0%9C%ED%95%9C%EC%A0%81%EC%9C%BC%EB%A1%9C,(Pushdown%20list)%EC%9D%B4%EB%9D%BC%EA%B3%A0%EB%8F%84%20%ED%95%9C%EB%8B%A4. 

스택 - 위키백과, 우리 모두의 백과사전

 

 

 

 

 

 

 

 

---