Sunday, June 3, 2012
Reverse a linked list
Node* reverseLL(Node* n) {
Node* curr = n;
Node* prev = null;
while(curr !=null) {
Node* temp = curr.next;
curr.next = prev;
prev = curr;
curr = temp;
}
return prev;
}
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment
[フレーム]