206. 反转链表 - 力扣（LeetCode）( 点击前面链接即可查看题目)
/*** Definition for singly-linked list.* struct ListNode {* int val;* struct ListNode *next;* };*/
struct ListNode* reverseList(struct ListNode* head)
{if(head == NULL)return NULL;else{struct ListNode* oldhead = head;struct ListNode* newhead = NULL;while(oldhead){struct ListNode* nextnode = oldhead->next;oldhead->next = newhead;newhead = oldhead;//迭代oldhead = nextnode;}return newhead;}}
