LeetCode反转链表
给出单链表的首节点 head(注意head不是头指针),反转链表,并返回反转后的链表/** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ struct ListNode* reverseList(struct ListNode* head){ struct ListNode* newHead = (struct ListNode*)malloc(sizeof(struct ListNode)); newHead->next = NULL; struct ListNode* tempNode = (struct ListNode*)malloc(sizeof(struct ListNode)); tempNode = head;//首节点,非头节点(head不是头指针) while (tempNode) { struct ListNode* node = (struct ListNode*)malloc(sizeof(struct ListNode)); node->val = tempNode->val; node->next = newHead->next; newHead->next = node; tempNode = tempNode->next; } return newHead->next; }