crack the code interview 3.6

yfdyyy

于 2013-12-17 22:15:35 发布

阅读量523

点赞数

分类专栏： crack the code interview

本文链接：https://blog.csdn.net/yfdyyy/article/details/17384875

版权

crack the code interview 专栏收录该内容

26 篇文章 0 订阅

订阅专栏

Write a program to sort a stack in ascending order. You should not make any assump-
tions about how the stack is implemented. The following are the only functions that
should be used to write this program: push | pop | peek | isEmpty.

#include <iostream>
using namespace std;


Stack sort(Stack s)
{
  Stack r;
  while (!s.isEmpty())
    {
      int tmp = s.pop();
      while (!r.isEmpty() && r.peek() > tmp)
	{
	  s.push(r.pop());
	}
      r.push(tmp);
    }
}

辅助栈r中一定是倒序的，