首页 > itarticle > algorithm notes: leetcode#27 remove element

algorithm notes: leetcode#27 remove element

admin 11月 12, 2020 0

Problem

Solution

Analysis

Python implementation

class :
    def removeElement(self, nums, val):
        """
        :type nums: List[int]
        :type val: int
        :rtype: int
        """
        i = 0
        for j in range(len(nums)):
            if nums[j] != val:
                nums[i] = nums[j]
                i += 1
        return i

Java implementation

class  {
    public int removeElement(int[] nums, int val) {
        int i = 0;
        for(int j = 0; j < nums.length; j++){
            if(nums[j] != val){
                nums[i] = nums[j];
                i++;
            }
        }
        return i;
    }
}

Time complexity

O(n).

Space complexity

O(1).

Link

27. Remove Element
(中文版) 算法笔记: 力扣#27 移除元素