++i与i++，不创建额外空间变更数组（Remove Element，Remove Duplicates from Sorted Array）

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.

int removeElement(int* nums, int numsSize, int val) {
int len=0;
int i;

if(!numsSize)
    return 0;
else{
    for(i=0;i<numsSize;++i){
        if(nums[i]!=val)
            nums[len++]=nums[i];//采用len++,先使用值再加，因为第一个值可能就得去掉

    }
}
return len;

}

Given a sorted array nums, remove the duplicates in-place such that each element appear only once 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.

int removeDuplicates(int* nums, int numsSize) {
int len=0;
int i;

if(!numsSize)
    return 0;
else{
for(i=0;i<numsSize;++i){
    if(nums[i]!=nums[len])
       nums[++len]=nums[i]; //采用++len,先加再用值，因为第一个元素必相等
}
}
return (len+1);

}

均需注意数组为空的情况