C++结构体反转链表

反转链表

struct ListNode {
    int val;
    struct ListNode *next;
    ListNode(int x) :
            val(x), next(NULL) {
    }
};


ListNode *reverseList(ListNode *head)
{
	if (head->next == NULL || head->next->next == NULL)
	{
		return head;   /*链表为空或只有一个元素则直接返回*/
	}

	ListNode *t = NULL;
	ListNode *p = head->next;
	ListNode *q = head->next->next;
	while (q != NULL)
	{
		t = q->next;
		q->next = p;
		p = q;
		q = t;
	}

	/*此时q指向原始链表最后一个元素，也是逆转后的链表的表头元素*/
	head->next->next = NULL;  /*设置链表尾*/
	head->next = p;           /*调整链表头*/
	return head;
}

ListNode *fill(ListNode *head)
{	
	ListNode *p, *q;
	p = head;
	for (int i = 0; i < 10; i++) 
	{
		q = (ListNode*)malloc(sizeof(ListNode));
		q->val = i + 1;
		q->next = NULL;
		p->next = q;
		p = q;
	}
	return head;
}

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

void testList() 
{
	//初始化链表头节点
	ListNode* head;
	head = (ListNode*)malloc(sizeof(ListNode));
	head->next = NULL;
	head->val = -1;
	ListNode *linklist = fill(head);
	print(head);
	reverseList(head);
	print(head);
}