feat: add solutions to leetcode problem: No.1133. Largest Unique Number

Author: yanglbme

solution/1100-1199/1133.Largest Unique Number/README.md

@@ -37,27 +37,68 @@
 	<li><code>0 &lt;= A[i] &lt;= 1000</code></li>
 </ol>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
 
+计数器实现。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def largestUniqueNumber(self, A: List[int]) -> int:
+        counter = collections.Counter(A)
+        for i in range(1000, -1, -1):
+            if counter[i] == 1:
+                return i
+        return -1
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int largestUniqueNumber(int[] A) {
+        int[] counter = new int[1001];
+        for (int a : A) {
+            ++counter[a];
+        }
+        for (int i = 1000; i >= 0; --i) {
+            if (counter[i] == 1) {
+                return i;
+            }
+        }
+        return -1;
+    }
+}
+```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} A
+ * @return {number}
+ */
+var largestUniqueNumber = function (A) {
+  let counter = {};
+  for (const a of A) {
+    counter[a] = (counter[a] || 0) + 1;
+  }
+  for (let i = 1000; i >= 0; --i) {
+    if (counter[i] == 1) {
+      return i;
+    }
+  }
+  return -1;
+};
 ```
 
 ### **...**

solution/1100-1199/1133.Largest Unique Number/README_EN.md

@@ -6,20 +6,12 @@
 
 <p>Given an array of integers <code>A</code>, return the largest integer that only occurs once.</p>
 
-
-
 <p>If no integer occurs once, return -1.</p>
 
-
-
 <p>&nbsp;</p>
 
-
-
 <p><strong>Example 1:</strong></p>
 
-
-
 <pre>
 
 <strong>Input: </strong><span id="example-input-1-1">[5,7,3,9,4,9,8,3,1]</span>
@@ -32,12 +24,8 @@ The maximum integer in the array is 9 but it is repeated. The number 8 occurs on
 
 </pre>
 
-
-
 <p><strong>Example 2:</strong></p>
 
-
-
 <pre>
 
 <strong>Input: </strong><span id="example-input-1-1">[9,9,8,8]</span>
@@ -50,37 +38,69 @@ There is no number that occurs only once.
 
 </pre>
 
-
-
 <p>&nbsp;</p>
 
-
-
 <p><strong>Note:</strong></p>
 
-
-
 <ol>
 	<li><code>1 &lt;= A.length &lt;= 2000</code></li>
 	<li><code>0 &lt;= A[i] &lt;= 1000</code></li>
 </ol>
 
-
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def largestUniqueNumber(self, A: List[int]) -> int:
+        counter = collections.Counter(A)
+        for i in range(1000, -1, -1):
+            if counter[i] == 1:
+                return i
+        return -1
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int largestUniqueNumber(int[] A) {
+        int[] counter = new int[1001];
+        for (int a : A) {
+            ++counter[a];
+        }
+        for (int i = 1000; i >= 0; --i) {
+            if (counter[i] == 1) {
+                return i;
+            }
+        }
+        return -1;
+    }
+}
+```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} A
+ * @return {number}
+ */
+var largestUniqueNumber = function (A) {
+  let counter = {};
+  for (const a of A) {
+    counter[a] = (counter[a] || 0) + 1;
+  }
+  for (let i = 1000; i >= 0; --i) {
+    if (counter[i] == 1) {
+      return i;
+    }
+  }
+  return -1;
+};
 ```
 
 ### **...**

solution/1100-1199/1133.Largest Unique Number/Solution.java

@@ -0,0 +1,14 @@
+class Solution {
+    public int largestUniqueNumber(int[] A) {
+        int[] counter = new int[1001];
+        for (int a : A) {
+            ++counter[a];
+        }
+        for (int i = 1000; i >= 0; --i) {
+            if (counter[i] == 1) {
+                return i;
+            }
+        }
+        return -1;
+    }
+}

solution/1100-1199/1133.Largest Unique Number/Solution.js

@@ -0,0 +1,16 @@
+/**
+ * @param {number[]} A
+ * @return {number}
+ */
+var largestUniqueNumber = function (A) {
+  let counter = {};
+  for (const a of A) {
+    counter[a] = (counter[a] || 0) + 1;
+  }
+  for (let i = 1000; i >= 0; --i) {
+    if (counter[i] == 1) {
+      return i;
+    }
+  }
+  return -1;
+};

solution/1100-1199/1133.Largest Unique Number/Solution.py

@@ -0,0 +1,7 @@
+class Solution:
+    def largestUniqueNumber(self, A: List[int]) -> int:
+        counter = collections.Counter(A)
+        for i in range(1000, -1, -1):
+            if counter[i] == 1:
+                return i
+        return -1