Skip to content

Create 1611. Minimum One Bit Operations to Make Integers Zero 1 #930

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Nov 8, 2025
+23 −0
Merged

Create 1611. Minimum One Bit Operations to Make Integers Zero 1 #930

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
23 changes: 23 additions & 0 deletions 1611. Minimum One Bit Operations to Make Integers Zero 1
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
class Solution {
public:
int minimumOneBitOperations(int n) {
if (n == 0) return 0;
long long fun[32];
// function[i] = x
// Means it will take x operations to make the ith bit 1
fun[0] = 1;
for (int i = 1; i <= 31; i++) {
fun[i] = 2 * fun[i - 1] + 1;
}
int res = 0;
int sign = 1;
for (int i = 30; i >= 0; i--) {
int ithBit = (n >> i) & 1;
if (ithBit == 0) continue;
if (sign > 0) res += fun[i];
else res -= fun[i];
sign *= -1;
}
return res;
}
};
Loading