Leetcode daily question - 27 Remove element (simple)

The two articles in this article refer to the official java solution , There is no official python The answer .
The optimization is the first if sentence .
Solution 1 ：

class Solution:
    def removeElement(self, nums: List[int], val: int) -> int:
        # First of all to see val Range ratio of nums[i] Twice as big , Narrow the scope first , This step is very important .
        # If there is no such step , Once a number greater than 50, Still compare from beginning to end 
        if val >50 :
            # Notice here that the return is a number , Not the array itself （ Will report a mistake ）
            return len(nums)
        
        # Double finger needling 
        n = len(nums)
        left = 0 
        right = 0
        while right < n:
            if nums[right] != val:
                    nums[left] = nums[right]
                    left += 1
            right += 1
        return left

Solution 2

class Solution:
    def removeElement(self, nums: List[int], val: int) -> int:
        # First of all to see val Range ratio of nums[i] Twice as big , Narrow the scope first 
        if val >50 :
            # Notice here that the return is a number , Not the array itself （ Will report a mistake ）
            return len(nums)
        
        # Double finger needling 
        n = len(nums)
        left = 0 
        right = n
        while left < right:
            if nums[left] == val:
                    nums[left] = nums[right-1]
                    right -= 1
            else:
                left += 1
        return left