首页 > 代码库 > 【leetcode】Remove Element
【leetcode】Remove Element
题目：
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.
Java AC代码：
public class Solution {
public int removeElement(int[] A, int elem) {
if (A == null || A.length == 0) {
return 0;
}
int p1 = 0, p2 = A.length - 1;
while (p1 < p2) {
while (A[p2] == elem && p1 < p2) {
p2--;
}
while (A[p1] != elem && p1 < p2) {
p1++;
}
if (p1 < p2) {
int temp = A[p2];
A[p2] = A[p1];
A[p1] = temp;
}
}
return A[p1] == elem ? p1 : p1 + 1;
}
}【leetcode】Remove Element
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。