剑指OFFER----面试题18. 删除链表的节点

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */

 class Solution {
public:
    ListNode* deleteNode(ListNode* head, int val) {
        if (head->val == val) return head->next;
        ListNode* ret = head;
        while (ret->next->val != val) ret = ret->next;
        ret->next = ret->next->next;
        return head;
    }
};