List Delete N Nodes After M Nodes

18 Jun 2019

/* Function to print linked list */
void printList( Node head) 
{ 
	Node temp = head; 
	while (temp != null) 
	{ 
		System.out.printf("%d ", temp.data); 
		temp = temp.next; 
	} 
	System.out.printf("\n"); 
} 

// Function to skip M nodes and then 
// delete N nodes of the linked list. 
void skipMdeleteN( Node head, int M, int N) 
{ 
	Node curr = head, t; 
	int count; 

	// The main loop that traverses 
	// through the whole list 
	while (curr!=null) 
	{ 
		// Skip M nodes 
		for (count = 1; count < M && curr != null; count++) 
			curr = curr.next; 

		// If we reached end of list, then return 
		if (curr == null) 
			return; 

		// Start from next node and delete N nodes 
		t = curr.next; 
		for (count = 1; count <= N && t != null; count++) 
		{ 
			Node temp = t; 
			t = t.next; 
		} 
		
		// Link the previous list with remaining nodes 
		curr.next = t; 

		// Set current pointer for next iteration 
		curr = t; 
	} 
}