Pregunta de entrevista de Palantir Technologies

Use a stack to implement a queue.

Respuestas de entrevistas

Anónimo

10 de sept de 2012

/* Omitted Enqueue and other set up */ public E dequeue(Stacks) { if(s.size()==1) return s.pop() E tmp = s.pop(); E rez = popElem(s); s.push(tmp); return rez; }

Anónimo

3 de ene de 2015

The Roman's answer is almost good, if you remove the second copyElements call from dequeue then you get amortized O(1) time for both operations.