JAVA_LeetCode 3370_mallest Number With All Set Bits

JAVA_LeetCode 3370_mallest Number With All Set Bits 풀이 class Solution { public int smallestNumber(int n) { // 2진수이되, n보다 크고, 이진표현이 모두 1인경우 int res = 1; while(res < n + 1) res <<= 1; return res - 1; } } * 출처 https://leetcode.com/problems/smallest-number-with-all-set-bits...