24. 链表就地逆置

单链表就地逆置

HANDWRITING:

struct Node {
	int value;
	Node *next;
};
Node *reverse (Node *head) {
	Node *pre = 0, *cur = head, next = head->next;
	while (next != 0) {
		cur->next = pre;
		pre = cur;
		cur = next;
		next = next->next;
	}
	return cur;
}

ANSWER
Reversing a linked list. Already done.

额。。http://my.csdn.net/v_JULY_v这里有