Leetcode- Remove Duplicates from Sorted Array

这几天做的几道数组de简单题目：

Given a sorted array, 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 in place with constant memory.
For example,
Given input array nums = [1,1,2],
Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn’t matter what you leave beyond the new length.

排序数组去重，要求O(1)的空间复杂度：
代码很简单，核心是用两个指针，

int removeDuplicates(int* nums, int numsSize) {
    assert(nums!=NULL);
    if(numsSize<2)return numsSize;
    int i = 1,j = 1;
    for(;i<numsSize;i++)
    {
        if(nums[i]!=nums[i-1])
            nums[j++]=nums[i];
    }
    return j;
}

还有几道类似的题：

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 i=0,j=0;
    for(;i<numsSize;i++)
    {
        if(nums[i]!=val)
        {
            nums[j]=nums[i];
            j++;
        }
    }
    return j;
}

Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.
For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0].
Note:
You must do this in-place without making a copy of the array.
Minimize the total number of operations.

void moveZeroes(int* nums, int numsSize) {
    int i=0,j=0,k=numsSize-1;
    for(;i<numsSize;i++)
    {
        if(nums[i]!=0)
            nums[j++]=nums[i];
        else
            k--;
    }
    for(int m=k+1;m<numsSize;m++)
        nums[m]=0;

}

三道题都是同样的思想，实现O(1)的空间复杂度，O(N)的时间复杂度，都是采用两个指针，一次遍历。