Polynomial Linked List Reverse

[mike fusc]

I add to add together polynomials and got through it but the solution comes out backwards. How would I go about reversing the Nodes in the lsit

[Devaka Cooray]

Basically, you need to iterate from the last node to the first node by backtracking. To ShowSomeEffort, can you show us what have you done up to now?

[Wouter Oet]

When the output is wrong then you should try to fix the problem and not solve its symptoms. If it's not wrong then you can reverse the List with Collections.reverse().

[Rob Spoor]

And otherwise there's still ListIterator:

ListIterator<E> iterator = list.listIterator(list.size());
while (iterator.hasPrevious())
{
    E element = iterator.previous();
}

[Wouter Oet]

With the small difference that Collections.reverse actually changes your List while the ListIterator only changes your "view" on that List.

[Campbell Ritchie]

Is it possible to iterate the List, push all the elements onto a stack, then pop them and add them to a new List?

[Stephan Mueller]

Campbell Ritchie wrote:Is it possible to iterate the List, push all the elements onto a stack, then pop them and add them to a new List?

Is that a rethorical question ?
At least, it lead me to find http://download.oracle.com/javase/6/docs/api/java/util/Stack.html , which I haven't seen by now. And with JavaSE6, erm 5, it's
a generic Class! whoohooo