private void findit(ListNode current, int n){
        if(current == null){
            count = 0;
            return;
        }
        findit(current.next,n);
        count++;
        if(count == n){
            if(current == head)
                result = head.next;
        }
        if(count == n+1){
            current.next = current.next.next;
        }
    }