-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathcode-DP.cpp
48 lines (43 loc) · 1.62 KB
/
code-DP.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
/* **************************************************************************
* Copyright 2024 The OpenGenus.org Authors. All Rights Reserved.
*
* Code for the book "DAILY 43: Algorithmic Problems for Coding Interviews: Easy level, C++ edition"
*
* Licensed under the GNU General Public License, Version 3.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.gnu.org/licenses/gpl-3.0.html
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
* For details about the book, please visit: https://www.amazon.com/dp/B0CZJNBLQS
* *************************************************************************/
#include <iostream>
#include <vector>
class Solution {
public:
std::vector<int> countBits(int n) {
std::vector<int> answer(n + 1);
answer[0] = 0;
for (int i = 1; i <= n; ++i) {
// Set_bits(N) = Set_bits(N>>1) + (1 if N is odd)
answer[i] = answer[i / 2] + i % 2;
}
return answer;
}
};
int main() {
Solution sol;
int n = 5;
std::vector<int> result = sol.countBits(n);
std::cout << "Number of set bits from 0 to " << n << " are:" << std::endl;
for (int i = 0; i <= n; ++i) {
std::cout << "Number " << i << " has " << result[i] << " set bits." << std::endl;
}
return 0;
}