Rotate linked list clockwise by k nodes in java

Java program for Rotate linked list clockwise by k nodes. Here more solutions.

/*
  Java program for 
  Rotate a list by moving each element 
  k times to the right.
  Or clockwise rotation of linked list 
*/
// Linked list node
class LinkNode
{
    public int data;
    public LinkNode next;
    public LinkNode(int data)
    {
        this.data = data;
        this.next = null;
    }
}
public class SingleLL
{
    public LinkNode head;
    public LinkNode tail;
    public SingleLL()
    {
        this.head = null;
        this.tail = null;
    }
    // Add new Node at end of linked list 
    public void addNode(int data)
    {
        LinkNode node = new LinkNode(data);
        if (this.head == null)
        {
            this.head = node;
        }
        else
        {
            // Append the node at last position
            this.tail.next = node;
        }
        this.tail = node;
    }
    // Display linked list element
    public void display()
    {
        if (this.head == null)
        {
            System.out.println("\n Empty linked list");
            return;
        }
        LinkNode temp = this.head;
        // iterating linked list elements
        while (temp != null)
        {
            System.out.print(" " + temp.data + " →");
            // Visit to next node
            temp = temp.next;
        }
        System.out.println(" NULL");
    }
    // This are perform the linked list rotation
    public void rotation(int k)
    {
        // Define some auxiliary variable
        LinkNode auxiliary = this.head;
        int count = 0;
        // Count number of node in linked list
        while (auxiliary != null)
        {
            // visit to next node
            auxiliary = auxiliary.next;
            count++;
        }
        if (count <= 1)
        {
            // When have less than 2 nodes in linked list
            return;
        }
        // Get actual rotation
        count = k % count;
        if (count == 0)
        {
            // When actual linked list are not affected
            return;
        }
        auxiliary = this.head;
        // Find the rotational node
        while (count > 1)
        {
            // Visit to next node
            auxiliary = auxiliary.next;
            count--;
        }
        // Connecting the last node to first node of linked list
        this.tail.next = this.head;
        // Set new last node
        this.tail = auxiliary;
        // Set new head
        this.head = auxiliary.next;
        // Set that there is no node after of tail
        this.tail.next = null;
    }
    // Handles the request to perform rotation
    // k is indicate node rotation
    public void clockwiseRotation(int k)
    {
        if (k <= 0)
        {
            // When invalid given k
            return;
        }
        if (this.head == null)
        {
            System.out.println("\n Empty Linked List");
            return;
        }
        // Display given linked list
        System.out.println(" Before rotate ");
        System.out.println(" Linked List : ");
        display();
        System.out.println(" Given k : " + k);
        // Perform rotation
        rotation(k);
        // Display resultant linked list
        System.out.println(" After rotate ");
        System.out.println(" Linked List : ");
        display();
        System.out.println("\n");
    }
    public static void main(String[] args)
    {
        SingleLL sll1 = new SingleLL();
        SingleLL sll2 = new SingleLL();
        // First linked list
        // 1 → 2 → 3 → 4 → 5 → 6 → 7 → 8 → NULL
        sll1.addNode(1);
        sll1.addNode(2);
        sll1.addNode(3);
        sll1.addNode(4);
        sll1.addNode(5);
        sll1.addNode(6);
        sll1.addNode(7);
        sll1.addNode(8);
        // Second linked list
        // 4 → 9 → 7 → 3 → 8 → 6 → -2 → NULL
        sll2.addNode(4);
        sll2.addNode(9);
        sll2.addNode(7);
        sll2.addNode(3);
        sll2.addNode(8);
        sll2.addNode(6);
        sll2.addNode(-2);
        // Test case
        sll1.clockwiseRotation(3);
        sll2.clockwiseRotation(18);
    }
}

Output

 Before rotate
 Linked List :
 1 → 2 → 3 → 4 → 5 → 6 → 7 → 8 → NULL
 Given k : 3
 After rotate
 Linked List :
 4 → 5 → 6 → 7 → 8 → 1 → 2 → 3 → NULL


 Before rotate
 Linked List :
 4 → 9 → 7 → 3 → 8 → 6 → -2 → NULL
 Given k : 18
 After rotate
 Linked List :
 8 → 6 → -2 → 4 → 9 → 7 → 3 → NULL