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 3151 with 22 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 3151 # by problem number
lcpy gen -s special_array_i # by problem name
nums. Return true if nums is a special array, otherwise, return false.
Input: nums = [1]
Output: true
Explanation: There is only one element. So the answer is true.
Input: nums = [2,1,4]
Output: true
Explanation: There are two pairs: (2,1) and (1,4), and both contain numbers with different parity.
Input: nums = [4,3,1,6]
Output: false
Explanation: nums[1] and nums[2] are both odd. So the answer is false.
1 <= nums.length <= 1001 <= nums[i] <= 100from itertools import pairwise
class Solution:
# Time: O(n)
# Space: O(1)
def is_array_special(self, nums: list[int]) -> bool:
return all(x % 2 != y % 2 for x, y in pairwise(nums))
| Time | Space |
|---|---|
| O(n) | O(1) |