-
Notifications
You must be signed in to change notification settings - Fork 0
/
Day27.cpp
57 lines (46 loc) · 1018 Bytes
/
Day27.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
#include <algorithm>
#include <iostream>
#include <stdexcept>
#include <vector>
#include <cassert>
#include <set>
using namespace std;
int minimum_index(vector<int> seq) {
if (seq.empty()) {
throw invalid_argument("Cannot get the minimum value index from an empty sequence");
}
int min_idx = 0;
for (int i = 1; i < seq.size(); ++i) {
if (seq[i] < seq[min_idx]) {
min_idx = i;
}
}
return min_idx;
}
class TestDataEmptyArray {
public:
static vector<int> get_array() {
vector<int> vec {};
return vec;
}
};
class TestDataUniqueValues {
public:
static vector<int> get_array() {
vector<int> vec {1, 2, 3, 4, 5};
return vec;
}
static int get_expected_result() {
return 0;
}
};
class TestDataExactlyTwoDifferentMinimums {
public:
static vector<int> get_array() {
vector<int> vec {1, 3, 1};
return vec;
}
static int get_expected_result() {
return 0;
}
};