Algorithm: Remove duplicate data from sorted array 26. Remove Duplicates from Sorted Array

For the complete collection of LeetCode, please refer to: LeetCode Github Collection

topic

26. Remove Duplicates from Sorted Array
Given a sorted array nums, remove the duplicates in-place such that each element appears only once and returns 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.

Clarification:

Confused why the returned value is an integer but your answer is an array?

Note that the input array is passed in by reference, which means a modification to the input array will be known to the caller as well.

Internally you can think of this:

// nums is passed in by reference. (i.e., without making a copy)
int len = removeDuplicates(nums);

// any modification to nums in your function would be known by the caller.
// using the length returned by your function, it prints the first len elements.
for (int i = 0; i < len; i++) {
    
    
    print(nums[i]);
}

Example 1:

Input: nums = [1,1,2]
Output: 2, nums = [1,2]
Explanation: 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 returned length.

Example 2:

Input: nums = [0,0,1,1,1,2,2,3,3,4]
Output: 5, nums = [0,1,2,3,4]
Explanation: Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively. It doesn't matter what values are set beyond the returned length.

Constraints:

0 <= nums.length <= 3 * 104
-104 <= nums[i] <= 104
nums is sorted in ascending order.

Solve with two pointers

1. Determine the boundary and return 0 if the array is empty;
2. Record the last number pre, and the current position index that is not duplicated;
3. Traverse the array until it finds out that it is not equal to the previous number, then assign the current number to the next index, and replace pre with the current number;

class Solution {
    
    
    public int removeDuplicates(int[] nums) {
    
    
        // check edge
        if (nums == null || nums.length == 0) {
    
    
            return 0;
        }
        int pre = nums[0];
        int index = 1;
        for (int k = 1; k < nums.length; k++) {
    
    
            if (nums[k] != pre) {
    
    
                nums[index] = nums[k];
                index++;
                pre = nums[k];
            }
        }
        
        return index;
    }
}