zoukankan      html  css  js  c++  java
  • 19.1.30 [LeetCode 27] Remove Element

    Given an array nums and a value val, remove all instances of that value in-placeand return the new length.

    Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.

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

    Example 1:

    Given nums = [3,2,2,3], val = 3,
    
    Your function should return length = 2, with the first two elements of nums being 2.
    
    It doesn't matter what you leave beyond the returned length.
    

    Example 2:

    Given nums = [0,1,2,2,3,0,4,2], val = 2,
    
    Your function should return length = 5, with the first five elements of nums containing 0, 1, 3, 0, and 4.
    
    Note that the order of those five elements can be arbitrary.
    
    It doesn't matter what values are set beyond the returned length.

    Clarification:

    Confused why the returned value is an integer but your answer is an array?

    Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.

    Internally you can think of this:

    // nums is passed in by reference. (i.e., without making a copy)
    int len = removeElement(nums, val);
    
    // any modification to nums in your function would be known by the caller.
    // using the length returned by your function, it prints the first len elements.
    for (int i = 0; i < len; i++) {
        print(nums[i]);
    }
     1 class Solution {
     2 public:
     3     int removeElement(vector<int>& nums, int val) {
     4         sort(nums.begin(), nums.end());
     5         auto p = find(nums.begin(), nums.end(), val);
     6         if (p == nums.end())return nums.size();
     7         int idx = p - nums.begin(), i;
     8         for (i = idx + 1; i < nums.size(); i++)
     9             if (nums[i] != val)break;
    10         int gap = i - idx;
    11         for (;i < nums.size();i++)
    12             nums[i - gap] = nums[i];
    13         return nums.size() - gap;
    14     }
    15 };
    View Code
  • 相关阅读:
    桶排序
    linux下如何修改进程优先级?
    在旋转排序数组之后的数组中找到目标值的位置(很多遍 ,总是晕)
    PHP生成随机数函数rand(min,max)
    使用PHP编写发红包程序
    maven的lifecycle
    mysq中char,varchar,text的区别
    contrller层的编码设设计流程以及详细配置
    mybatis的dao层和service层的编码设计的配置
    Next_day()函数的用法
  • 原文地址:https://www.cnblogs.com/yalphait/p/10337122.html
Copyright © 2011-2022 走看看