我们如何编写一个函数List multiPop（int k）来从堆栈中弹出k个元素，或者直到堆栈为空？

Question

I am trying to write a method that pops k elements from the stack. Any help would be appreciated.

This is what I have tried: 
    public void multipop(int k) { 
    List l = nil(); 
    while (true) {
    for(int i =0; i < k; i++) { 
    }

Answer 1

Translate the following concept in to Java:

create a list to store the popped members in.
while (the stack is not empty and we have to pop more elements) {
    add a popped member from the stack to the list
}
return the list.

Done

Answer 2

list multipop(int k, list stack){

   int increment = 0;
   while(stack.next() != null && k < increment){ 
      stack.pop();
      increment++;
   }
}
return stack;

I'm sorting assuming you have the methods .next() and .pop() already created.