Package g3101_3200.s3133_minimum_array_end

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3133 - Minimum Array End.

    Medium

    You are given two integers n and x. You have to construct an array of positive integers nums of size n where for every 0 <= i < n - 1, nums[i + 1] is greater than nums[i], and the result of the bitwise AND operation between all elements of nums is x.

    Return the minimum possible value of nums[n - 1].

    Example 1:

    Input: n = 3, x = 4

    Output: 6

    Explanation:

    nums can be [4,5,6] and its last element is 6.

    Example 2:

    Input: n = 2, x = 7

    Output: 15

    Explanation:

    nums can be [7,15] and its last element is 15.

    Constraints:

    • <code>1 <= n, x <= 10<sup>8</sup></code>

    • 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 Long minEnd(Integer n, Integer x)

      • Methods inherited from class java.lang.Object

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