Leetcode 1822. Sign of the Product of an Array
There is a function `signFunc(x)` that returns: • `1` if `x` is positive. • `-1` if `x` is negative. • `0` if `x` is equal to `0`. You are given an integer array `nums`. Let `product` be the product of all values in the array `nums`. Return `signFunc(product)`.
Description
There is a function signFunc(x)
that returns:
1
ifx
is positive.-1
ifx
is negative.0
ifx
is equal to0
.
You are given an integer array nums
. Let product
be the product of all values in the array nums
.
Return signFunc(product)
.
Example 1:
Input: nums = [-1,-2,-3,-4,3,2,1] Output: 1
- The product of all values in the array is 144, and signFunc(144) = 1
Example 2:
Input: nums = [1,5,0,2,-3] Output: 0
- The product of all values in the array is 0, and signFunc(0) = 0
Example 3:
Input: nums = [-1,1,-1,1,-1] Output: -1
- The product of all values in the array is -1, and signFunc(-1) = -1
Constraints:
1 <= nums.length <= 1000
-100 <= nums[i] <= 100
Solution
1
2
3
4
5
6
7
8
9
10
11
class Solution:
# Iteration
# Time Complexity: BigO(N)
# Space Complexity: BigO(1)
def arraySign(self, nums: List[int]) -> int:
prod = 1
for i in range(len(nums)):
if nums[i] == 0:
return 0
prod *= nums[i]
return 1 if prod > 0 else -1
1
2
3
4
5
6
7
8
9
10
11
12
13
/**
* Iteration
* Time Complexity: BigO(N)
* Space Complexity: BigO(1)
*/
function arraySign(nums: number[]): number {
let total = 1;
for (let num of nums) {
if (num == 0) return 0;
total *= num;
}
return total > 0 ? 1 : -1;
}
This post is licensed under CC BY 4.0 by the author.