Сообщение от
rikimaru2013
А я почему то думал, что для односвязного списка для свапа надо передавать 4 аргумента:
Родитель кого1, кого1, Родитель кого2, кого2
Да, так и есть. Вот последняя версия программы (осталось только правильно обратиться через
swap() к текущим элементам списка):
| C++ |
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
| #include "stdafx.h"
#include <iostream>
using namespace std;
struct Node
{
int data;
Node* pNext;
};
void PrintList(Node* head)
{
Node* current = head;
while (current != NULL)
{
cout << current->data << ",";
current = current->pNext;
}
}
int _tmain(int argc, _TCHAR* argv[])
{
int n;
cout << "enter # of elements: ";
cin >> n;
Node head;
head.pNext = NULL;
for (int i = 1; i <= n; i++)
{
if (i == 1)
{
head.data = i;
continue;
}
Node* last = &head;
while (last->pNext)
{
last = last->pNext;
}
Node* element = new Node();
element->data = i;
element->pNext = NULL;
last->pNext = element;
}
PrintList(&head);
int j;
cout << endl << "please index to insert a new element (1 - " << n << "): ";
cin >> j;
Node* insertAfter = &head;
int i = 1;
while (i<j)
{
insertAfter = insertAfter->pNext;
i++;
}
Node* element2 = new Node();
element2->data = 999;
element2->pNext = insertAfter->pNext;
insertAfter->pNext = element2;
n++;
PrintList(&head);
//udalenie elementov
int k;
cout << endl << "enter index of elements to delete (1 - " << n << "): ";
cin >> k;
Node* prevDelete = &head;
for (int i = 1; i < k - 1; i++)
{
prevDelete = prevDelete->pNext;
}
Node* toDelete = prevDelete->pNext;
prevDelete->pNext = prevDelete->pNext->pNext;
delete toDelete;
Node* lastDelete = &head;
for (int i = 1; i < n - 2; i++)
{
lastDelete = lastDelete->pNext;
}
Node* toDel = lastDelete->pNext;
lastDelete->pNext = toDel->pNext;
delete toDel;
n -= 2;
PrintList(&head);
//smena mestami
int z = 0;
int x = 0;
Node* smen1 = &head;
Node* smen2 = &head;
cout << " smenit element nomer" << "\t";
cin >> x;
cout << "na element nomer" << "\t";
cin >> z;
int ih = 0, jh = 0;
for (ih = 0; ih < n - 1; smen1 = smen1->pNext, ih++)
for (jh = 0; jh < n - 1; smen2 = smen2->pNext) {
if (((smen1->data) == x) && ((smen2->data) == z)) {
swap(нужно обратиться к текущим элементам списка);
}
jh++;
if (jh == n - 1)
smen2 = &head;
}
PrintList(&head);
getchar();
getchar();
return 0;
} |
|
Никак не поменять элементы списка:
| C++ |
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
| #include "stdafx.h"
#include <iostream>
using namespace std;
struct Node
{
int data;
Node* pNext;
};
void PrintList(Node* head)
{
Node* current = head;
while (current != NULL)
{
cout << current->data << ",";
current = current->pNext;
}
}
int _tmain(int argc, _TCHAR* argv[])
{
int n;
cout << "enter # of elements: ";
cin >> n;
Node head;
head.pNext = NULL;
for (int i = 1; i <= n; i++)
{
if (i == 1)
{
head.data = i;
continue;
}
Node* last = &head;
while (last->pNext)
{
last = last->pNext;
}
Node* element = new Node();
element->data = i;
element->pNext = NULL;
last->pNext = element;
}
PrintList(&head);
int j;
cout << endl << "please index to insert a new element (1 - " << n << "): ";
cin >> j;
Node* insertAfter = &head;
int i = 1;
while (i<j)
{
insertAfter = insertAfter->pNext;
i++;
}
Node* element2 = new Node();
element2->data = 999;
element2->pNext = insertAfter->pNext;
insertAfter->pNext = element2;
n++;
PrintList(&head);
//udalenie elementov
int k;
cout << endl << "enter index of elements to delete (1 - " << n << "): ";
cin >> k;
Node* prevDelete = &head;
for (int i = 1; i < k - 1; i++)
{
prevDelete = prevDelete->pNext;
}
Node* toDelete = prevDelete->pNext;
prevDelete->pNext = prevDelete->pNext->pNext;
delete toDelete;
Node* lastDelete = &head;
for (int i = 1; i < n - 2; i++)
{
lastDelete = lastDelete->pNext;
}
Node* toDel = lastDelete->pNext;
lastDelete->pNext = toDel->pNext;
delete toDel;
n -= 2;
PrintList(&head);
//smena mestami
int z = 0;
int x = 0;
Node* smen1 = &head;
Node* smen2 = &head;
cout << " smenit element nomer" << "\t";
cin >> x;
cout << "na element nomer" << "\t";
cin >> z;
int ih = 0, jh = 0;
Node* tor = 0;
for (ih = 0; ih < n - 1; smen1 = smen1->pNext, ih++)
for (jh = 0; jh < n - 1; smen2 = smen2->pNext) {
if (((smen1->data) == x) && ((smen2->data) == z)) {
tor = smen1;
smen1 = smen2;
smen2 = tor;
}
jh++;
if (jh == n - 1)
smen2 = &head;
}
PrintList(&head);
getchar();
getchar();
return 0;
} |
|
(
Сообщение от rikimaru2013
