【LeetCode】206.反轉鏈表

題目

206 反轉鏈表

代碼

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
	ListNode* reverseList(ListNode* head) {//不需要加引用
		ListNode* prev = NULL;//前驅結點
		ListNode* curr = head;//當前結點
		while (curr!=NULL)
		{
			ListNode* nextTemp = curr->next;//保存當前結點的下一節點
			curr->next = prev;//當前結點的下一節點指向其前驅結點
			prev = curr;//修改前驅結點爲當前結點
			curr = nextTemp;//修改當前結點爲nextTemp
		}
		return prev;//返回頭結點
	}
};