professor's code:
#include <stdio.h>
#include <malloc.h>
#define STACK_MAX_SIZE 10
/**
* Linear stack of integers. The key is data.
*/
typedef struct CharStack {
int top;
int data[STACK_MAX_SIZE]; //The maximum length is fixed.
} *CharStackPtr;
/**
* Output the stack.
*/
void outputStack(CharStackPtr paraStack) {
for (int i = 0; i <= paraStack->top; i ++) {
printf("%c ", paraStack->data[i]);
}// Of for i
printf("\r\n");
}// Of outputStack
/**
* Initialize an empty char stack. No error checking for this function.
* @param paraStackPtr The pointer to the stack. It must be a pointer to change the stack.
* @param paraValues An int array storing all elements.
*/
CharStackPtr charStackInit() {
CharStackPtr resultPtr = (CharStackPtr)malloc(sizeof(CharStack));
resultPtr->top = -1;
return resultPtr;
}//Of charStackInit
/**
* Push an element to the stack.
* @param paraValue The value to be pushed.
*/
void push(CharStackPtr paraStackPtr, int paraValue) {
// Step 1. Space check.
if (paraStackPtr->top >= STACK_MAX_SIZE - 1) {
printf("Cannot push element: stack full.\r\n");
return;
}//Of if
// Step 2. Update the top.
paraStackPtr->top ++;
// Step 3. Push element.
paraStackPtr->data[paraStackPtr->top] = paraValue;
}// Of push
/**
* Pop an element from the stack.
* @return The poped value.
*/
char pop(CharStackPtr paraStackPtr) {
// Step 1. Space check.
if (paraStackPtr->top < 0) {
printf("Cannot pop element: stack empty.\r\n");
return '\0';
}//Of if
// Step 2. Update the top.
paraStackPtr->top --;
// Step 3. Push element.
return paraStackPtr->data[paraStackPtr->top + 1];
}// Of pop
/**
* Test the push function.
*/
void pushPopTest() {
printf("---- pushPopTest begins. ----\r\n");
// Initialize.
CharStackPtr tempStack = charStackInit();
printf("After initialization, the stack is: ");
outputStack(tempStack);
// Pop.
for (char ch = 'a'; ch < 'm'; ch ++) {
printf("Pushing %c.\r\n", ch);
push(tempStack, ch);
outputStack(tempStack);
}//Of for i
// Pop.
for (int i = 0; i < 3; i ++) {
ch = pop(tempStack);
printf("Pop %c.\r\n", ch);
outputStack(tempStack);
}//Of for i
printf("---- pushPopTest ends. ----\r\n");
}// Of pushPopTest
/**
The entrance.
*/
void main() {
pushPopTest();
}// Of main
---------------------------------------------------------------------------------------------------------------------------------
my code:
#include<stdio.h>
#include<malloc.h>
#define size 10
typedef struct stack
{
int top;
int data[size];
}stack,* stackptr;
stackptr init_stack()
{
stackptr ptr=(stackptr)malloc(sizeof(stack));
ptr->top = -1;
return ptr;
}
void push(stackptr ptr, int charvalue)//此处把字符的值(int型)存在data中
{
if (ptr->top >= size - 1)
{
printf("stack is full");
}
else
{
ptr->top++;
ptr->data[ptr->top] = charvalue;
}
}
void print_stack(stackptr ptr)
{
for (int i = 0; i <= ptr->top; i++)
{
printf("%c", ptr->data[i]);
}
printf("\n");
}
void pop(stackptr ptr)
{
if (ptr->top < 0)
{
printf("stack is empty\n");
}
else
{
printf("pop %c\n", ptr->data[ptr->top]);
ptr->top--;
if (ptr->top == -1)
{
printf("stack is empty\n");//如果此时栈内刚好无数据
}
}
}
int main()
{
stackptr ptr = init_stack();
for (int i = 0; i < size; i++)
{
if (i != size - 1)
{
printf("loading ");
}
push(ptr, 'a' + i);
print_stack(ptr);
if (i == size - 1)
{
printf("loading over\n");
}
}
for (int i = 0; i < size; i++)
{
pop(ptr);
print_stack(ptr);
}
return 0;
}
运行结果: