chore: add daily leetcode post 80_translated

Author: longsizhuo

app/docs/CommunityShare/Leetcode/80_translated.md

@@ -0,0 +1,44 @@
+---
+title: Python beat98.40% collectionsofCounter method！
+date: '2024.01.01 0:00'
+tags:
+  - - Python
+  - - solved
+    - answer
+abbrlink: 73b5ce9c
+category:
+---
+
+
+
+
+
+
+Pyhton `collection` In the bag `Counter()` Be rightlist里出现of元素conduct计数，And the output is a dictionary。
+for example`nums=[1, 1, 1, 2, 2, 3]` ToCounter后of结果是`Counter({1: 3, 2: 2, 3: 1})`。
+1. So traverse a dictionary，when`value>3`of时候`value=2`，Can be greater than2indivualof元素计数become2indivual。
+1. So we will`Counter({1: 3, 2: 2, 3: 1})`become`Counter({1: 2, 2: 2, 3: 1})`后再Toelementsconductlist操作就可以得到改变后of列表了。
+
+---
+
+Due to the meaning of the question“Input the array「Quote」方式传递of”，So we willnumsJust fill in and fill in
+
+
+```python
+from collections import Counter # Imported package
+class Solution:
+    def removeDuplicates(self, nums: List[int]) -> List[int]:
+        dict1 = Counter(nums)
+        for i in dict1:
+            if dict1[i] > 2:
+                dict1[i] = 2
+        list1 = list(dict1.elements())
+        nums.clear() # clear the list
+        nums.extend(list1) # Add the collection to the list
+        return len(nums)
+```
+Complexity analysis
+
+time complexity：`O(n)`，in `n` 是数组of长度。We have a maximum of this array once。
+
+Spatial complexity：`O(1)`。我们只需要常数of空间存储若干变量。