使用java实现顺序表和链表实现0到9的算法实例
时间: 2024-09-14 10:14:35 浏览: 19
在Java中,可以分别使用顺序表(数组)和链表数据结构实现从0到9的算法实例。这里我会提供简单的示例。
### 1. 顺序表(数组实现)
```java
public class SequentialList {
private int[] list = new int[10]; // 初始化一个长度为10的顺序表
public void printNumbers() {
for (int i = 0; i < 10; i++) {
list[i] = i; // 将数字0到9逐个填充到数组中
System.out.print(list[i] + " "); // 打印每个元素
}
System.out.println();
}
}
SequentialList sequentialList = new SequentialList();
sequentialList.printNumbers(); // 输出:0 1 2 3 4 5 6 7 8 9
```
### 2. 链表实现
```java
public class LinkedList {
class Node {
int data;
Node next;
Node(int data) {
this.data = data;
}
}
private Node head;
public void printNumbers() {
Node current = head;
while (current != null) {
current.data = current.data; // 虽然实际上不需要赋值,这是为了展示节点
System.out.print(current.data + " -> ");
current = current.next;
}
System.out.println("null"); // 结尾添加null表示链表结束
}
public void initialize() {
head = new Node(0);
for (int i = 1; i <= 9; i++) {
Node newNode = new Node(i);
newNode.next = head.next;
head.next = newNode;
}
}
public static void main(String[] args) {
LinkedList linkedList = new LinkedList();
linkedList.initialize();
linkedList.printNumbers(); // 输出:0 -> 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9 ->
}
}
```