算法笔记-第七章-链表(未完成)

链表的遍历

#include<cstdio>
const int N = 100;
struct Node
{
   
    int data, next;//表示的是当前数据和下一个节点的坐标
}node[N];
int main()
{
   
    int first, id,n;//first 表示第一个节点的坐标
    scanf_s("%d%d", &n, &first);
    for (int i = 0; i < N; i++)
    {
   
        scanf_s("%d", &id);//输入节点的坐标  
        scanf_s("%d%d", &node[id].data, &node[id].next);//输入当前节点的数据和下一个节点的坐标


    }

    int current = first;//从开始定义的节点进行遍历  

    while (current != -1)  
    {
   
        printf("%d %d %d\n", current, node[current].data, node[current].next);


        current = node[current].next;  
    }

}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33

链表结点的个数

/结点的个数是以首结点开始到最后结点的个数计算的
#include <cstdio>

const int MAXN = 100;

struct Node 
{
   
    int data, next;
} nodes[MAXN];
int main() 
{
   
    int n, first, id;  
    scanf("%d%d", &n, &first);  
    for (int i = 0; i < n; i++)  
    {
   
        scanf("%d", &id);  
        scanf("%d%d", &nodes[id].data, &nodes[id].next);  
    }
    int current = first, counter = 0;  
    while (current != -1)  
    {
   
        counter++;  
        current = nodes[current].next;  
    }
    printf("%d", counter);  
    return 0;  
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

链表的头插法!

#include <cstdio>
const int MAXN = 1024;

struct Node 
{
   
    int data, next;
} nodes[MAXN]
1
2
3
4
5
6
7