凌云的博客

成功=工作+游戏+少说空话

LeetCode 算法题 26. Remove Duplicates from Sorted Array

分类:algorithm| 发布时间:2016-07-17 22:48:00


题目

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.

题意

删除一个有序数组中的重复值。

解法

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if (nums.empty()) {
            return 0;
        }

        int newSize = 0, val = nums[0];
        bool hasDuplicate = false;
        const int size = nums.size();
        for (int i = 1; i < size; ++i) {
            if (val !=nums[i]) {
                val = nums[i];

                if (hasDuplicate) {
                    nums[newSize] = nums[i];
                }

                ++newSize;
            } else {
                if (!hasDuplicate) {
                    hasDuplicate = true;
                    ++newSize;
                }
            }
        }

        if (!hasDuplicate) {
            ++newSize;
        }

        return newSize;
    }
};