Problem: Deletion in Circular Linked List

You are provided with a Circular Linked List of integers and a specific integer, referred to as 'key'.

Your task is to implement a function that locates the specified key in the list and removes it. If the key is not present in the list, then it should remain unchanged.

Input:

The first input line contains the integers present in the circular linked list in order. 
The second input line contains a single integer 'key', the key to be deleted.

Output:

The only output line contains the updated circular linked list post deletion.

Example:

Input:

1 2 3 4 5 -1
3

Output:

1 2 4 5 -1

Explanation:

The circular linked list initially consists of nodes with values 1, 2, 3, 4, 5. The key to be deleted is 3. After deletion, the list is 1, 2, 4, 5.

Constraints:

• 0 <= N <= 10^5
• 1 <= key <= 10^5
• 'N' is the length of the Circular Linked List.
• All integers in the list are unique.
• -1 marks the end of the linked list, however, the tail of the linked list would be pointing to the head, making it circular in nature.
• Time limit: 1 sec

Note:

The Circular Linked List before/after deletion may happen to be empty. In that case, only print -1.