Question

anyone able to help me with linkedlist?

Answer 1

why doesnt this work?
http://gyazo.com/8b1938c77649f36c910eabb8387bfee0

Answer 2

this is the struct
http://gyazo.com/dc16aa2d5c15e51ab05f04f679d381d9

Answer 3

I will help u

Answer 4

Where is the question

Answer 5

reversing a linkedlist

Answer 6

You can reverse it in place, you don't need to make a copy.

Answer 7

lol

Answer 8

i dunno

Answer 9

srry

Answer 10

but i want to copy it ... then reverse it

Answer 11

Do you understand the solution I posted above?

Answer 12

And do you understand why it is not necessary to copy it.

Answer 13

You are wasting both time and space (computation time and memory).

Answer 14

well the solution above does not pass the tests...

Answer 15

Hrmm.

Answer 16

Can you post the code you have right now?

Answer 17

http://gyazo.com/836d2b49fdbf9bce2db148a1e46af33d
http://gyazo.com/c3d08e2f3f342942401adbc4d70da350

Answer 18

this is what it does http://gyazo.com/d886cd04788c417c5220cbaf847e6e6c

Answer 19

Link prev = NULL;
Link next = NULL;
Link curr = L->first;

while(curr) {
next = curr->next;
curr->next = prev;
prev = curr;
curr = next;
}

curr = L->first;
L->first = L->last;
L->last = curr;

Answer 20

Does that fix it?

Answer 21

can u draw me a pic what ur code is doing

Answer 22

Hrmm I think it is easier just to explain it in english.

Answer 23

If you have a bunch of nodes and arrows pointing forward from one node to the next. The idea is to reverse the direction of the arrows.

Answer 24

Lets say we have three nodes, node[i - 1], node[i] and node[i + 1] and we are dealing with node[i].

When we reach node[i] it is currently pointing to node[i + 1], in other words node[i]->next = node[i + 1]. We want it to point to node[i - 1] instead.

That's why we have curr->next = prev.

Answer 25

oh ok cool, then u start with the last entry and deal with reversed links?