Leetcode 1822. Sign of the Product of an Array

文章作者：Tyan
博客：noahsnail.com  |  CSDN  |  简书

1. Description

2. Solution

**解析：**Version 1，碰到0直接返回0，计数负数的个数，如果负数个数时奇数返回-1，偶数返回1。

• Version 1

class Solution:def arraySign(self, nums: List[int]) -> int:count = 0for num in nums:if num == 0:return 0elif num < 0:count += 1if count % 2 == 0:return 1else:return -1

• Version 2

class Solution:def arraySign(self, nums: List[int]) -> int:result = 1for num in nums:if num == 0:return 0elif num < 0:result *= -1return result

Reference

1. https://leetcode.com/problems/sign-of-the-product-of-an-array/