LeetCode 剑指 Offer 18. 删除链表的节点

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */


struct ListNode* deleteNode(struct ListNode* head, int val){
    struct ListNode* l, *h, *prev;
    
    if (head == NULL)
        return NULL;
    if (head->val == val) {
        l = head->next;
        head->next = NULL;
        return l;
    }
    h = head;
    prev = head;
    l = head->next;
    while (l){
        if (l->val == val) {
            prev->next = l->next;
            l->next = NULL;
            break;
        }
        prev = l;
        l = l->next;
    }
    return h;
}