关闭

27. Remove Element*

57人阅读 评论(0) 收藏 举报
分类:

Given an array and a value, remove all instances of that value in place and return the new length.

Do not allocate extra space for another array, you must do this in place with constant memory.

The order of elements can be changed. It doesn't matter what you leave beyond the new length.

Example:
Given input array nums = [3,2,2,3], val = 3

Your function should return length = 2, with the first two elements of nums being 2.

My code:

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

Same to the Move zeros problem, but sort of forgotten

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:60331次
    • 积分:3898
    • 等级:
    • 排名:第8606名
    • 原创:332篇
    • 转载:90篇
    • 译文:0篇
    • 评论:11条
    最新评论