单向链表

17 Mar 2025 | 4 分钟阅读

创建和显示单向链表的程序。

C 语言程序

#include<stdio.h>
#include<stdlib.h>
struct Node {
int data;
struct Node *next;
};
void display(struct Node *n)
{
while (n != NULL)
  {
printf(" %d \n", n->data);
     n = n->next;
  }
}
int main()
{
struct Node* head = NULL;
struct Node* second = NULL;
struct Node* third = NULL;
  // allocate 3 nodes in the heap  
head = (struct Node*)malloc(sizeof(struct Node)); 
second = (struct Node*)malloc(sizeof(struct Node));
third = (struct Node*)malloc(sizeof(struct Node));
head->data = 100; //assign data in first node
head->next = second; // Link first node with the second node
  // assign data to second node 
second->data = 200; 
  // Link second node with the third node
second->next = third;
third->data = 300; //assign data to third node
third->next = NULL;
display(head);
return 0;
}

输出

100 
 200 
 300

Java 程序

public class LinkedList
{
    Node head;  // head of list
static class Node {
int data;
        Node next;
Node(int d)  { data = d;  next=null; }
    }

    /* This function prints contents of the linked list starting from head */
public void display()
    {
        Node n = head;
while (n != null)
        {
System.out.print(n.data+" \n");
            n = n.next;
        }
    }

    /* method to create a simple linked list with 3 nodes*/
public static void main(String[] args)
    {
        /* Start with the empty list. */
LinkedList list = new LinkedList();

list.head       = new Node(100);
        Node second      = new Node(200);
        Node third       = new Node(300);

list.head.next = second; // Link first node with the second node
second.next = third; // Link first node with the second node

list.display();
    }
}

输出

100 
 200 
 300

Python 程序

# Node class
class Node:

    # Function to initialise the node object
    def __init__(self, data):
        self.data = data  # Assign data
        self.next = None  # Initialize next as null

# Linked List class contains a Node object
class LinkedList:

    # Function to initialize head
    def __init__(self):
        self.head = None

    # This function prints contents of linked list
    # starting from head
    def display(self):
        temp = self.head
        while (temp):
            print temp.data,
            temp = temp.next

# Code execution starts here
if __name__=='__main__':

    # Start with the empty list
    list = LinkedList()

    list.head  = Node(100)
    second = Node(200)
    third  = Node(300)

    list.head.next = second; # Link first node with second
    second.next = third; # Link second node with the third node

    list.display()

输出

100 
 200 
 300

PHP 程序

<?php
class Node
{
public $data;
public $next;

public function __construct($item)
    {
        $this->data = $item;
        $this->next = null;
    }
}

class LinkList
{
public $head = null;
public $second=null;
public $third=null;

private static $count = 0;
public function Insert() {
            $this->head = new Node(100);
           $this->second=new Node(200);
           $this->third=new Node(300);

            $this->head->next=$this->second;
            $this->second->next=$this->third;

        }


public function PrintAsList()
    {
        $items = [];
        $current = $this->head;
while($current != null) {
array_push($items, $current->data);
            $current = $current->next;
        }

        $str = '';
foreach($items as $item)
        {
            $str .= $item . ' ';
        }

echo $str;

echo PHP_EOL;
    }
}

$ll = new LinkList();

$ll->Insert();
$ll->PrintAsList();
echo PHP_EOL;
?>

输出

100 
 200 
 300

说明

链表是一种数据结构，其中信息以节点的形式存储，节点包含数据和下一个节点的地址。在链表中，节点代表单个元素。

节点的图示表示：

以编程方式表示节点：

struct Node
{
int data;
struct Node *next;
};

Java

class Node
    {  int data;
        Node next;          
        // Constructor to create a new node
        // Next is by default initialized as null
        Node(int d) {data = d;}
    }

Python

classNode:
  
    # Function to initialize the node object
    def__init__(self, data):
        self.data =data  # Assign data
        self.next=None  # Initialize 
                          # next as null

PHP

class Node
{  public $data;
    public $next;
    public function __construct($item)    {
        $this->data = $item;
        $this->next = null;    }
}

通过使用上述语法在每种语言中创建节点。链表是通过创建每个节点对象，为节点的数据部分赋予一些值，并通过next指针链接到下一个节点来创建的。

使用节点创建链表的步骤：

1. 首先，我们将创建一个节点对象并进行初始化。每个对象代表单个节点。

struct Node* head = NULL;
struct Node* second = NULL;
  head = (struct Node*)malloc(sizeof(struct Node)); 
  second = (struct Node*)malloc(sizeof(struct Node));
  third = (struct Node*)malloc(sizeof(struct Node));

Java

Node second      = new Node(200);
        Node third       = new Node(300);

Python

second = Node(200)
    third  = Node(300)

PHP

public $head = null;
    public $second=null;
    public $third=null;
$this->head = new Node(100);
           $this->second=new Node(200);
           $this->third=new Node(300);

2. 最后，将节点链接在一起。如果没有要链接的下一个节点，节点类的Next变量将初始化为null；

head->data = 100; //assign data in first node
  head->next = second; // Link first node with the second node

Java

list.head.next = second; // Link first node with the second node
second.next = third; // Link first node with the second node

Python

list.head.next = second; # Link first node with second
second.next = third; # Link second node with the third node

PHP

$this->head->next=$this->second;
            $this->second->next=$this->third;

下一个主题程序列表

单向链表

C 语言程序

Java 程序

Python 程序

PHP 程序

说明

使用节点创建链表的步骤：

联系信息

关注我们

教程

面试题

在线编译器

Python

Java

.Net Framework

AI, ML and Data Science

Cloud Technology

B.Tech and MCA

Web Technology

PHP

Software Testing

Technical Interview

Java Interview

Python

Web Interview

Database Interview

B.Tech / MCA

Important Interview

Software Testing Interview

Company Interviews

Online Compilers

Multiple Choice Questions

程序

单向链表

C 语言程序

Java 程序

Python 程序

PHP 程序

说明

使用节点创建链表的步骤：

相关帖子

编写查找长方体（Rectangular Prism）面积的程序

查找半圆面积和周长的程序

从循环链表中删除重复元素的程序

将毫米转换为英尺的程序

查找二叉树最大宽度的程序

编写查找三棱柱（Triangular Prism）表面积的程序

查找二叉树所有节点之和的程序

将英尺转换为米的程序

不使用第三个变量交换两个数字的程序

从单向链表中删除重复元素的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器