单链表反转

struct Node
{
	int val;
	Node *next;
	Node(int val_in):val(val_in), next(NULL)
	{	
	}
	Node(int val_in, Node *next_in):val(val_in), next(next_in)
	{
	}
};

Node* reverse(Node *head)
{
	Node* ret = NULL;
	while(NULL != head)
	{
		Node* temp = head->next;
		head->next = ret;
		ret = head;
		head = temp;
	}
	return ret;
}

void printList(Node* head)
{
	while(NULL != head)
	{
		cout << head->val << " ";
		head = head->next;
	}
	cout << endl;
}

Node* buildList()
{
	Node* ret = NULL;
	for(int i = 9; i >= 0; --i)
		ret = new Node(i, ret);
	return ret;
}
int main()
{
	Node* list = buildList();
	printList(list);
	Node *reversed = reverse(list);
	printList(reversed);
	return 1;
}