C语言实现打印链表:
```c
#include <stdio.h>
#include <stdlib.h>
typedef struct node {
int data;
struct node *next;
} Node;
void printList(Node *head) {
Node *current = head;
while (current != NULL) {
printf("%d ", current->data);
current = current->next;
}
printf("\n");
}
int main() {
Node *head = NULL;
Node *second = NULL;
Node *third = NULL;
head = (Node*)malloc(sizeof(Node));
second = (Node*)malloc(sizeof(Node));
third = (Node*)malloc(sizeof(Node));
head->data = 1;
head->next = second;
second->data = 2;
second->next = third;
third->data = 3;
third->next = NULL;
printList(head);
return 0;
}
```
C++实现打印链表:
```c++
#include <iostream>
using namespace std;
struct Node {
int data;
Node *next;
};
void printList(Node *head) {
Node *current = head;
while (current != NULL) {
cout << current->data << " ";
current = current->next;
}
cout << endl;
}
int main() {
Node *head = NULL;
Node *second = NULL;
Node *third = NULL;
head = new Node();
second = new Node();
third = new Node();
head->data = 1;
head->next = second;
second->data = 2;
second->next = third;
third->data = 3;
third->next = NULL;
printList(head);
return 0;
}
```
Java实现打印链表:
```java
class Node {
int data;
Node next;
Node(int data) {
this.data = data;
this.next = null;
}
}
class Main {
static void printList(Node head) {
Node current = head;
while (current != null) {
System.out.print(current.data + " ");
current = current.next;
}
System.out.println();
}
public static void main(String[] args) {
Node head = new Node(1);
Node second = new Node(2);
Node third = new Node(3);
head.next = second;
second.next = third;
printList(head);
}
}
```
Python实现打印链表:
```python
class Node:
def __init__(self, data):
self.data = data
self.next = None
def printList(head):
current = head
while current != None:
print(current.data, end=' ')
current = current.next
print()
head = Node(1)
second = Node(2)
third = Node(3)
head.next = second
second.next = third
printList(head)
```
如何打印链表
于 2021-12-23 20:35:06 首次发布