zoukankan      html  css  js  c++  java
  • 0027. Remove Element (E)

    Remove Element (E)

    题目

    Given an array nums and a value val, 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 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]);
    }
    

    题意

    将数组中与指定值相等的元素移除,并将剩余元素移到数组前部,返回操作后的数组长度。

    思路

    设两个指针,直接遍历处理。


    代码实现

    Java

    class Solution {
        public int removeElement(int[] nums, int val) {
            int i = 0, j = 0;
            int count = 0;
            while (j < nums.length) {
                if (nums[j] != val) {
    								nums[i++] = nums[j];
                }
    	          j++;
            }
            return i;
        }
    }
    

    JavaScript

    /**
     * @param {number[]} nums
     * @param {number} val
     * @return {number}
     */
    var removeElement = function (nums, val) {
      let p = 0
      for (let q = 0; q < nums.length; q++) {
        if (nums[q] === val) {
          continue
        }
        nums[p++] = nums[q]
      }
      return p
    }
    
  • 相关阅读:
    《Java数据结构与算法》笔记-CH4-5不带计数字段的循环队列
    《Java数据结构与算法》笔记-CH4-4循环队列
    效率方案:快速切换联调、测试、正式环境
    redis 安装、配置与测试
    计算机科学中的圣经
    自建主机
    正则表达式学习入门
    数据库查询语句缺失部分索引,引起的问题(20170209)
    redis 经验、问题以及其解决方案
    资讯周刊---20170210
  • 原文地址:https://www.cnblogs.com/mapoos/p/13185635.html
Copyright © 2011-2022 走看看