Data structure for java

Sup /prog/, I need to an indexed data structure that supports these methods:


void addLast(S stuff);     // insertion's like a queue
void removeLast();         // removes last link
void removeIfHas(S stuff); // removes link if has target stuff
S getStuff(int index);     // retrieves stuff given the index

I can do this with a (Doubly/Double) Linked List, but the search/retrieval is O(n). Is a HashTable a better structure?

Thanks

>>10

OP here, and I don't know. This is for an algorithms class. The teacher asked for a generic playlist-kind of structure that did what I typed. I assumed that using LinkedList would be a trap, since they are always bitching about O(n).