📅  最后修改于: 2020-10-15 04:48:55             🧑  作者: Mango
在此程序中,我们将创建一个单链接列表,并在列表的开头添加一个新节点。为了完成此任务,我们将头存储到临时节点temp。将新添加的节点作为列表的新标题。然后,在新头后面添加temp(旧头)。
考虑上面的清单;节点1代表原始列表的头。令node New为需要在列表开头添加的新节点。节点温度将指向头,即1。将New设为列表的新头,并在新头之后添加temp,以使New旁边的节点为1。
#Represent a node of the singly linked list
class Node:
def __init__(self,data):
self.data = data;
self.next = None;
class InsertStart:
#Represent the head and tail of the singly linked list
def __init__(self):
self.head = None;
self.tail = None;
#addAtStart() will add a new node to the beginning of the list
def addAtStart(self, data):
#Create a new node
newNode = Node(data);
#Checks if the list is empty
if(self.head == None):
#If list is empty, both head and tail will point to new node
self.head = newNode;
self.tail = newNode;
else:
#Node temp will point to head
temp = self.head;
#newNode will become new head of the list
self.head = newNode;
#Node temp(previous head) will be added after new head
self.head.next = temp;
#display() will display all the nodes present in the list
def display(self):
#Node current will point to head
current = self.head;
if(self.head == None):
print("List is empty");
return;
print("Adding nodes to the start of the list: ");
while(current != None):
#Prints each node by incrementing pointer
print(current.data ),
current = current.next;
sList = InsertStart();
#Adding 1 to the list
sList.addAtStart(1);
sList.display();
#Adding 2 to the list
sList.addAtStart(2);
sList.display();
#Adding 3 to the list
sList.addAtStart(3);
sList.display();
#Adding 4 to the list
sList.addAtStart(4);
sList.display();
输出:
Adding nodes to the start of the list:
1
Adding nodes to the start of the list:
2 1
Adding nodes to the start of the list:
3 2 1
Adding nodes to the start of the list:
4 3 2 1
#include
//Represent a node of the singly linked list
struct node{
int data;
struct node *next;
};
//Represent the head and tail of the singly linked list
struct node *head, *tail = NULL;
//addAtStart() will add a new node to the beginning of the list
void addAtStart(int data) {
//Create a new node
struct node *newNode = (struct node*)malloc(sizeof(struct node));
newNode->data = data;
newNode->next = NULL;
//Checks if the list is empty
if(head == NULL) {
//If list is empty, both head and tail will point to new node
head = newNode;
tail = newNode;
}
else {
//Node temp will point to head
struct node *temp = head;
//newNode will become new head of the list
head = newNode;
//Node temp(previous head) will be added after new head
head->next = temp;
}
}
//display() will display all the nodes present in the list
void display() {
//Node current will point to head
struct node *current = head;
if(head == NULL) {
printf("List is empty\n");
return;
}
printf("Adding nodes to the start of the list: \n");
while(current != NULL) {
//Prints each node by incrementing pointer
printf("%d ", current->data);
current = current->next;
}
printf("\n");
}
int main()
{
//Adding 1 to the list
addAtStart(1);
display();
//Adding 2 to the list
addAtStart(2);
display();
//Adding 3 to the list
addAtStart(3);
display();
//Adding 4 to the list
addAtStart(4);
display();
return 0;
}
输出:
Adding nodes to the start of the list:
1
Adding nodes to the start of the list:
2 1
Adding nodes to the start of the list:
3 2 1
Adding nodes to the start of the list:
4 3 2 1
public class InsertStart {
//Represent a node of the singly linked list
class Node{
int data;
Node next;
public Node(int data) {
this.data = data;
this.next = null;
}
}
//Represent the head and tail of the singly linked list
public Node head = null;
public Node tail = null;
//addAtStart() will add a new node to the beginning of the list
public void addAtStart(int data) {
//Create a new node
Node newNode = new Node(data);
//Checks if the list is empty
if(head == null) {
//If list is empty, both head and tail will point to new node
head = newNode;
tail = newNode;
}
else {
//Node temp will point to head
Node temp = head;
//newNode will become new head of the list
head = newNode;
//Node temp(previous head) will be added after new head
head.next = temp;
}
}
//display() will display all the nodes present in the list
public void display() {
//Node current will point to head
Node current = head;
if(head == null) {
System.out.println("List is empty");
return;
}
System.out.println("Adding nodes to the start of the list: ");
while(current != null) {
//Prints each node by incrementing pointer
System.out.print(current.data + " ");
current = current.next;
}
System.out.println();
}
public static void main(String[] args) {
InsertStart sList = new InsertStart();
//Adding 1 to the list
sList.addAtStart(1);
sList.display();
//Adding 2 to the list
sList.addAtStart(2);
sList.display();
//Adding 3 to the list
sList.addAtStart(3);
sList.display();
//Adding 4 to the list
sList.addAtStart(4);
sList.display();
}
}
输出:
Adding nodes to the start of the list:
1
Adding nodes to the start of the list:
2 1
Adding nodes to the start of the list:
3 2 1
Adding nodes to the start of the list:
4 3 2 1
using System;
public class CreateList
{
//Represent a node of the singly linked list
public class Node{
public T data;
public Node next;
public Node(T value) {
data = value;
next = null;
}
}
public class InsertStart{
//Represent the head and tail of the singly linked list
public Node head = null;
public Node tail = null;
//addAtStart() will add a new node to the beginning of the list
public void addAtStart(T data) {
//Create a new node
Node newNode = new Node(data);
//Checks if the list is empty
if(head == null) {
//If list is empty, both head and tail will point to new node
head = newNode;
tail = newNode;
}
else {
//Node temp will point to head
Node temp = head;
//newNode will become new head of the list
head = newNode;
//Node temp(previous head) will be added after new head
head.next = temp;
}
}
//display() will display all the nodes present in the list
public void display() {
//Node current will point to head
Node current = head;
if(head == null) {
Console.WriteLine("List is empty");
return;
}
Console.WriteLine("Adding nodes to the start of the list: ");
while(current != null) {
//Prints each node by incrementing pointer
Console.Write(current.data + " ");
current = current.next;
}
Console.WriteLine();
}
}
public static void Main()
{
InsertStart sList = new InsertStart();
//Adding 1 to the list
sList.addAtStart(1);
sList.display();
//Adding 2 to the list
sList.addAtStart(2);
sList.display();
//Adding 3 to the list
sList.addAtStart(3);
sList.display();
//Adding 4 to the list
sList.addAtStart(4);
sList.display();
}
}
输出:
Adding nodes to the start of the list:
1
Adding nodes to the start of the list:
2 1
Adding nodes to the start of the list:
3 2 1
Adding nodes to the start of the list:
4 3 2 1
data = $data;
$this->next = NULL;
}
}
class InsertStart{
//Represent the head and tail of the singly linked list
public $head;
public $tail;
function __construct(){
$this->head = NULL;
$this->tail = NULL;
}
//addAtStart() will add a new node to the beginning of the list
function addAtStart($data) {
//Create a new node
$newNode = new Node($data);
//Checks if the list is empty
if($this->head == null) {
//If list is empty, both head and tail will point to new node
$this->head = $newNode;
$this->tail = $newNode;
}
else {
//Node temp will point to head
$temp = $this->head;
//newNode will become new head of the list
$this->head = $newNode;
//Node temp(previous head) will be added after new head
$this->head->next = $temp;
}
}
//display() will display all the nodes present in the list
function display() {
//Node current will point to head
$current = $this->head;
if($this->head == NULL) {
print("List is empty
");
return;
}
print("Adding nodes to the start of the list:
");
while($current != NULL) {
//Prints each node by incrementing pointer
print($current->data . " ");
$current = $current->next;
}
print("
");
}
}
$sList = new InsertStart();
//Adding 1 to the list
$sList->addAtStart(1);
$sList->display();
//Adding 2 to the list
$sList->addAtStart(2);
$sList->display();
//Adding 3 to the list
$sList->addAtStart(3);
$sList->display();
//Adding 4 to the list
$sList->addAtStart(4);
$sList->display();
?>
输出:
Adding nodes to the start of the list:
1
Adding nodes to the start of the list:
2 1
Adding nodes to the start of the list:
3 2 1
Adding nodes to the start of the list:
4 3 2 1