将编号为0和1的两个栈存放于一个数组空间V[m]中，栈底分别处于数组的两端。这种双栈结构的类定义，并实现判栈空、判栈满、插入、删除算法。-Will be numbered 0 and 1 array of two stacks placed in a space V [m], the stacks were in the bottom ends of the array. This dual-stack structure of class definitions, and to achieve