第12周作业2(LeetCoed26)

1. 题目描述

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.

2. 解题思路

首先这道题很容易想到暴力解法，因为数组已经是排好序的了，所以只需要从左到右遍历一遍数组，当找到重复相等的元素就做删除操作，但是删除一个元素，后面的元素都要往前移，这样就大大增加了时间复杂度（O(n^2)），所以这肯定不是最有效的解决办法。根据题目中的提示，我们可以定义两个指针（下标）i和j，令i作为删除更新操作的标志，j作为搜索遍历的标志，这样一来的时间复杂度就降低为O(n)。

3. 完整代码

#include<iostream>
#include<vector>

using namespace std;

int RemoveDupinSortedArray(vector<int> &array){
    if (array.size() == 0)
        return 0;
    if (array.size() == 1)
        return 1;
    int i=0, j = 0;
    for (; j<array.size()-1; j++)
    {
        if (array[j] != array[j + 1]){
            array[++i] = array[j+1];
        }
    }
    return ++i;

}

int main(){
    vector<int> Arr;
    int temp = 0;
    cout << "请按从小到大的顺序输入数组的各个元素：\n" << endl;

    while (cin >> temp)
    {
        Arr.push_back(temp);
        if (cin.peek() == '\n')
        {
            break;
        }
    }
    int result = RemoveDupinSortedArray(Arr);
    cout << "新数组的长度为：\n" << result << endl;
    cout << "新数组为：\n" << endl;
    for (int i = 0; i < result; i++)
    {
        cout << Arr[i] << endl;
    }

    return 0;
}