Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 3133 with 15 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 3133 # by problem number
lcpy gen -s minimum_array_end # by problem name
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].
Input: n = 3, x = 4
Output: 6
Explanation: nums can be [4, 5, 6] and its last element is 6.
Input: n = 2, x = 7
Output: 15
Explanation: nums can be [7, 15] and its last element is 15.
1 <= n, x <= 10^8class Solution:
# Time: O(1) # bounded by 64 iterations
# Space: O(1)
def min_end(self, n: int, x: int) -> int:
result = x
increment = n - 1
inc_bit = 0
for bit in range(64):
if (x >> bit) & 1 == 0:
if (increment >> inc_bit) & 1:
result |= 1 << bit
inc_bit += 1
return result
| Time | Space |
|---|---|
| O(1) # bounded by 64 iterations | O(1) |