LeetCode-Remove Element #27

題目:

Given an array nums and a value val, 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 by modifying the input array in-place with O(1) extra memory.

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

Example 1:

Given nums = [3,2,2,3], val = 3,

Your function should return length = 2, with the first two elements of nums being 2.

It doesn't matter what you leave beyond the returned length.

解說:

給定一整數陣列nums，並移除指定的值val

修改原來的陣列並回傳新的長度

int removeElement(int* nums, int numsSize, int val) {

  

    int index=0;

    for(int i=0;i<numsSize;i++)

    { 

        if(*(nums+i)!=val)//只要依序填入非指定移除的值就可以了!

        {

           *(nums+index)=*(nums+i);

            index++;

        }

    }

    

    return index;

}