【Leetcode203】Remove Linked List Elements

2020.3.8更新

Runtime: 20 ms, faster than 99.97% of C++ online submissions for Remove Linked List Elements.

Memory Usage: 12.7 MB, less than 5.66% of C++ online submissions for Remove Linked List Elements.

/**
 * 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 == NULL)
            return head;
        else{
            if(head->val == val){
                return removeElements(head->next, val);
            }else{
                head->next = removeElements(head->next, val);
                return head;
            }
        }
    }
};

 这是递归的做法，想法比较直接，简单的考虑，不要想这是第一个节点还是中间的节点。按说循环迭代占用的内存会少一些。