反转链表（单链表）C++实现

struct ListNode{
	int val;
	ListNode* next;
}

class Solution{
public:
	ListNode* reverseList(ListNode* head){
		if(head==NULL){
			return NULL;
		}
		ListNode* left=NULL;
		ListNode* right=head;
		
		while(right!=NULL){
			ListNode* temp=NULL;
			temp=right->next;
			right->next=left;
			left=right;
			right=temp;
		}
		return left;
	}
};