Best solution by java in Runtime 8ms
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nimport java.math.BigInteger;\n\nclass Solution {\n    public int arraySign(int[] nums) {\n         BigInteger res = BigInteger.ONE;\n\n\n        for (int i = 0; i < nums.length ; i++) {\n            res = res.multiply(BigInteger.valueOf(nums[i]));\n        }\n\n        return res.signum() ;\n    }\n}\n```\n## For additional problem-solving solutions, you can explore my repository on GitHub: [GitHub Repository](https://github.com/ahmedna126/java_leetcode_challenges)\n\n\n\n\n![e78315ef-8a9d-492b-9908-e3917f23eb31_1674946036.087042.jpeg](https://assets.leetcode.com/users/images/7f2e544c-bd28-4f74-9a69-02531ffef3a6_1683577246.8802.jpeg)\n
['Java']