程序员面试精选题 程序员面试题精选算法题加答案.docVIP

程序员面试精选100题 程序员面试题精选算法58题加答案 导读：就爱阅读网友为您分享以下“程序员面试题精选算法58题加答案”的资讯，希望对您有所帮助，感谢您对92的支持! const int *pNextPush = pPush; const int *pNextPop = pPop; // ancillary stack std::stacklt;intgt;stackData; // check every integers in pPop while(pNextPop - pPop lt; nLength) { // while the top of the ancillary stack is not the integer // to be poped, try to push some integers into the stack while(stackData.empty() || stackData.top() != *pNextPop) { // pNextPush == NULL means all integers have been // pushed into the stack, can#39;t push any longer if(!pNextPush) break; stackData.push(*pNextPush); // if there are integers left in pPush, move // pNextPush forward, otherwise set it to be NULL if(pNextPush - pPush lt; nLength - 1) pNextPush ++;