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 1822 with 20 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1822 # by problem number
lcpy gen -s sign_of_the_product_of_an_array # by problem name
signFunc(x) that returns:
1 if x is positive.-1 if x is negative.0 if x is equal to 0.nums. Let product be the product of all values in the array nums.
Return signFunc(product).
Input: nums = [-1,-2,-3,-4,3,2,1]
Output: 1
Input: nums = [1,5,0,2,-3]
Output: 0
Input: nums = [-1,1,-1,1,-1]
Output: -1
class Solution:
# Time: O(n)
# Space: O(1)
def array_sign(self, nums: list[int]) -> int:
sign = 1
for num in nums:
if num == 0:
return 0
if num < 0:
sign = -sign
return sign
| Time | Space |
|---|---|
| O(n) | O(1) |