-
Notifications
You must be signed in to change notification settings - Fork 0
/
Test.cpp
79 lines (66 loc) · 1.16 KB
/
Test.cpp
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
#include <iostream>
using namespace std;
struct Node
{
int data;
Node* next;
};
void push(Node** head, int val)
{
Node* new_node = new Node();
new_node->data = val;
new_node->next = *head;
*head = new_node;
}
void swap(Node** a, Node** b)
{
Node *temp = *a;
*a = *b;
*b = temp;
}
void SwapNode(Node** head, int x, int y)
{
Node** first = NULL;
Node** second = NULL;
while(*head)
{
if((*head)->data == x)
{
first = head;
}
else if((*head)->data == y)
{
second = head;
}
head = &((*head)->next);
}
if(first && second)
{
swap(*&first, *&second);
swap(&(*first)->next, &(*second)->next);
}
}
void print(Node* head)
{
while(head != NULL)
{
cout << head->data << "->";
head = head->next;
}
}
int main()
{
int arr[] = {1,2,3,4,5,6,7,8};
int n = sizeof(arr)/sizeof(arr[0]);
int x = 2;
int y = 7;
Node* head = NULL;
for(int i = 0; i < n; i++)
{
push(&head, arr[i]);
}
print(head);
SwapNode(&head, x, y);
cout << "\n";
print(head);
}