ListNode *p1, *p2, *pHead1; //建立头结点 pHead1 = new ListNode; pHead1->val = 0; pHead1->next = NULL; p2 = pHead1; for (int i = 1; i<6; i++) { p1 = new ListNode; p1->val = i; p1->next = NULL; p2->next = p1; p2 = p2->next; } p1 = pHead1;
//这样建立的链表思路比较清晰，挨个地分配空间并链接起来。
原文：http://www.cnblogs.com/uestcdlcacer/p/6375647.html