Need help: Linked List, reverse List

[BlackSnowZ]

I'm trying to write a reverse linked list code
The input, output is all ok.
Something is wrong in this code but it seem logical to me so can someone point the errors in here.
void reverseList( TheList *&head)
{// Pb : Point back, Pre : Previous num
TheList *Cur, *Pb, *Pre;
Cur = head ->nextNum;
Pb = head;
Pre = head;
while ( Pb != NULL)
{
Pb = Cur;
Cur = Cur->nextNum;
Pb->nextNum = Pre;
if ( Pb == NULL)
{
head->nextNum=NULL;
head = Pre;
}
Pre = Pb;
}
Output(head);
}
Thanks ^^, sr for my bad english

[Jaybob66]

right here...
if ( Pb = NULL)

should be...
if ( Pb == NULL)

[BlackSnowZ]

wow , i'm so stupid ....

[BlackSnowZ]

still i did some fixing, it isnt reverse...

[Jaybob66]

the only other thing that stands out to me is this...

Pb->nextNum = Pre;
if ( Pb == NULL)

obviously Pb can never be null, the previous line would crash.

[BlackSnowZ]

at the top of the line
Pb = Cur;
so when Cur = NULL => Pb =>NULL
the if statment there is for when the point reach the end of the list it will move the head point to the end after reverse

[Jaybob66]

but if that happens
Pb->nextNum = Pre;
will crash because Pb is null

also, please use code tags around code snippets. Just highlight the code and click <> icon on the right.

[BlackSnowZ]

I got it working so thank you so much
This is my code after

void reverseList( TheList *&head)
{// Pb : Point back, Pre : Previous num
	TheList *Cur, *Pb, *Pre;
	Cur = head ->nextNum;
	Pb = head;	
	Pre = head;
	while ( Cur != NULL)
	{
		Pb = Cur;
		Cur = Cur->nextNum;
		Pb->nextNum = Pre;
		Pre = Pb;
	}
	head->nextNum = NULL;
	head = Pb;
	Output(head);
}