solves sign of the product of an array

Author: anishLearnsToCode

README.md

@@ -442,7 +442,7 @@
 | 1805 | [Number of Different Integers in a String](https://leetcode.com/problems/number-of-different-integers-in-a-string)                                        |                                                        [![Java](assets/java.png)](src/NumberOfDifferentIntegersInString.java)                                                        |                                                                                                                                   |
 | 1812 | [Determine Color of a Chessboard Square](https://leetcode.com/problems/determine-color-of-a-chessboard-square)                                            |                                                        [![Java](assets/java.png)](src/DetermineColorOfChessboardSquare.java)                                                         |                                                                                                                                   |
 | 1816 | [Truncate Sentence](https://leetcode.com/problems/truncate-sentence)                                                                                      |                                                                [![Java](assets/java.png)](src/TruncateSentences.java)                                                                |                                                                                                                                   |
-| 1822 | [Sign of the Product of an Array](https://leetcode.com/problems/sign-of-the-product-of-an-array)                                                          |                                                                                                                                                                                      |                                                                                                                                   |
+| 1822 | [Sign of the Product of an Array](https://leetcode.com/problems/sign-of-the-product-of-an-array)                                                          |                                                            [![Java](assets/java.png)](src/SignOfTheProductOfAnArray.java)                                                            |                                                                                                                                   |
 | 1826 | [Faulty Sensor](https://leetcode.com/problems/faulty-sensor)                                                                                              |                                                                                                                                                                                      |                                                                                                                                   |
 | 1827 | [Minimum Operations to Make the Array Increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing)                          |                                                                                                                                                                                      |                                                                                                                                   |
 | 1832 | [Check if the Sentence Is Pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram)                                                        |                                                                                                                                                                                      |                                                                                                                                   |

src/SignOfTheProductOfAnArray.java

@@ -0,0 +1,14 @@
+public class SignOfTheProductOfAnArray {
+    public int arraySign(int[] nums) {
+        int sign = 1;
+        for (int element : nums) {
+            sign *= signum(element);
+        }
+        return sign;
+    }
+
+    private int signum(int x) {
+        if (x == 0) return 0;
+        return x > 0 ? 1 : -1;
+    }
+}