像数组和链表一样，展开的链表也是线性数据结构，并且是链表的变体。与简单的链表不同，它在每个节点上存储多个元素。也就是说，展开的链表不是在节点上存储单个元素，而是在节点上存储元素数组。展开的链表涵盖了数组和链表的优点，因为通过在每个节点上存储多个元素，与简单链表相比，它减少了内存开销，并且还具有与链表一样快速插入和删除的优点。
_0.jpg)
好处：
- 由于缓存行为，展开链接列表中的线性搜索要快得多。
- 与普通链表相比，它需要更少的指针/引用存储空间。
- 与普通链表相比，它执行插入，删除和遍历等操作的速度更快(因为搜索速度更快)。
缺点：
- 每个节点的开销都比单链列表高。请参考以下代码中的示例节点。
简单实施
下面的程序创建一个简单的展开链表，其中包含3个节点，每个节点中包含可变数量的元素。它还遍历创建的列表。
C++
// C++ program to implement unrolled linked list
// and traversing it.
#include
using namespace std;
#define maxElements 4
// Unrolled Linked List Node
class Node
{
public:
int numElements;
int array[maxElements];
Node *next;
};
/* Function to traverse am unrolled linked list
and print all the elements*/
void printUnrolledList(Node *n)
{
while (n != NULL)
{
// Print elements in current node
for (int i=0; inumElements; i++)
cout<array[i]<<" ";
// Move to next node
n = n->next;
}
}
// Program to create an unrolled linked list
// with 3 Nodes
int main()
{
Node* head = NULL;
Node* second = NULL;
Node* third = NULL;
// allocate 3 Nodes
head = new Node();
second = new Node();
third = new Node();
// Let us put some values in second node (Number
// of values must be less than or equal to
// maxElement)
head->numElements = 3;
head->array[0] = 1;
head->array[1] = 2;
head->array[2] = 3;
// Link first Node with the second Node
head->next = second;
// Let us put some values in second node (Number
// of values must be less than or equal to
// maxElement)
second->numElements = 3;
second->array[0] = 4;
second->array[1] = 5;
second->array[2] = 6;
// Link second Node with the third Node
second->next = third;
// Let us put some values in third node (Number
// of values must be less than or equal to
// maxElement)
third->numElements = 3;
third->array[0] = 7;
third->array[1] = 8;
third->array[2] = 9;
third->next = NULL;
printUnrolledList(head);
return 0;
}
// This is code is contributed by rathbhupendra C
// C program to implement unrolled linked list
// and traversing it.
#include
#include
#define maxElements 4
// Unrolled Linked List Node
struct Node
{
int numElements;
int array[maxElements];
struct Node *next;
};
/* Function to traverse am unrolled linked list
and print all the elements*/
void printUnrolledList(struct Node *n)
{
while (n != NULL)
{
// Print elements in current node
for (int i=0; inumElements; i++)
printf("%d ", n->array[i]);
// Move to next node
n = n->next;
}
}
// Program to create an unrolled linked list
// with 3 Nodes
int main()
{
struct Node* head = NULL;
struct Node* second = NULL;
struct Node* third = NULL;
// allocate 3 Nodes
head = (struct Node*)malloc(sizeof(struct Node));
second = (struct Node*)malloc(sizeof(struct Node));
third = (struct Node*)malloc(sizeof(struct Node));
// Let us put some values in second node (Number
// of values must be less than or equal to
// maxElement)
head->numElements = 3;
head->array[0] = 1;
head->array[1] = 2;
head->array[2] = 3;
// Link first Node with the second Node
head->next = second;
// Let us put some values in second node (Number
// of values must be less than or equal to
// maxElement)
second->numElements = 3;
second->array[0] = 4;
second->array[1] = 5;
second->array[2] = 6;
// Link second Node with the third Node
second->next = third;
// Let us put some values in third node (Number
// of values must be less than or equal to
// maxElement)
third->numElements = 3;
third->array[0] = 7;
third->array[1] = 8;
third->array[2] = 9;
third->next = NULL;
printUnrolledList(head);
return 0;
} Java
// Java program to implement unrolled
// linked list and traversing it.
import java.util.*;
class GFG{
static final int maxElements = 4;
// Unrolled Linked List Node
static class Node
{
int numElements;
int []array = new int[maxElements];
Node next;
};
// Function to traverse am unrolled
// linked list and print all the elements
static void printUnrolledList(Node n)
{
while (n != null)
{
// Print elements in current node
for(int i = 0; i < n.numElements; i++)
System.out.print(n.array[i] + " ");
// Move to next node
n = n.next;
}
}
// Program to create an unrolled linked list
// with 3 Nodes
public static void main(String[] args)
{
Node head = null;
Node second = null;
Node third = null;
// Allocate 3 Nodes
head = new Node();
second = new Node();
third = new Node();
// Let us put some values in second
// node (Number of values must be
// less than or equal to maxElement)
head.numElements = 3;
head.array[0] = 1;
head.array[1] = 2;
head.array[2] = 3;
// Link first Node with the
// second Node
head.next = second;
// Let us put some values in
// second node (Number of values
// must be less than or equal to
// maxElement)
second.numElements = 3;
second.array[0] = 4;
second.array[1] = 5;
second.array[2] = 6;
// Link second Node with the third Node
second.next = third;
// Let us put some values in third
// node (Number of values must be
// less than or equal to maxElement)
third.numElements = 3;
third.array[0] = 7;
third.array[1] = 8;
third.array[2] = 9;
third.next = null;
printUnrolledList(head);
}
}
// This code is contributed by amal kumar choubeyPython3
# Python3 program to implement unrolled
# linked list and traversing it.
maxElements = 4
# Unrolled Linked List Node
class Node:
def __init__(self):
self.numElements = 0
self.array = [0 for i in range(maxElements)]
self.next = None
# Function to traverse am unrolled linked list
# and print all the elements
def printUnrolledList(n):
while (n != None):
# Print elements in current node
for i in range(n.numElements):
print(n.array[i], end = ' ')
# Move to next node
n = n.next
# Driver Code
if __name__=='__main__':
head = None
second = None
third = None
# Allocate 3 Nodes
head = Node()
second = Node()
third = Node()
# Let us put some values in second
# node (Number of values must be
# less than or equal to
# maxElement)
head.numElements = 3
head.array[0] = 1
head.array[1] = 2
head.array[2] = 3
# Link first Node with the second Node
head.next = second
# Let us put some values in second node
# (Number of values must be less than
# or equal to maxElement)
second.numElements = 3
second.array[0] = 4
second.array[1] = 5
second.array[2] = 6
# Link second Node with the third Node
second.next = third
# Let us put some values in third node
# (Number of values must be less than
# or equal to maxElement)
third.numElements = 3
third.array[0] = 7
third.array[1] = 8
third.array[2] = 9
third.next = None
printUnrolledList(head)
# This code is contributed by rutvik_56C#
// C# program to implement unrolled
// linked list and traversing it.
using System;
class GFG{
static readonly int maxElements = 4;
// Unrolled Linked List Node
class Node
{
public int numElements;
public int []array = new int[maxElements];
public Node next;
};
// Function to traverse am unrolled
// linked list and print all the elements
static void printUnrolledList(Node n)
{
while (n != null)
{
// Print elements in current node
for(int i = 0; i < n.numElements; i++)
Console.Write(n.array[i] + " ");
// Move to next node
n = n.next;
}
}
// Program to create an unrolled linked list
// with 3 Nodes
public static void Main(String[] args)
{
Node head = null;
Node second = null;
Node third = null;
// Allocate 3 Nodes
head = new Node();
second = new Node();
third = new Node();
// Let us put some values in second
// node (Number of values must be
// less than or equal to maxElement)
head.numElements = 3;
head.array[0] = 1;
head.array[1] = 2;
head.array[2] = 3;
// Link first Node with the
// second Node
head.next = second;
// Let us put some values in
// second node (Number of values
// must be less than or equal to
// maxElement)
second.numElements = 3;
second.array[0] = 4;
second.array[1] = 5;
second.array[2] = 6;
// Link second Node with the third Node
second.next = third;
// Let us put some values in third
// node (Number of values must be
// less than or equal to maxElement)
third.numElements = 3;
third.array[0] = 7;
third.array[1] = 8;
third.array[2] = 9;
third.next = null;
printUnrolledList(head);
}
}
// This code is contributed by Rajput-Ji输出：
1 2 3 4 5 6 7 8 9在本文中，我们介绍了展开列表及其优点。我们还展示了如何遍历列表。在下一篇文章中，我们将详细讨论maxElements / numElements的插入，删除和值。
插入展开的链接列表