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(struct 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
/**
* Is the bracket matching?
*
* @param paraString The given expression.
* @return Match or not.
*/
bool bracketMatching(char* paraString, int paraLength) {
// Step 1. Initialize the stack through pushing a '#' at the bottom.
CharStackPtr tempStack = charStackInit();
push(tempStack, '#');
char tempChar, tempPopedChar;
// Step 2. Process the string.
for (int i = 0; i < paraLength; i++) {
tempChar = paraString[i];
switch (tempChar) {
case '(':
case '[':
case '{':
push(tempStack, tempChar);
break;
case ')':
tempPopedChar = pop(tempStack);
if (tempPopedChar != '(') {
return false;
} // Of if
break;
case ']':
tempPopedChar = pop(tempStack);
if (tempPopedChar != '[') {
return false;
} // Of if
break;
case '}':
tempPopedChar = pop(tempStack);
if (tempPopedChar != '{') {
return false;
} // Of if
break;
default:
// Do nothing.
break;
}// Of switch
} // Of for i
tempPopedChar = pop(tempStack);
if (tempPopedChar != '#') {
return true;
} // Of if
return true;
}// Of bracketMatching
/**
* Unit test.
*/
void bracketMatchingTest() {
char* tempExpression = "[2 + (1 - 3)] * 4";
bool tempMatch = bracketMatching(tempExpression, 17);
printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
tempExpression = "( ) )";
tempMatch = bracketMatching(tempExpression, 6);
printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
tempExpression = "()()(())";
tempMatch = bracketMatching(tempExpression, 8);
printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
tempExpression = "({}[])";
tempMatch = bracketMatching(tempExpression, 6);
printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
tempExpression = ")(";
tempMatch = bracketMatching(tempExpression, 2);
printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
}// Of bracketMatchingTest
/**
The entrance.
*/
void main() {
// pushPopTest();
bracketMatchingTest();
}// Of main
---------------------------------------------------------------------------------------------------------------------------------my code:
#include<stdio.h>
#include<malloc.h>
#include<string.h>
#define size 15
typedef struct stack
{
int top;
char data[size];
}stack, * stackptr;
stackptr init_stack()
{
stackptr ptr = (stackptr)malloc(sizeof(stack));
ptr->top = -1;
return ptr;
}
void push(stackptr ptr, char a)
{
if (ptr->top >= size - 1)
{
printf("stack is full");
}
else
{
ptr->top++;
ptr->data[ptr->top] = a;
}
}
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
{
ptr->top--;
}
}
bool bracket(stackptr ptr,char arr[size],int len)
{
int i = 0;
for (i = 0; i < len; i++)
{
if (arr[i]=='('||arr[i]=='['||arr[i]=='{')
{
push(ptr, arr[i]);
}
if (arr[i] == ')')
{
if (ptr->data[ptr->top] != '(')
{
return false;
}
pop(ptr);
}
if (arr[i] == ']')
{
if (ptr->data[ptr->top] != '[')
{
return false;
}
pop(ptr);
}
if (arr[i] == '}')
{
if (ptr->data[ptr->top] != '{')
{
return false;
}
pop(ptr);
}
}
if (ptr->top < 0)
{
return true;
}
}
void match(int tr)
{
if (tr == 1)
{
printf("match successfully\n");
}
else
{
printf("fail to match\n");
}
}
int main()
{
stackptr ptr = init_stack();
char arr1[size] = "[()()]";
match(bracket(ptr,arr1, strlen(arr1)));
ptr->top = -1;
char arr2[size] = "[(4 + 5])";
match(bracket(ptr, arr2, strlen(arr2)));
ptr->top = -1;
char arr3[size] = "[(2-1))*3]";
match(bracket(ptr, arr3, strlen(arr3)));
ptr->top = -1;
char arr4[size] = "[{(2*)}1]";
match(bracket(ptr, arr4, strlen(arr4)));
return 0;
}