Leetcode-Array- Remove Duplicates from Sorted Array

Preface

        Recently, I'm learning on leetcode which can improve ability to solve algorithm problem. Since the leetcode has divided multiple chapters, I will record my thinking and solutions by each chapters. I also will record the improve solutions.

Problem

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.

Algorithm Idea

        As this problem can't use external memory and the array has been sorted, so I try to use the method of iterating through the array. I'm using two pointer which the first pointer is used to point to first number of each group which distinguish by different numbers on array and the second pointer is used to through the distinguish groups until point to first number of next groups or the end of array. Accounting the amount of distinguish groups and replacing the correspond place context, the problem can be solved.

Implement

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        
        int j;
        int dup = 0;
        int len = nums.size();
        
            
        for (int i = 0; i < len;) {
                
            for (j = i + 1; j < len; j++) 
                if (nums[i] != nums[j]) {
                    
                    i = j;
                    break;   
                }
            
            if (j == len)
                i = len;
            
            nums[dup] = nums[i - 1];    
            dup += 1;
        }
        
        return dup;
    }
}

Conclusion

Firstly, this algorithm time complexity is O(N). The algorithm just through a sorted-base array once time, so it time complexity is depend on the length of array.

Secondly, this solution uses 28ms to 30ms to test by official test use case, it just exceed about 72% solution, so it can improve.