[Leetcode] 1822. Sign of the Product of an Array

🗓️ Daily LeetCoding Challenge May, Day 2

 

class Solution:
    def arraySign(self, nums: List[int]) -> int:

        if 0 in nums:
            return 0

        len_n = 0
        for n in nums:
            if n < 0:
                len_n = len_n +1

        return -1 if len_n % 2 else 1