-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
73 lines (59 loc) · 1.08 KB
/
Copy pathmain.cpp
File metadata and controls
73 lines (59 loc) · 1.08 KB
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
// 找到链表的倒数第k个节点
#include <iostream>
struct ListNode
{
int m_value;
ListNode *m_next;
};
ListNode *CreateNode(int *arr, int len)
{
ListNode *root = new ListNode;
root->m_next = nullptr;
ListNode *tmpNode = root;
for (int i = 0; i < len; ++i)
{
ListNode *newNode = new ListNode;
newNode->m_value = arr[i];
newNode->m_next = nullptr;
tmpNode->m_next = newNode;
tmpNode = newNode;
}
return root;
}
void DeleteAllNode(ListNode *&root)
{
while (root)
{
ListNode *nextNode = root;
root = root->m_next;
delete nextNode;
}
}
ListNode *FindNodeFromEnd(ListNode *root, int n)
{
if (!root && !n)
return nullptr;
ListNode *tmpNode = root;
for (int i = 0; i < n - 1; ++i)
{
if (tmpNode->m_next)
tmpNode = tmpNode->m_next;
else
return nullptr;
}
ListNode *behindNode = root;
while (tmpNode->m_next)
{
tmpNode = tmpNode->m_next;
behindNode = behindNode->m_next;
}
return behindNode;
}
int main()
{
int arr[] = { 1, 2, 3, 4, 5 };
ListNode *root = CreateNode(arr, 5);
ListNode *find = FindNodeFromEnd(root, 3);
DeleteAllNode(root);
return 0;
}