'leetcode 476 자바' 태그의 글 목록

728x90

[LeetCode - Daily Challenge] 476. Number Complement

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem 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. Example 1: Input: num = 5 Output: 2 Explanation: The binary repr..

Algorithm/LeetCode Daily Challenge 2021. 12. 29. 10:30

728x90