您的位置:首页 > 其它

【Leetcode】Remove Element

2015-12-02 15:31 423 查看
题目链接:

题目:

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.

思路:

用count记录要删除元素数目。常用操作要熟记。

算法:

public int removeElement(int[] nums, int val) {
int length = nums.length;
int count = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == val) {
count++;
} else {
nums[i - count] = nums[i];
}
}

length = nums.length - count;
return length;
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: