問題描述:
翻轉一個鏈表
樣例
給出一個鏈表1->2->3->null,這個翻轉後的鏈表爲3->2->1->null
解題思路:
新建一個鏈表,經過賦值進行交換。
代碼:
/**
* Definition of ListNode
*
* class ListNode {
* public:
* int val;
* ListNode *next;
*
* ListNode(int val) {
* this->val = val;
* this->next = NULL;
* }
* }
*/
class Solution {
public:
/**
* @param head: The first node of linked list.
* @return: The new head of reversed linked list.
*/
ListNode *reverse(ListNode *head) {
ListNode *prev = NULL;
while (head != NULL) {
ListNode *temp = head->next;
head->next = prev;
prev = head;
head = temp;
}
return prev;
// write your code here
}
};
感想:
注意交換時的順序問題。