题解 | 移除链表元素

/**
 * struct ListNode {
 *  int val;
 *  struct ListNode *next;
 *  ListNode(int x) : val(x), next(nullptr) {}
 * };
 */
class Solution {
  public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param head ListNode类
     * @param val int整型
     * @return ListNode类
     */
    ListNode* removeElements(ListNode* head, int val) {
        // write code here
        ListNode hair(0), *cur = &hair;
        hair.next = head;

        while (cur->next) {
            ListNode* tmp = cur->next;
            if (tmp->val == val) {
                cur->next = tmp->next;
                delete tmp;
            } else {
                cur = cur->next;
            }
        }

        return hair.next;
    }
};