203. Remove Linked List Elements -- version 3 recursion

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

Be the first to comment

You can use [html][/html], [css][/css], [php][/php] and more to embed the code. Urls are automatically hyperlinked. Line breaks and paragraphs are automatically generated.