9. Delete nodes in the linked list

• Input : head = [4,5,1,9], val = 5
  Output : [4,1,9]

 public ListNode deleteNode(ListNode head, int val) {

       if(head.val == val) return head.next;// Determine whether the header node should be deleted 
       
        ListNode curr = head;

       //curr.next As long as the value of is not equal to val, Just go straight down 
       while(curr.next != null && curr.next.val != val){
           curr = curr.next;
       }
        //curr.next The value is equal to the val, Delete curr.next
       if(curr.next != null) curr.next = curr.next.next;
        return head;
    }

• You can also consider using double pointers . If the code looks messy , Draw a picture , The idea soon came out .