您的位置:首页 > 其它

LeetCode解题思路之Remove Element

2017-06-21 00:00 176 查看
##问题描述
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.

在原数组上删除给定的元素,并返回新的数组长度

##代码

int removeElement(int* nums, int numsSize, int val)
{
int length = 0;
for (int index = 0; index < numsSize; index++)
{
int elementValue = nums[index];
if (elementValue != val)
{
nums[length++] = elementValue;
}
}
return length;
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  LeetCode