leetcode

Leetcode Solutions (0x6A73)
git clone https://git.pngu.org/leetcode
Log | Files | Refs | Submodules | README

commit 77f46021e62b1d16803e746db4a39d22d17700e2
parent 716c5f21d28b5fb06efd5cd637ae14056d1eead8
Author: Jack Sangdahl <jack@pngu.org>
Date:   Wed, 21 Aug 2024 18:52:54 -0600

476. number complement

Diffstat:
Anumber_complement.c | 16++++++++++++++++
Anumber_complement.py | 26++++++++++++++++++++++++++
2 files changed, 42 insertions(+), 0 deletions(-)

diff --git a/number_complement.c b/number_complement.c @@ -0,0 +1,16 @@ +// 476. Number Complement +#include "leetcode.h" + +/* + * the complement of an integer is the integer you get when you flip all the 0's + * to 1's and all the 1's to 0's in its binary representation. for example, the + * integer 5 is "101" in binary and its complement is "010", which is the + * integer 2. given an integer 'num', return its complement + */ + +int findComplement(int num) { return (uint)~0 >> __builtin_clz(num) ^ num; } + +int main() { + printf("%d\n", findComplement(5)); // expect: 2 + printf("%d\n", findComplement(1)); // expect: 0 +} diff --git a/number_complement.py b/number_complement.py @@ -0,0 +1,26 @@ +# 476. Number Complement + +""" +the complement of an integer is the integer you get when you flip all the 0's +to 1's and all the 1's to 0's in its binary representation. for example, the +integer 5 is "101" in binary and its complement is "010", which is the +integer 2. given an integer 'num', return its complement +""" + + +class Solution(object): + def findComplement(self, num): + """ + :type num: int + :rtype: int + """ + i = 1 + while i <= num: + i = i << 1 + return (i - 1) ^ num + + +if __name__ == "__main__": + obj = Solution() + print(obj.findComplement(5)) + print(obj.findComplement(1))