Package g3301_3400.s3370_smallest_number_with_all_set_bits

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3370 - Smallest Number With All Set Bits.

    Easy

    You are given a positive number n.

    Return the smallest number x greater than or equal to n, such that the binary representation of x contains only set bits.

    A set bit refers to a bit in the binary representation of a number that has a value of 1.

    Example 1:

    Input: n = 5

    Output: 7

    Explanation:

    The binary representation of 7 is "111".

    Example 2:

    Input: n = 10

    Output: 15

    Explanation:

    The binary representation of 15 is "1111".

    Example 3:

    Input: n = 3

    Output: 3

    Explanation:

    The binary representation of 3 is "11".

    Constraints:

    • 1 <= n <= 1000

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer smallestNumber(Integer n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait