-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathday10.cpp
92 lines (71 loc) · 2.09 KB
/
day10.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
/*
* Tutorial: 30 Days of Code.
* A solution to "Day 10: Binary Numbers"
* Submitted by A. S. "Aleksey" Ahmann <[email protected]>
* Submitted on Feb. 29, 2024
* Link: https://www.hackerrank.com/challenges/30-binary-numbers/problem
*
* Task description: Given a base-10 integer, n, convert it to binary (base-2). Then find and print the base-10 integer denoting the maximum number of consecutive 1's in n's binary representation. When working with different bases, it is common to show the base as a subscript.
*/
#include <bits/stdc++.h>
using namespace std;
list<int> DecimalToBinary(int n);
int MaximalConsecutive(list<int> result);
string ltrim(const string &);
string rtrim(const string &);
int main()
{
string n_temp;
getline(cin, n_temp);
int n = stoi(ltrim(rtrim(n_temp)));
list<int> binaryRepresentation = DecimalToBinary(n);
int maxConsecutive = MaximalConsecutive(binaryRepresentation);
cout << maxConsecutive << endl;
return 0;
}
list<int> DecimalToBinary(int n) {
list<int> result;
int i = 0;
while (n > 0) {
result.push_back(n % 2);
n /= 2;
i++;
}
return result;
}
int MaximalConsecutive(list<int> result) {
int max_count, curr_count;
max_count = 0;
curr_count = 0;
for (auto bit : result) {
if (bit == 0)
curr_count = 0;
else {
curr_count++;
max_count = max(max_count, curr_count);
}
}
return max_count;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end()
);
return s;
}
/*
* Endnotes:
* 1. I referenced the following resources when making this solution:
* 1a. https://www.geeksforgeeks.org/maximum-consecutive-ones-or-zeros-in-a-binary-array/
* 1b. https://www.geeksforgeeks.org/list-cpp-stl/
*/