美文网首页
Leetcode 27. Remove Element

Leetcode 27. Remove Element

作者: persistent100 | 来源:发表于2017-04-07 11:31 被阅读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.

    分析

    给定一个数组,去除所有给定值的元素,并返回剩下的数组长度。数组是个指针类型,直接替换掉其中元素即可。C代码如下,已通过。

    int removeElement(int* nums, int numsSize, int val) {
        int ans=0;
        for(int i=0;i<numsSize;i++)
        {
            if(nums[i]!=val)
            {
                nums[ans]=nums[i];
                ans++;
            }
        }
        return ans;
    }
    

    相关文章

      网友评论

          本文标题:Leetcode 27. Remove Element

          本文链接:https://www.haomeiwen.com/subject/ttqhattx.html