又一篇 链表练习

?
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
#ifndef LINK_H
#define LINK_H
 
#include <memory>
#include <iostream>
 
struct ListNode {
    int val;
    std::shared_ptr<ListNode> next;
};
 
struct LinkList{
    std::shared_ptr<ListNode> begin;
    std::shared_ptr<ListNode> end;
};
 
std::shared_ptr<ListNode>  CreateNode(int i);
bool CreateLinkList(LinkList& ll,std::shared_ptr<ListNode>& insertNode);
bool AppendNode(LinkList& ll,std::shared_ptr<ListNode>& insertNode);
void PrintLinkList(const LinkList& ll);
std::shared_ptr<ListNode> FindInLinkList(LinkList& ll,int findValue);
bool DeleteNode(LinkList& ll,int value);
 
 
#endif // LINK_H

　　

?
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include "link.h"
 
std::shared_ptr<ListNode>  CreateNode(int i){
    std::shared_ptr<ListNode> p(new ListNode());
    p->val = i;
    p->next = nullptr;
    return p;
}
 
bool CreateLinkList(LinkList& ll,std::shared_ptr<ListNode>& insertNode){
    bool ret = false;
 
    ll.begin = ll.end = insertNode;
 
    ret =true;
    return ret;
}
 
bool AppendNode(LinkList& ll,std::shared_ptr<ListNode>& appendNode){
    bool ret = false;
    if( nullptr == appendNode){
        return ret;
    }
 
    if(nullptr == ll.end || nullptr == ll.begin){
        ll.begin = ll.end = appendNode;
        ret = true;
        return ret;
    }
 
    ll.end->next = appendNode;
    ll.end = appendNode;
 
    ret = true;
    return ret;
}
 
void PrintLinkList(const LinkList& ll){
    std::shared_ptr<ListNode> p = ll.begin;
    std::cout << "print linklist:  " << std::endl;
    while( p != nullptr ){
        std::cout << p->val << " ";
        p = p->next;
    }
    std::cout << std::endl;
    std::cout << std::endl;
}
 
std::shared_ptr<ListNode> FindInLinkList(LinkList& ll,int findValue){
    std::shared_ptr<ListNode> p = ll.begin;
    do{
        if(p->val == findValue){
           break;
        }
        p= p->next;
    }while(p != nullptr);
 
    return p;
}
 
 
bool DeleteNode(LinkList& ll,int value){
    bool ret = false;
 
    if(nullptr == ll.begin || nullptr == ll.end){
        return ret;
    }
 
    if(ll.begin->val == value){
        if(ll.begin == ll.end){
            ll.begin = ll.end = nullptr;
        }else{
            ll.begin = ll.begin->next;
        }
        ret = true;
        return ret;
    }
 
    // 遍历链表 查找符合的node
    std::shared_ptr<ListNode> p = ll.begin;
    while(p->next != nullptr){
       if(p->next->val == value){
           break;
       }
       p = p->next;
    }
    if(p->next != nullptr){
        if(p->next == ll.end){
            ll.end = p;
        }
        p->next = p->next->next;
    }
 
    ret = true;
    return ret;
}

　　

?
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
// 123.cpp : 定义控制台应用程序的入口点。
//
 
#include "stdafx.h"
#include <iostream>
#include <assert.h>
#include "link.h"
 
#include <windows.h>
 
void TestLinkList() {
    LinkList ll;
 
    if (!AppendNode(ll, CreateNode(1))) {
        std::cerr << __FUNCTION__ << "().  line:" << __LINE__ << "  Error !" << std::endl;
        return;
    }
    std::cout << "begin:" << ll.begin << " begin.val:" << ll.begin->val << std::endl;
    std::cout << "end:" << ll.end << " end.val:" << ll.end->val << std::endl;
    PrintLinkList(ll);
 
    if (!AppendNode(ll, CreateNode(2))) {
        std::cerr << __FUNCTION__ << "().  line:" << __LINE__ << "  Error !" << std::endl;
        return;
    }
    std::cout << "begin:" << ll.begin << " begin.val:" << ll.begin->val << std::endl;
    std::cout << "end:" << ll.end << " end.val:" << ll.end->val << std::endl;
    PrintLinkList(ll);
 
    if (!AppendNode(ll, CreateNode(3))) {
        std::cerr << __FUNCTION__ << "().  line:" << __LINE__ << "  Error !" << std::endl;
        return;
    }
    std::cout << "begin:" << ll.begin << " begin.val:" << ll.begin->val << std::endl;
    std::cout << "end:" << ll.end << " end.val:" << ll.end->val << std::endl;
    PrintLinkList(ll);
 
    std::shared_ptr<ListNode> p = FindInLinkList(ll, 7);
    assert(p == nullptr);
 
    p = FindInLinkList(ll, 2);
    assert(p != nullptr && p->val == 2);
 
 
    DeleteNode(ll, 3);
    std::cout << "begin:" << ll.begin << " begin.val:" << ll.begin->val << std::endl;
    std::cout << "end:" << ll.end << " end.val:" << ll.end->val << std::endl;
    PrintLinkList(ll);
 
    DeleteNode(ll, 2);
    std::cout << "begin:" << ll.begin << " begin.val:" << ll.begin->val << std::endl;
    std::cout << "end:" << ll.end << " end.val:" << ll.end->val << std::endl;
    PrintLinkList(ll);
 
 
    DeleteNode(ll, 1);
    // std::cout << "begin:" << ll.begin << " begin.val:" << ll.begin->val << std::endl;
    // std::cout << "end:" << ll.end  << " end.val:" << ll.end->val  << std::endl;
    PrintLinkList(ll);
 
 
    if (!AppendNode(ll, CreateNode(1))) {
        std::cerr << __FUNCTION__ << "().  line:" << __LINE__ << "  Error !" << std::endl;
        return;
    }
    std::cout << "begin:" << ll.begin << " begin.val:" << ll.begin->val << std::endl;
    std::cout << "end:" << ll.end << " end.val:" << ll.end->val << std::endl;
    PrintLinkList(ll);
 
    if (!AppendNode(ll, CreateNode(2))) {
        std::cerr << __FUNCTION__ << "().  line:" << __LINE__ << "  Error !" << std::endl;
        return;
    }
    std::cout << "begin:" << ll.begin << " begin.val:" << ll.begin->val << std::endl;
    std::cout << "end:" << ll.end << " end.val:" << ll.end->val << std::endl;
    PrintLinkList(ll);
 
    if (!AppendNode(ll, CreateNode(3))) {
        std::cerr << __FUNCTION__ << "().  line:" << __LINE__ << "  Error !" << std::endl;
        return;
    }
    std::cout << "begin:" << ll.begin << " begin.val:" << ll.begin->val << std::endl;
    std::cout << "end:" << ll.end << " end.val:" << ll.end->val << std::endl;
    PrintLinkList(ll);
 
    DeleteNode(ll, 1);
    std::cout << "begin:" << ll.begin << " begin.val:" << ll.begin->val << std::endl;
    std::cout << "end:" << ll.end << " end.val:" << ll.end->val << std::endl;
    PrintLinkList(ll);
 
    DeleteNode(ll, 2);
    std::cout << "begin:" << ll.begin << " begin.val:" << ll.begin->val << std::endl;
    std::cout << "end:" << ll.end << " end.val:" << ll.end->val << std::endl;
    PrintLinkList(ll);
 
    DeleteNode(ll, 3);
    //std::cout << "begin:" << ll.begin << " begin.val:" << ll.begin->val << std::endl;
    //std::cout << "end:" << ll.end  << " end.val:" << ll.end->val  << std::endl;
    PrintLinkList(ll);
}
 
void TestLinkListMemory() {
    LinkList ll;
    LinkList ll0;
    while(1)
    {
        for (int i = 1; i<1000; ++i) {
            AppendNode(ll, CreateNode(i));
        }
 
     
 
        for (int i = 1; i<1000; ++i) {
            DeleteNode(ll, i);
        }
 
        std::cout << "begin:" << ll.begin << std::endl;
        std::cout << "end:" << ll.end << std::endl;
        PrintLinkList(ll);
    }
 
}
 
unsigned int dictIntHashFunction(unsigned int key)
{
    key += ~(key << 15);
    key ^= (key >> 10);
    key += (key << 3);
    key ^= (key >> 6);
    key += ~(key << 11);
    key ^= (key >> 16);
    return key;
}
 
int main(int argc, char *argv[])
{
    TestLinkList();
    TestLinkListMemory();
         
    return 0;
}

　　

posted on   itdef  阅读(176)  评论(0)  编辑  收藏  举报

编辑推荐：
· go语言实现终端里的倒计时
· 如何编写易于单元测试的代码
· 10年+ .NET Coder 心语，封装的思维：从隐藏、稳定开始理解其本质意义
· .NET Core 中如何实现缓存的预热？
· 从 HTTP 原因短语缺失研究 HTTP/2 和 HTTP/3 的设计差异
阅读排行：
· 分享一个免费、快速、无限量使用的满血 DeepSeek R1 模型，支持深度思考和联网搜索！
· 基于 Docker 搭建 FRP 内网穿透开源项目（很简单哒）
· ollama系列1：轻松3步本地部署deepseek，普通电脑可用
· 按钮权限的设计及实现
· 25岁的心里话

导航

< 2025年3月 >
日 一 二 三 四 五 六
23 24 25 26 27 28 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 1 2 3 4 5

统计

点击右上角即可分享
微信分享提示
AI IDE Trae