-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathday14.cpp
67 lines (51 loc) · 1.53 KB
/
day14.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
/*
* Tutorial: 30 Days of Code.
* A solution to "Day 14: Scope"
* Submitted by A. S. "Aleksey" Ahmann <[email protected]>
* Submitted on Feb. 27, 2024
* Link: https://www.hackerrank.com/challenges/30-scope/problem
*
* Task description: Complete the Difference class by writing the following:
* * A class constructor that takes an array of integers as a parameter and saves it to the __elements instance variable.
* * A computeDifference method that finds the maximum absolute difference between any 2 numbers in __elements and stores it in the maximumDifference instance variable.
*/
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
class Difference {
private:
vector<int> elements;
public:
int maximumDifference;
// Add your code here
Difference (vector<int> elements) {
this->elements = elements;
}
void computeDifference() {
maximumDifference = 0;
for (int j : elements) {
for (int k : elements) {
int absDiff = abs(j - k);
if (absDiff > maximumDifference)
maximumDifference = absDiff;
}
}
}
}; // End of Difference class
int main() {
int N;
cin >> N;
vector<int> a;
for (int i = 0; i < N; i++) {
int e;
cin >> e;
a.push_back(e);
}
Difference d(a);
d.computeDifference();
cout << d.maximumDifference;
return 0;
}