面试金典--3.3

#include <iostream>
#include <queue>
#include <climits>
#include <algorithm>
#include <memory.h>
#include <stdio.h>
#include <ostream>
#include <vector>
#include <list>
#include <cmath>
#include <string>
#include <stdexcept>
#include <stack>
using namespace std;

template<typename T>
class SetOfStacks
{
    vector<stack<T> > stacks;
    int stackSize;
public:
    SetOfStacks(int paramStackSize):stackSize(paramStackSize)
    {

    }
    void push(const T&elem)
    {
        if(stacks.size() == 0)
        {
            stack<T> tmp;
            tmp.push(elem);
            stacks.push_back(tmp);
            return;
        }
        if(stacks[stacks.size()-1].size() == stackSize)
        {
            stack<T> tmp;
            tmp.push(elem);
            stacks.push_back(tmp);
        }
        else
        {
            stacks[stacks.size()-1].push(elem);
        }
    }
    T pop()
    {
        if(stacks.size() == 0)
            throw std::out_of_range("stacks is empty");
        T val = stacks[stacks.size()-1].top();
        stacks[stacks.size()-1].pop();
        if(stacks[stacks.size()-1].size() = 0)
            stacks.pop_back();
        return val;
    }
};

int main()
{
    SetOfStacks<int> s(1);
    s.push(1);
    s.push(2);

    return 0;
}