From 0b3e4aed920c420d6fdb1d76872e826796926ed3 Mon Sep 17 00:00:00 2001
From: Logen <47022821+Logenleedev@users.noreply.github.com>
Date: Mon, 20 Feb 2023 22:30:01 -0600
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=E6=96=B0=E6=96=B9=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/1207.独一无二的出现次数.md | 23 +++++++++++++++++++-
 1 file changed, 22 insertions(+), 1 deletion(-)

diff --git a/problems/1207.独一无二的出现次数.md b/problems/1207.独一无二的出现次数.md
index afc93eda..1a7a0019 100644
--- a/problems/1207.独一无二的出现次数.md
+++ b/problems/1207.独一无二的出现次数.md
@@ -98,7 +98,8 @@ class Solution {
 ```
 
 Python：
-```python
+```python 
+# 方法 1: 数组在哈西法的应用
 class Solution:
     def uniqueOccurrences(self, arr: List[int]) -> bool:
         count = [0] * 2002
@@ -113,6 +114,26 @@ class Solution:
                     return False
         return True
 ```
+```python 
+# 方法 2： map 在哈西法的应用
+class Solution:
+    def uniqueOccurrences(self, arr: List[int]) -> bool:
+        ref = dict()
+
+        for i in range(len(arr)):
+            ref[arr[i]] = ref.get(arr[i], 0) + 1
+
+        value_list = sorted(ref.values())
+
+        for i in range(len(value_list) - 1):
+            if value_list[i + 1] == value_list[i]:
+                return False 
+
+        return True 
+
+```
+
+
 Go：
 
 JavaScript：