• Leetcode----27 Remove Element


    Description

    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.

     Solution

    https://leetcode.com/submissions/detail/108761807/

    /**
     * @param {number[]} nums
     * @param {number} val
     * @return {number}
     */
    var removeElement = function(nums, val) {
        var length = nums.length,
            beginner = 0;
        for(var i=0;i<length;i++) {
            if(nums[i] != val) {
                nums[beginner++] = nums[i];
            }
        }
        return beginner;
    };
    

      

  • 相关阅读:
    树状数组
    LCA最近公共祖先
    ordered_set
    马拉车算法
    数论
    图论
    其他
    线段树
    序列自动机
    优先队列
  • 原文地址:https://www.cnblogs.com/samo/p/7135635.html
Copyright © 2020-2023  润新知