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

    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]);
    }

    非常简单,直接上代码。单向双指针。

    时间O(n), n = nums.length

    空间O(1)

    JavaScript实现

     1 /**
     2  * @param {number[]} nums
     3  * @param {number} val
     4  * @return {number}
     5  */
     6 var removeElement = function(nums, val) {
     7     const len = nums.length;
     8     let res = 0;
     9     for (let i = 0; i < nums.length; i++) {
    10         if (nums[i] != val) {
    11             nums[res] = nums[i];
    12             res++;
    13         }
    14     }
    15     return res;
    16 };

    Java实现

     1 class Solution {
     2     public int removeElement(int[] nums, int val) {
     3         // corner case
     4         if (nums == null || nums.length == 0) return 0;
     5 
     6         // normal case
     7         int res = 0;
     8         for (int i = 0; i < nums.length; i++) {
     9             if (nums[i] != val) {
    10                 nums[res] = nums[i];
    11                 res++;
    12             }
    13         }
    14         return res;
    15     }
    16 }

    LeetCode 题目总结

  • 相关阅读:
    毕业四年,你赚回四年的花费了吗?
    【转】解决VS2008 开发Windows Mobile 项目生成速度慢的问题
    WinCE/Mobile上下滑动浏览DataGrid数据 【转】
    【转】取得汉字拼音的首字母
    漂亮的 Windows Mobile 按钮
    SQLite中的常用操作(总结)
    浅谈HTTP中Get与Post的区别
    Oracle学习之数组
    firefox与ie 的javascript区别
    常用bash shell 脚本
  • 原文地址:https://www.cnblogs.com/cnoodle/p/11639259.html
Copyright © 2011-2022 走看看