用于在排序和旋转的链表中计数旋转的 Javascript 程序

给定一个由 n 个节点组成的链表，该链表首先排序，然后旋转 k 个元素。求 k 的值。

这个想法是遍历单链表来检查当前节点值是否大于下一个节点的值。如果给定条件为真，则中断循环。否则增加计数器变量并通过node->next增加节点。下面是这种方法的实现。

Javascript

  
// Program for count number of rotations in
// sorted linked list.
  
/* Linked list node */
class Node
{
    constructor()
    {
        this.data=0;
        this.next=null;
    }
}    
  
// Function that count number of
// rotation in singly linked list.
function countRotation(head)
{
    // declare count variable and assign it 1.
    let count = 0;
   
    // declare a min variable and assign to
    // data of head node.
    let min = head.data;
   
    // check that while head not equal to null.
    while (head != null) {
   
        // if min value is greater then head.data
        // then it breaks the while loop and
        // return the value of count.
        if (min > head.data)
            break;
   
        count++;
   
        // head assign the next value of head.
        head = head.next;
    }
    return count;
}
  
// Function to push element in linked list.
function push(head,data)
{
    // Allocate dynamic memory for newNode.
    let newNode = new Node();
   
    // Assign the data into newNode.
    newNode.data = data;
   
    // newNode.next assign the address of
    // head node.
    newNode.next = (head);
   
    // newNode become the headNode.
    (head) = newNode;
    return head;
}
  
// Display linked list.
function printList(node)
{
    while (node != null) {
        document.write(node.data+" ");
        node = node.next;
    }
}
  
// Driver functions
// Create a node and initialize with null
let head = null;
  
// push() insert node in linked list.
// 15.18.5.8.11.12
head = push(head, 12);
head = push(head, 11);
head = push(head, 8);
head = push(head, 5);
head = push(head, 18);
head = push(head, 15);
  
printList(head);
document.write("<br>");
document.write("Linked list rotated elements: ");
  
// Function call countRotation()
document.write(countRotation(head) +"<br>");
  
  
// This code is contributed by unknown2108
  

输出

15 18 5 8 11 12 
Linked list rotated elements: 2

有关详细信息，请参阅有关排序和旋转链表中的计数旋转的完整文章！