2020-08-07：给定单向链表的头指针和一个要删除的节点的值，返回删除后的链表的头节点。

[福大大架构师每日一题]

2020-08-07：给定单向链表的头指针和一个要删除的节点的值，返回删除后的链表的头节点。

[YangjulongTrue]

   @Test
    public void Testnode1(){
        Node node = new Node(new Node(new Node(5),4),3);
        Node merge = Merge(node, 3);
        while (merge!=null){
            System.out.println(merge.data);
            merge=merge.next;
        }
    }
    public static   Node Merge(Node head1 , int var) {
        if(head1.data==var)
            return head1.next;
        Node node1=new Node(),parent;
        parent=head1;
        node1.next=parent;
        head1=head1.next;
        while(head1!=null){
            if(head1.data==var){
                parent.next=head1.next;
                return node1.next;
            }
            parent=parent.next;
            head1=head1.next;
        }
        return null;
    }

class Node{
    int data;
    Node next;
    public Node(){}
    public Node(int id){this.data=id;}
    public Node(Node n,int id){this.next=n;this.data=id;}
}