https://leetcode.com/problems/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.
我提交的次数太多,所以排名后面
/**
* @param {number[]} nums
* @param {number} val
* @return {number}
*/
var removeElement = function(nums, val) {
var j=0;
for(i=0,j=0;i<nums.length;i++){
if(nums[i]!=val){
nums[j]=nums[i];
j++;
}
}
return j;
};
移除元素算法解析

本文介绍了一种在不使用额外空间的情况下从数组中移除指定值的方法,并保持其他元素顺序不变。通过一个简单的循环和指针技巧实现了原地移除,最终返回新的有效长度。
865

被折叠的 条评论
为什么被折叠?



