1+2+3 aaa)bbbbbb((cccc)
判斷這段字符串中的括號是否對上如果沒有對上是那一個沒有對上

判斷他是否是括號不是就執行下一次

匹配到左括號將它壓入堆棧

匹配到右括號判斷棧是否為空，空表示右括號沒有匹配的左括號

不為空執行彈棧，如果是左就匹配

判斷此時的棧如果為空，左括號沒有匹配的右括號

.h

//鏈式棧的節點 typedef struct LINKNODE {struct LINKNODE*next; }LinkNode;//鏈式棧 typedef struct LINKSTACK {LinkNode head;int size;}LinkStack;class linkstack { public:linkstack();~linkstack(); public:LinkStack* Stack;public://入棧void push_back(LinkStack* stack,LinkNode* data);//出棧void pop_back(LinkStack* stack);//返回棧頂元素LinkNode* Top_LinkStack(LinkStack* stack);//返回棧元素的個數int Size_LinkStack(LinkStack* stack);//清空棧void Clear_LinkStack(LinkStack* stack);};

.cpp

linkstack::linkstack() {Stack = new LinkStack;Stack->head.next = NULL;Stack->size = 0; }linkstack::~linkstack() {if (Stack == NULL){return;}delete Stack;}//入棧 void linkstack::push_back(LinkStack* stack, LinkNode* data) {if (stack == NULL || data == NULL){return;}data->next = stack->head.next;stack->head.next = data;stack->size++; }//出棧 void linkstack::pop_back(LinkStack* stack) {if (stack == NULL || stack->size == 0){return;}LinkNode* pNext = stack->head.next;stack->head.next = pNext->next;stack->size--; }//返回棧頂元素 LinkNode* linkstack::Top_LinkStack(LinkStack* stack) {if (stack == NULL || stack->size == 0){return NULL;}return stack->head.next; }//返回棧元素的個數 int linkstack::Size_LinkStack(LinkStack* stack) {if (stack == NULL ){return -1;}return stack->size; }//清空棧 void linkstack::Clear_LinkStack(LinkStack* stack) {if (stack == NULL || stack->size == 0){return;}stack->head.next = NULL;stack->size = 0; }

main.cpp

typedef struct MYCHAR {LinkNode node;char* pAddress;int index;}MyChar;int IsLeft( char c) {return c == '('; }int IsRight(char c) {return c == ')'; }MyChar* CreateMyChar(char* p,int index) {MyChar* mychar = new MyChar;mychar->pAddress = p;mychar->index = index;return mychar; }void ShowError(char* str,int pos) {cout << str << endl;for (int i = 0; i < pos; i++){cout << " ";}cout << "A"; }int main() {char* str = "1+2+3(aaabbbbbb(cccc)";char* p = str;int index = 0;linkstack* l = new linkstack();while (*p != '\0'){//如果是左括號 直接進棧if (IsLeft(*p)){l->push_back(l->Stack, (LinkNode*)CreateMyChar(p,index));}//如果是右括號 從棧頂彈出元素 if (IsRight(*p)){if (l->Size_LinkStack(l->Stack) >0){MyChar* mychar = (MyChar*)l->Top_LinkStack(l->Stack);if (IsLeft(*mychar->pAddress)){l->pop_back(l->Stack);delete mychar;}}else{cout << "右括號沒有匹配的左括號"<<endl;ShowError(str,index);break;}}p++;index++;}while (l->Size_LinkStack(l->Stack) > 0){MyChar* mychar = (MyChar*)l->Top_LinkStack(l->Stack);cout << "左括號沒有匹配的右括號"<<endl;ShowError(str,mychar->index);l->pop_back(l->Stack);delete mychar;}delete l;return 0; }

總結

以上是生活随笔為你收集整理的栈的应用就进匹配_笔记的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。