• Leetcode-27 Remove Element


    #27.    Remove Element          

    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.

    Hint:

    1. Try two pointers.

    题解:根据提示来做就好了。

    class Solution {
    public:
        int removeElement(vector<int>& nums, int val) {
            int cnt=0;
            for(int i=0;i<nums.size();i++)
            {
                if(nums[i]!=val)
                {
                    swap(nums[i],nums[cnt]);
                    cnt++;
                }
            }
            return cnt;
        }
    };
  • 相关阅读:
    redis
    魔法方法
    vue
    bbs技术总结
    Linux
    爬虫
    路飞项目
    Django-rest framework框架
    Django框架
    WEB
  • 原文地址:https://www.cnblogs.com/fengxw/p/6086132.html
Copyright © 2020-2023  润新知