-
Notifications
You must be signed in to change notification settings - Fork 0
/
linked-list.cpp
122 lines (103 loc) · 2.58 KB
/
linked-list.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
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
#include<bits/stdc++.h>
using namespace std;
//começando
class Node{
public:
int data;
Node* next;
Node(int value){
data = value;
next = NULL;
}
};
void insertAtNth(Node** current, int pos, int data){
while(pos--){
if(pos == 0){
Node *temp = new Node(data);
temp->next = *current;
*current = temp;
}
else{
current = &(*current)->next;
}
}
return;
}
void Print(Node* head){
Node* temp = head;
printf("\nLista atual: [");
while(temp != NULL){
if(temp->next == NULL) printf("%d", temp->data);
else printf("%d, ", temp->data);
temp = temp->next;
}
printf("]\n");
}
void insertAtTheBeginning(int x, Node** head){
Node* temp = new Node(x);
temp->next = *head;
*head = temp;
}
void insertAtTheEnd(int x, Node** head){
Node* temp = new Node(x);
temp->next = NULL;
if(*head == NULL)
{
*head = temp;
return;
}
Node* temp1 = *head;
while (temp1->next != NULL)
{
temp1 = temp1->next;
}
temp1->next = temp;
return;
}
void deleteN(Node **head, int key){
Node* temp = *head;
Node* prev = NULL;
if(temp != NULL && temp->data == key){
*head = temp->next;
delete temp;
return;
}
else{
while (temp != NULL && temp->data != key)
{
prev = temp;
temp = temp->next;
}
if(temp == NULL){
cout << "Element not present in the list" << endl;
return;
}
prev->next = temp->next;
delete temp;
}
}
int main(){
Node* head = NULL;
int N;
cout << "Insert the number of elements: ";
cin >> N;
for(int i=0; i<N; i++){
int x;
cout << "Insert the element: ";
cin >> x;
cout << endl << "Where to put the new element?" << endl << "(1) Insert at the beginning of the list" << endl << "(2) Insert at the end of the list" << endl << "(3) Insert at nth position of the list" << endl << "(4) Delete the last element inserted" << endl;
int choice;
cout << "Do your choice: ";
cin >> choice;
if(choice == 1) insertAtTheBeginning(x, &head);
else if(choice == 2) insertAtTheEnd(x, &head);
else if(choice == 3){
int pos;
cout << "\nWhat position do you wanna insert the new element? ";
cin >> pos;
insertAtNth(&head, pos, x);
}
else if (choice == 4) deleteN(&head, x);
Print(head);
}
}