From 6cdab826c73aa3b121d6d3aa8aeb9aa44fe00eb2 Mon Sep 17 00:00:00 2001
From: sangge <2251250136@qq.com>
Date: Sat, 9 Mar 2024 03:58:16 +0800
Subject: [PATCH] finish 27

---
 leetcode/27.py | 28 ++++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)
 create mode 100644 leetcode/27.py

diff --git a/leetcode/27.py b/leetcode/27.py
new file mode 100644
index 0000000..9521ddc
--- /dev/null
+++ b/leetcode/27.py
@@ -0,0 +1,28 @@
+from typing import List
+'''
+Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. 
+The order of the elements may be changed. 
+Then return the number of elements in nums which are not equal to val.
+
+Consider the number of elements in nums which are not equal to val be k, 
+to get accepted, you need to do the following things:
+
+Change the array nums such that the first k elements of nums 
+contain the elements which are not equal to val. 
+The remaining elements of nums are not important as well as the size of nums.
+
+Return k.
+Constraints:
+
+0 <= nums.length <= 100
+0 <= nums[i] <= 50
+0 <= val <= 100
+'''
+class Solution:
+    def removeElement(self, nums: List[int], val: int) -> int:
+        k = len(nums)
+        while val in nums:
+            nums.remove(val)
+            k = k - 1
+        return k
+