feat: add solutions to leetcode problem: No.1822. Sign of the Product of an Array

Author: yanglbme

Diff for: lcof/面试题66. 构建乘积数组/README.md

@@ -34,7 +34,7 @@
 class Solution:
     def constructArr(self, a: List[int]) -> List[int]:
         n = len(a)
-        output = [1 for _ in a]
+        output = [1] * n
         left = right = 1
         for i in range(n):
             output[i] = left

Diff for: lcof/面试题66. 构建乘积数组/Solution.py

@@ -1,12 +1,12 @@
 class Solution:
     def constructArr(self, a: List[int]) -> List[int]:
         n = len(a)
-        output = [1 for _ in a]
+        output = [1] * n
         left = right = 1
         for i in range(n):
             output[i] = left
             left *= a[i]
         for i in range(n - 1, -1, -1):
             output[i] *= right
             right *= a[i]
-        return output
+        return output

Diff for: solution/1800-1899/1822.Sign of the Product of an Array/README.md

@@ -53,7 +53,6 @@
 	<li><code>-100 <= nums[i] <= 100</code></li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
@@ -65,15 +64,49 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def arraySign(self, nums: List[int]) -> int:
+        res = 1
+        for num in nums:
+            if num == 0:
+                return 0
+            if num < 0:
+                res *= -1
+        return res
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int arraySign(int[] nums) {
+        int res = 1;
+        for (int num : nums) {
+            if (num == 0) return 0;
+            if (num < 0) res *= -1;
+        }
+        return res;
+    }
+}
+```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var arraySign = function (nums) {
+  let res = 1;
+  for (let num of nums) {
+    if (num == 0) return 0;
+    if (num < 0) res *= -1;
+  }
+  return res;
+};
 ```
 
 ### **...**

Diff for: solution/1800-1899/1822.Sign of the Product of an Array/README_EN.md

@@ -49,21 +49,54 @@
 	<li><code>-100 &lt;= nums[i] &lt;= 100</code></li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def arraySign(self, nums: List[int]) -> int:
+        res = 1
+        for num in nums:
+            if num == 0:
+                return 0
+            if num < 0:
+                res *= -1
+        return res
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int arraySign(int[] nums) {
+        int res = 1;
+        for (int num : nums) {
+            if (num == 0) return 0;
+            if (num < 0) res *= -1;
+        }
+        return res;
+    }
+}
+```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var arraySign = function (nums) {
+  let res = 1;
+  for (let num of nums) {
+    if (num == 0) return 0;
+    if (num < 0) res *= -1;
+  }
+  return res;
+};
 ```
 
 ### **...**

Diff for: solution/1800-1899/1822.Sign of the Product of an Array/Solution.java

@@ -0,0 +1,10 @@
+class Solution {
+    public int arraySign(int[] nums) {
+        int res = 1;
+        for (int num : nums) {
+            if (num == 0) return 0;
+            if (num < 0) res *= -1;
+        }
+        return res;
+    }
+}

Diff for: solution/1800-1899/1822.Sign of the Product of an Array/Solution.js

@@ -0,0 +1,12 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var arraySign = function (nums) {
+  let res = 1;
+  for (let num of nums) {
+    if (num == 0) return 0;
+    if (num < 0) res *= -1;
+  }
+  return res;
+};

Diff for: solution/1800-1899/1822.Sign of the Product of an Array/Solution.py

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