关闭

leetcode-27-Remove Element

73人阅读 评论(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.

题意:去掉list中值等于val的元素,其他若干元素依次保存在list前若干位置。不用新的空间,使用连续内存。代码和上一题类似。

python AC 56ms。

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

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:20864次
    • 积分:802
    • 等级:
    • 排名:千里之外
    • 原创:60篇
    • 转载:2篇
    • 译文:0篇
    • 评论:22条
    文章分类
    最新评论