顺序栈的实现(SqStack, C++版)[2]

            (item<10 ? '0' : ('a'-10));
        i++;       
    }
    destnum[i] = '\0';
    return destnum;
}

#endif /* !__sqstack_h__ */

////////////////////////////////////////////////////////////////////
// stacktest.cpp
#include <iomanip.h>
#include "stack.h"

void main()
{
    stack<char *>   s1(10), s2(10);
    char    *weekday[] = {
        "mon", "tue", "wed", "thr", "fri", "sat", "sun" };
    for (register int i = 0; i < 7; i++)
        s1.push(weekday[i]);
    cout << "==========s1==========" << endl;
    for (i = 0; i < 7; i++) {
        cout << setw(5) << s1.peek();
        s2.push(s1.pop());
    }
    cout << endl;
    cout << "==========s2==========" << endl;
    for (i = 0; i < 7; i++)
        cout << setw(5) << s2.pop();
    cout << endl;

    char    s[80];
    cout << decimalconversion(1024, 2, s) << endl;