標(biāo)準(zhǔn)模板庫實(shí)現(xiàn)
學(xué)了標(biāo)準(zhǔn)模板庫，就該用標(biāo)準(zhǔn)模板庫解決問題
#include<iostream>
#include<string>
#include<stack>
using namespace std;
char judge(char c)
? ? {
? ? char cneed;
? ? switch(c)
? ? {
? ? ? ? case '{':cneed='}';break;
? ? ? ? case '[':cneed=']';break;
? ? ? ? case '(':cneed=')';break;
? ? }
? ? return cneed;
}
int main()
{
? ? stack<char> s;
? ? string brackets;
? ? cin>>brackets;
? ? for(int i=0;i<brackets.size();i++)
? ? {
? ? ? ? if(s.empty())
? ? ? ? {
? ? ? ? ? ? s.push(brackets[i]);
? ? ? ? ? ? continue;
? ? ? ? }
? ? ? ? judge(s.top())==brackets[i]?s.pop():s.push(brackets[i]);
? ? }
? ? s.empty()? cout<<"匹配":cout<<"不匹配";
? ? return 0;
}
還有更好的寫法嗎？
2020-03-18
//?myself?void?bracketMatch1(const?char*?str)?{ MyStack<char>*?pMatch?=?new?MyStack<char>(30); char?currentNeed?=?0; for?(int?i?=?0;?i?<?strlen(str);?i++)?{ if?(str[i]?==?currentNeed)?{ if?(pMatch->pop(currentNeed)?==?0)?currentNeed?=?0;? //?1.?通過pMatch更新當(dāng)前待匹配括號(hào) //?2.?pMatch為空時(shí)，需給當(dāng)前待匹配括號(hào)置零 } else?{ if?(currentNeed?!=?0)?pMatch->push(currentNeed); currentNeed?=?str[i]?==?'('???')'?:?(str[i]?==?'['???']'?:?'k'); } } pMatch->stackEmpty()&¤tNeed==0???cout?<<?"Yes"?<<?endl?:?cout?<<?"No"?<<?endl; delete?pMatch; pMatch?=?nullptr;}2019-11-05
非常好，再加上空格等非括號(hào)判斷就完美了
2018-12-20
#include?<iostream>#include?<stdlib.h>#include?"stack.h"#include?"coordinate.h"using?namespace?std;//函數(shù)聲明bool?BrackerMatch(char?*str);//主函數(shù)int?main(){ /* 棧應(yīng)用--括號(hào)匹配 描述：任意輸入一組括號(hào)，判斷括號(hào)是否匹配 */ char?str[]=?"([]})"; if?(BrackerMatch(str))?{ cout?<<?"括號(hào)成功匹配"?<<?endl; } else { cout?<<?"括號(hào)不匹配"?<<?endl; } system("pause"); return?0;}bool?BrackerMatch(char?*str)?{ MyStack<char>?*p?=?new?MyStack<char>(30); char?e?=?0; for?(int?i?=?0;?i?<?strlen(str);?i++) { switch(str[i])?{ case?'(': p->push(str[i]); p->stackTraverse(false); break; case?'[':?p->push(str[i]);?break; case?'{':?p->push(str[i]);?break; case?')': if?(p->getTopElement()!='(') { cout?<<?p->getTopElement()?<<?endl; return?false; } else { p->pop(e); break; } case?']': if?(p->getTopElement()?!=?'[') { return?false; } else { p->pop(e); break; } case?'}': if?(p->getTopElement()?!=?'}') { return?false; } else { p->pop(e); break; } default: break; } } return?p->stackEmpty();}