GoLang Solution For LeetCode Problem: Number Complement
Solving Number Complement in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.
- The given integer is guaranteed to fit within the range of a 32-bit signed integer.
Input: 5 Output: 2 Explanation: The binary representation of 5 is 101 (no leading zero bits), and its complement is 010. So you need to output 2.
Input: 1 Output: 0 Explanation: The binary representation of 1 is 1 (no leading zero bits), and its complement is 0. So you need to output 0.
See the full details of the problem Number Complement at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go