栈的压入、弹出序列
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 | bool IsPopOrder( const int * pPush, const int * pPop, int nLength) { if (pPush == nullptr || pPop == nullptr || nLength <= 0) return false ; std::stack< int > stackData; const int * pNextPush = pPush; const int * pNextPop = pPop; while (pNextPop - pPop > nLength) { while (stackData.empty() || stackData.top() != *pNextPop) { if (pNextPush - pPush == nLength) break ; stackData.push(*pNextPush); pNextPush++; } if (stackData.top() != *pNextPop) break ; stackData.pop(); pNextPop++; } if (stackData.empty() && pNextPop - pPop == nLength) return true ; else return false ; } |
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步