栈和栈的应用

栈

栈是一个符合先进先出的结构， 首先呈上老师的代码

#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

根据逻辑不难写出自己的代码:

#include <bits/stdc++.h>
#define isMyWife main

using namespace std;

typedef int remilia;

template<class T>
class Stack {
	private: 
		T* data;
		int length;
		int capacity;
		
		void coupleCapacity() {
			if (length == capacity) {
				capacity = !capacity ? 1 : capacity * 2;
				size_t newCapacity = capacity;
				data = (T*) realloc (data, newCapacity * sizeof(T));
			}
		}
		
	public: 
		int npos;
		
		Stack() {
			data = nullptr;
			length = capacity = 0;
			npos = -158412684;
		}
		
		virtual ~Stack() {
			
		}
		
		int push(T e) {
			coupleCapacity();
			data[length++] = e;
			return 1;
		}
		
		T pop() {
			return length ? data[--length] : npos;
		}
		
		int size() {
			return length;
		}
		
		bool empty() {
			return length == 0;
		}
};

remilia isMyWife() {
	Stack<int> s;
	
	for (int i = 1; i <= 10; i++) {
		s.push(i);
	}	
	
	while (s.size()) {
		cout << s.pop() << " ";
	}
}

栈的应用

括号匹配

利用栈来检测字符串中的括号是否匹配
老师代码:

#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

我的代码:

#include <bits/stdc++.h>
#define isMyWife main

using namespace std;

typedef int remilia;

template<class T>
class Stack {
	private: 
		T* data;
		int length;
		int capacity;
		
		void coupleCapacity() {
			if (length == capacity) {
				capacity = !capacity ? 1 : capacity * 2;
				size_t newCapacity = capacity;
				data = (T*) realloc (data, newCapacity * sizeof(T));
			}
		}
		
	public: 
		int npos;
		
		Stack() {
			data = nullptr;
			length = capacity = 0;
			npos = -158412684;
		}
		
		virtual ~Stack() {
			
		}
		
		int push(T e) {
			coupleCapacity();
			data[length++] = e;
			return 1;
		}
		
		T pop() {
			return length ? data[--length] : npos;
		}
		
		int size() {
			return length;
		}
		
		bool empty() {
			return length == 0;
		}
};

map<char, int> leftMap { {'(', 1}, {'[', 2}, {'{', 3} };
map<char, int> rightMap { {')', 1}, {']', 2}, {'}', 3} };

bool isTrue() {
	Stack<char> s;
	string str;
	cin >> str;
	
	for (auto e : str) {
		if (leftMap[e]) {
			s.push(e);
		} else if (rightMap[e]) {
			if (s.size() && rightMap[e] == leftMap[s.pop()]) {
				continue;
			} else {
				return false;
			}
		}
	}
	
	if (s.size()) {
		return false;
	}
	
	return true;
}

remilia isMyWife() {
	for (int i = 1; i <= 5; i++) {
		cout << isTrue() << " ";
	}
}

表达式求值

#include <bits/stdc++.h>

using namespace std;

stack<char> op;
stack<int> num;

map<char, int> h{ {'+', 1}, {'-', 1}, {'*', 2}, {'/', 2} };

int calculate() {
    int a = num.top();
    num.pop();
    int b = num.top();
    num.pop();
    char operat = op.top();
    op.pop();
    int r = 0;
    switch(operat) {
        case '+':
            r = b + a;
            break;
        case '-':
            r = b - a;
            break;
        case '*':
            r = b * a;
            break;
        case '/':
            r = b / a;
            break;
    }
    num.push(r);
    return r;
}

int main() {
    string s;
    cin >> s;
    for (int i = 0; i < s.length(); i++) {
        if (isdigit(s[i])) {
            int x = 0, j = i;
            while (j < s.length() && isdigit(s[j])) {
                x = x * 10 + s[j] - 48;
                j++; 
            }
            num.push(x);
            i = j - 1;
        } else if (s[i] == '(') {
            op.push(s[i]);
        } else if (s[i] == ')') {
            while (op.top() != '(') {
                calculate();
            } 
            op.pop();
        } else {
            while (op.size() && h[op.top()] >= h[s[i]]) {
                calculate();
            }
            op.push(s[i]);
        }
    }
    while (op.size()) {
        calculate();
    }
    cout << num.top();
    return 0;
}