剑指offer-2.26-18

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    
    
    public ListNode deleteNode(ListNode head, int val) {
    
    
        ListNode HEAD = new ListNode(1);
        ListNode pre = HEAD;
        pre.next = head;
        ListNode p = head;
        while (p != null) {
    
    
            if (p.val == val) {
    
    
                pre.next = p.next;
                break;
            }
            pre = p;
            p = p.next;
        }
        return HEAD.next;
    }
}