[LeetCode27]Remove Element

最新推荐文章于 2025-11-24 01:23:29 发布

原创最新推荐文章于 2025-11-24 01:23:29 发布 · 793 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #数组 #array

Leetcode 同时被 2 个专栏收录

287 篇文章

订阅专栏

LeetCode Questions

178 篇文章

订阅专栏

本文介绍了一种通过双指针扫描和变量记录频率的方法，在原地删除数组中指定元素，并返回新数组的长度。提供两种Java实现方式，包括直接覆盖和循环跳过操作。

Given an array and a value, remove all instances of that value in place and return the new length.

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

Analysis:

two pointers scan, one variable record the frequency of the value, detailed see in code

Java

public int removeElement(int[] A, int elem) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        int count = 0;
        for(int i=0;i<A.length;i++){
        	if(A[i] == elem)
        		count++;
        	else if(count>0)
        		A[i-count] = A[i];
        }
		return A.length - count;
    }

Another one:

public int removeElement(int[] A, int elem) {
        int count = 0;
        for(int i=0;i<A.length;i++){
        	if(A[i]!=elem){
        		A[count++]=A[i];
        	}else{
        		continue;
        	}
        }
        return count;
    }

c++

int removeElement(int A[], int n, int elem) {
        int cur =0;
    for(int i=0;i<n;i++){
        if(A[i]==elem)
            continue;
        A[cur] = A[i];
        cur++;
    }
    return cur;
    }