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 3191 with 22 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 3191 # by problem number
lcpy gen -s minimum_operations_to_make_binary_array_elements_equal_to_one_i # by problem name
nums.
You can do the following operation on the array any number of times (possibly zero):
nums equal to 1. If it is impossible, return -1.
Input: nums = [0,1,1,1,0,0]
Output: 3
Explanation:
We can do the following operations:
- Choose the elements at indices 0, 1 and 2. The resulting array is nums = [1,0,0,1,0,0].
- Choose the elements at indices 1, 2 and 3. The resulting array is nums = [1,1,1,0,0,0].
- Choose the elements at indices 3, 4 and 5. The resulting array is nums = [1,1,1,1,1,1].
Input: nums = [0,1,1,1]
Output: -1
Explanation:
It is impossible to make all elements equal to 1.
class Solution:
# Time: O(n)
# Space: O(1)
def min_operations(self, nums: list[int]) -> int:
arr = list(nums)
ops = 0
for i in range(len(arr) - 2):
if arr[i] == 0:
ops += 1
arr[i] = 1
arr[i + 1] ^= 1
arr[i + 2] ^= 1
if 0 in arr:
return -1
return ops
| Time | Space |
|---|---|
| O(n) | O(1) |