栈的应用--递归消除(正整数输出)

//
//  Stack.h
//  链接栈
//
//  Created by geshenglu on 2020/3/21.
//  Copyright © 2020 geshenglu. All rights reserved.
//

#ifndef Stack_h
#define Stack_h
template<class Elemtype>
class Stack
{
public:
    virtual bool IsEmpty() const =0;
    virtual void Push(const Elemtype&x)=0;
    virtual Elemtype Pop()=0;
    virtual Elemtype Top()const =0;
    virtual ~Stack(){};
};
#endif /* Stack_h */

//
//  LinkStack.h
//  链接栈
//
//  Created by geshenglu on 2020/3/21.
//  Copyright © 2020 geshenglu. All rights reserved.
//

#ifndef LinkStack_h
#define LinkStack_h
#include "Stack.h"
template<class Elemtype>
class LinkStack:public Stack<Elemtype>{
private:
    struct Node{
        Elemtype data;
        Node *next;
        Node(const Elemtype &x,Node *n = nullptr){
            data = x;
            next = n;
        }
        Node(){
            next = nullptr;
        }
        ~Node(){}
    };
    Node *elem;
public:
    LinkStack(){
        elem = nullptr;
    }
    ~LinkStack();
    virtual bool IsEmpty() const override;
    virtual void Push(const Elemtype&x)override;
    virtual Elemtype Pop()override;
    virtual Elemtype Top()const override;
};
template<class Elemtype>
LinkStack<Elemtype>::~LinkStack(){
    
    while(elem!=nullptr){
        Node *tmp = elem;
        elem = elem->next;
        delete tmp;
    }
}

template<class Elemtype>
bool LinkStack<Elemtype>::IsEmpty() const{
    return elem == nullptr;
}

template<class Elemtype>
void LinkStack<Elemtype>::Push(const Elemtype&x){
    Node *tmp = new Node(x,elem);
    elem = tmp;
}

template<class Elemtype>
Elemtype LinkStack<Elemtype>::Pop(){
    Node *tmp = elem;
    Elemtype x = tmp->data;
    elem = tmp->next;
    delete tmp;
    return x;
}

template<class Elemtype>
Elemtype LinkStack<Elemtype>::Top()const{
    return elem->data;
}
#endif /* LinkStack_h */

//
//  main.cpp
//  打印正整数程序
//
//  Created by geshenglu on 2020/3/23.
//  Copyright © 2020 geshenglu. All rights reserved.
//

#include <iostream>
#include "LinkStack.h"
#include <stack>
//栈模拟 正整数输出
void PrintNum(int num){
    LinkStack<int> stack;
    stack.Push(num);
    while (!stack.IsEmpty()) {
        int tmp = stack.Top();
        if (tmp>9) {
            stack.Pop();
            stack.Push(tmp%10);
            stack.Push(tmp/10);
        }
        else
            std::cout<<stack.Pop()<<std::endl;
    }
}

//递归模拟 正整数输出
void printInt(int num){
    if(num==0)
        return;
    printiInt(num/10);
    std::cout<<num%10;
}

int main(int argc, const char * argv[]) {
    // insert code here...
    PrintNum(1234);
    printInt(1234);
    return 0;
}