栈（一）——栈的基本操作

标签：栈   出栈pop   入栈push   

3.任意输入一个十进制整数x(x<32768)，输出x的二进制值。

#include <stdio.h>

#define MAXSIZE	15

int main()
{
	int a[MAXSIZE];
	int bottom, top;
	int x;

	bottom = top = -1;
	printf("Please input x(0<=x<=32767):");
	scanf("%d", &x);
	while(x)
	{
		a[++top] = x%2;
		x /= 2;
	}
	while(-1 != top)
	{
		printf("%d ", a[top--]);
	}
	printf("\n");

	return 0;
}

#include <stdio.h>

#define MAXSIZE	100

int main()
{
	char a[MAXSIZE];
	int top = -1;
	int i;

	printf("Please input a expression:");
	gets(a);
	i = 0;
	while(a[i])
	{
		if('(' == a[i])
			top ++;
		else if(')' == a[i])
		{
			if(-1 == top)
				break;
			else
				top --;
		}
		i ++;
	}

	if('\0' == a[i] && -1 == top)
		printf("Match.\n");
	else
		printf("Not match.\n");
	return 0;
}

5.栈的基本操作——出栈和入栈

#include <stdio.h>
#include <malloc.h>

typedef struct st
{
	int maxsize;
	int top;
	int *pstack;
}stack;

void create_stack(stack *s, int ms);
void push(stack *s, int x);
int pop(stack *s);
void clear_stack(stack *s);

int main()
{
	stack s;
	int ms, i;
	int a[] = {13, 17, 15, 25};
	
	printf("Please input stack size:");
	scanf("%d", &ms);
	create_stack(&s, ms);
	for(i = 0; i < 4; i++)
		push(&s, a[i]);
	while(s.top != -1)
		printf("%d ", pop(&s));
	printf("\n");
	clear_stack(&s);

	return 0;
}

void create_stack(stack *s, int ms)
{
	s->maxsize = ms;
	s->top = -1;
	s->pstack = (int *)malloc(ms*sizeof(int));
}

void push(stack *s, int x)
{
	if(s->top < s->maxsize-1)
		s->pstack[++s->top] = x;
}

int pop(stack *s)
{
	if(s->top != -1)
		return s->pstack[s->top--];
}

void clear_stack(stack *s)
{
	s->maxsize = 0;
	s->top = -1;
	free(s->pstack);
	s->pstack = 0;
}

栈（一）——栈的基本操作,布布扣,bubuko.com

栈（一）——栈的基本操作

标签：栈   出栈pop   入栈push   

原文地址：http://blog.csdn.net/laoniu_c/article/details/38183705