zoukankan      html  css  js  c++  java
  • 1822. Sign of the Product of an Array

    package LeetCode_1822
    
    /**
     * 1822. Sign of the Product of an Array
     * https://leetcode.com/problems/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).
    
    Example 1:
    Input: nums = [-1,-2,-3,-4,3,2,1]
    Output: 1
    Explanation: 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
    Explanation: 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
    Explanation: The product of all values in the array is -1, and signFunc(-1) = -1
    
    Constraints:
    1. 1 <= nums.length <= 1000
    2. -100 <= nums[i] <= 100
     * */
    class Solution {
        fun arraySign(nums: IntArray): Int {
            if (nums.isEmpty()) {
                return 0
            }
            var sign = 1
            for (num in nums) {
                if (num == 0) {
                    return 0
                }
                if (num < 0) {
                    sign *= -1
                }
            }
            return sign
        }
    }
  • 相关阅读:
    I2S波形解析
    F407整点原子I2C波形解码
    WAVE格式文件说明
    ADC结构体初始化成员
    这次,我是真的想吐槽MDK
    I2S源程序(正点原子F407探索者)
    强制类型转换
    嵌套结构体的初始化
    lua 元方法 __index
    lua pairs 与 ipairs
  • 原文地址:https://www.cnblogs.com/johnnyzhao/p/15085104.html
Copyright © 2011-2022 走看看