2022.06.27_ One question per day

Title Description

Given the head pointer of one-way linked list and the value of a node to be deleted , Define a function to delete the node .

Return the head node of the deleted linked list .

Be careful ： This question is different from the original one

Example 1:

Input : head = [4,5,1,9], val = 5
Output : [4,1,9]
explain : Given that the value of your list is 5 Second node of , So after calling your function , The list should be 4 -> 1 -> 9.

Example 2:

Input : head = [4,5,1,9], val = 1
Output : [4,5,9]
explain : Given that the value of your list is 1
The third node of , So after calling your function , The list should be 4 -> 5 -> 9.

explain ：

 Ensure that the values of nodes in the list are different from each other 
 If you use  C  or  C++  Language , You don't need to  free  or  delete  Deleted node 

Code

package com.nuo.Y_22_M_06;

/** * @description: TODO  The finger of the sword  Offer 18.  Delete the node of the linked list  * @author nuo * @date 2022/6/27 20:12 * @version 1.0 */
public class Demo01 {
    
    public ListNode deleteNode(ListNode head, int val) {
    
        if (head.val == val) {
    
            return head.next;
        }
        ListNode temp = head;
        while (temp.next.val != val) {
    
            temp= temp.next;
        }
        temp.next = temp.next.next;
        return head;
    }

	@Test
    public void test(String[] args) {
    
        ListNode node = new ListNode(1);
        node.next = new ListNode(2);
        node.next.next = new ListNode(3);
        node.next.next.next = new ListNode(4);
        node.next.next.next.next = new ListNode(5);
        node.next.next.next.next.next = new ListNode(6);
        ListNode listNode = new Demo01().deleteNode(node, 5);
        listNode.show();
    }
}

class ListNode {
    
    int val;
    ListNode next;

    ListNode(int x) {
    
        val = x;
    }

    public void show() {
    
        System.out.print(this.val);
        if (this.next != null) {
    
            System.out.print("->");
            this.next.show();
        }
    }
}