Leetcode 1474 : Delete N Nodes After M Nodes of a Linked List

Solution to Delete N Nodes After M Nodes of a Linked List problem.

class Solution {
    public ListNode deleteNodes(ListNode head, int m, int n) {
        ListNode pre = null;
        ListNode cur = head;
        
        while(cur != null) {
            int i = m, j = n;
            
            while(cur != null && i > 0) {
                pre = cur;
                cur = cur.next;
                i--;
            }
            
            while(cur != null && j > 0) {
                cur = cur.next;
                j--;
            }
            
            pre.next = cur;
        }
        
        return head;
    }
}