递归获取栈中指定位置的元素并删除,可以不破坏栈的结构
public int getElement(Stack<Integer> stack, int position)
{
int result = stack.pop();
if (stack.size() == position)
{
// stack.push(result);
return result;
}else {
int element = getElement(stack, position);
stack.push(element);
return element;
}
}