[leetcode] 203. 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

解法一：

思想还是引入一个dummy node，并设为当前current node，然后看next node的值。如果值相等，cur->next = next，不然更新cur。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */<pre name="code" class="cpp">/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        if (!head) return head;
        ListNode* node = removeElements(head->next, val);
        if (head->val == val) return node;
        else{
            head->next = node;
            return head;
        }
    }
};

class Solution {public: ListNode* removeElements(ListNode* head, int val) { if (!head) return head; //if (!head->next && head->val==val) return NULL; ListNode* dummy = new ListNode(-1); dummy->next = head; ListNode* cur = dummy; while(cur&&cur->next){ ListNode* next = cur->next; if (next->val == val){ cur->next = next->next; } else cur = cur->next; } return dummy->next; }};

解法二：

recursive的解法。就是假设head->next已经做好了，返回了值为next。如果当前head的值为val，直接返回next，否则将head指向next。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        if (!head) return head;
        ListNode* next = removeElements(head->next, val);
        if (head->val == val) return next;
        else{
            head->next = next;
            return head;
        }
    }
};