在单向链表中的给定位置和头部之后删除节点

Question

Did I miss anything in the below code . The code is about deleting a Node from a linkedlist given its head and position. My program is not passing all the test cases .

Node Delete(Node head, int position) {

   // Node temp=head;
    int count=1;
    if(position==0){
       head=head.next;
       return head; 
    }
    if(position==1){
        head=head.next.next;
        return head;
    }
    if(position>1){
        Node temp=head;
        while(count<position){
            count++;
            temp=temp.next;
        }
        temp.next=temp.next.next;
    }
    return head;
}

Input

4

3

1 2 3

0

3

1 2 3

1

3

1 2 3

2

5

4 3 2 5 1

2

My output

23

12 4351

Expected output

23 13 12 4351

Answer 1

public static Node Delete(Node head, int position) {
           Node node = head;
           Node prevNode = null;
           int index = 0;
        if (head == null && position == 0){
             return head;
           }
         if (head != null && position == 0){
               head = null;
               head = node.next;

           }
           if (position > 0){
           while(index<position){
               prevNode = node;
               node = node.next;
               index = index + 1;
           }
           prevNode.next = node.next;
           node = null;
           }

         return head;
    }