用于打印链表的反转而不实际反转的 Javascript 程序

原文:https://www . geeksforgeeks . org/JavaScript-打印程序-反向链接列表-不实际反向/

给定一个链表，使用递归函数打印它的逆序。例如，如果给定的链表是 1->2->3->4，那么输出应该是 4->3->2->1。 注意，问题只是关于打印反面。要反转列表本身请看本T3难度等级:菜鸟

算法:

printReverse(head)
  1\. call print reverse for head->next
  2\. print head->data

实施:

java 描述语言

<script>
// Javascript program to print reverse
// of a linked list

// Head of list
var head;

// Linked list Node
class Node
{
    constructor(val)
    {
        this.data = val;
        this.next = null;
    }
}

// Function to print reverse of
// linked list
function printReverse(head)
{
    if (head == null)
        return;

    // Print list of head node
    printReverse(head.next);

    // After everything else is printed
    document.write(head.data + " ");
}

// Utility Functions

// Inserts a new Node at front of the list.
function push(new_data)
{
    /* 1 & 2: Allocate the Node &
              Put in the data */
    new_node = new Node(new_data);

    // 3\. Make next of new Node as head */
    new_node.next = head;

    // 4\. Move the head to point to new Node */
    head = new_node;
}

// Driver code
// Create linked list 1->2->3->4
push(4);
push(3);
push(2);
push(1);

printReverse(head);
// This code is contributed by Rajput-Ji
</script>

输出:

4 3 2 1

时间复杂度: O(n)

更多详情请参考打印链表的反转而不实际反转的完整文章！

---

版权属于：月萌API www.moonapi.com，转载请注明出处

本文链接：https://moonapi.com/news/35931.html