• Skip to primary navigation
  • Skip to content
  • Skip to footer
junyeong-nero's workspace
  • Problem Solving

    junyeong-nero

    UNIST, CSE 3th

    • Ulsan, Korea
    • Email
    • GitHub
    • Instagram

    23.05.02 Today’s Leetcode

    less than 1 minute read

    1822. Sign of the Product of an Array (easy)

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

    Tags: leetcode

    Categories: leetcode

    Updated: May 2, 2023

    Share on

    Twitter Facebook LinkedIn
    Previous Next

    You may also enjoy

    23.10.30 Today’s Leetcode

    less than 1 minute read

    1356. Sort Integers by The Number of 1 Bits

    23.10.29 Today’s Leetcode

    less than 1 minute read

    ##

    23.10.28 Today’s Leetcode

    less than 1 minute read

    5. Longest Palindromic Substring (medium)

    23.10.27 Today’s Leetcode

    less than 1 minute read

    823. Binary Trees With Factors

    • Follow:
    • Feed
    © 2024 junyeong-nero. Powered by Jekyll & Minimal Mistakes.