diff --git a/LeetCode/0080_Remove_Duplicates_from_Sorted_Array_II.py b/LeetCode/0080_Remove_Duplicates_from_Sorted_Array_II.py
new file mode 100644
index 0000000..b09e67d
--- /dev/null
+++ b/LeetCode/0080_Remove_Duplicates_from_Sorted_Array_II.py
@@ -0,0 +1,19 @@
+class Solution:
+    def removeDuplicates(self, nums: List[int]) -> int:
+        ans=0
+        i=0
+        curlen=len(nums)
+        while i < curlen:
+            if i==0 or i==1:
+                ans+=1
+            elif not (nums[i]==nums[i-1] and nums[i-1]==nums[i-2]):
+                ans+=1
+            elif nums[i]==nums[i-1] and nums[i-1]==nums[i-2]:
+                j=i
+                while j < curlen-1:
+                    nums[j]=nums[j+1]
+                    j+=1
+                curlen-=1
+                i-=1
+            i+=1
+        return ans
\ No newline at end of file