26. 删除有序数组中的重复项

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {

        if(nums == NULL || nums.size() == 0)
        {
            return 0;
        }

        int p = 0;
        int q = 1;

        //有序数组 双指针

       while(q < nums.size())
       {
           if(nums[p] != nums[q])
           {
               nums[p + 1] = nums[q];
               p++;
               q++;
           }
           else
           {
               q++;
           }
       }

       return p + 1;//返回数组长度

    }
};

class Solution {
    public int removeDuplicates(int[] nums) {

            int i = 0;
            int j = 1;

            if(nums.length == 0)
            {
                return 0;
            }

            while(j < nums.length)
            {
                if(nums[i] != nums[j])
                {
                    nums[i + 1] = nums[j];
                    i++;
                    j++;
                }
                else
                {
                    j++;
                }
            }

            return i + 1;
    }
}