-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathquestions.cpp
72 lines (66 loc) · 1.48 KB
/
questions.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
#include<iostream>
#include"linked_list.h"
#include"linked_list.cpp"
using namespace std;
void bubble_sort(LinkedList<int> &ll);
void remove_duplicates(LinkedList<int> &ll);
int sum(LinkedList<int> &ll);
void delete_odd(LinkedList<int> &ll);
int main()
{
int arr[]{6, 2, 8, 1, 2, 1, 2, 2};
LinkedList<int> ll{8, arr};
cout << ll << endl;
bubble_sort(ll);
cout << ll << endl;
remove_duplicates(ll);
cout << ll << endl;
cout << "sum: " << sum(ll) << endl << endl;
delete_odd(ll);
cout << ll << endl;
return 0;
}
void bubble_sort(LinkedList<int>& ll){
if(ll.size() == 0){
return;
}
for (int i = 0; i < ll.size(); i++){
for (int j = i+1; j < ll.size(); j++){
if(ll[j] < ll[i]){
int temp = ll[i];
ll[i] = ll[j];
ll[j] = temp;
}
}
}
}
void remove_duplicates(LinkedList<int> &ll){
if(ll.size() == 0){
return;
}
int i = 0;
while(i < ll.size()-1){
if(ll[i+1] == ll[i]){
ll.remove(i + 1);
}else{
i++;
}
}
}
int sum(LinkedList<int> &ll){
int sum = 0;
for (int i = 0; i < ll.size(); i++){
sum += ll[i];
}
return sum;
}
void delete_odd(LinkedList<int> &ll){
int i = 0;
while(i < ll.size()){
if(ll[i]%2 != 0){
ll.remove(i);
}else{
i++;
}
}
}