Question d’entretien chez Palantir Technologies

Use a stack to implement a queue.

Réponses aux questions d'entretien

Utilisateur anonyme

10 sept. 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; }

Utilisateur anonyme

3 janv. 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.