LeetCode OJ ：Remove Linked List Elements (移除鏈表元素)

標籤：

Remove all elements from a linked list of integers that have value val.

Example
Given: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6
Return: 1 --> 2 --> 3 --> 4 --> 5

ps：這一題感覺沒什麼技巧可言，選取一個頭指標，一個當前指標，一個前向指標。簡單的鏈表操作而已，代碼如下：

 1 /** 2  * Definition for singly-linked list. 3  * struct ListNode { 4  *     int val; 5  *     ListNode *next; 6  *     ListNode(int x) : val(x), next(NULL) {} 7  * }; 8  */ 9 class Solution {10 public:11     ListNode* removeElements(ListNode* head, int val) {12         ListNode * root = head;13         ListNode * prev = head;14         ListNode * curr = head;15         while (curr != NULL){16             if (curr->val == val){17                 if (prev == curr)18                     root = prev = curr = curr->next;19                 else{20                     curr = curr->next;21                     prev->next = curr;22                 }23             }else{24                 prev = curr;25                 curr = curr->next;26             }27         }28         return root;29     }30 };

 

LeetCode OJ ：Remove Linked List Elements (移除鏈表元素)