[leetcode]26. Remove Duplicates from Sorted Array

最新推荐文章于 2024-12-06 07:02:43 发布

原创最新推荐文章于 2024-12-06 07:02:43 发布 · 406 阅读

0 ·

CC 4.0 BY-SA版权

算法同时被 2 个专栏收录

32 篇文章

订阅专栏

数据结构

9 篇文章

订阅专栏

本文介绍了一种不使用额外空间的方法来去除已排序数组中的重复元素，并返回去除后的数组长度。通过两个指针n和m遍历数组，确保每个元素只出现一次。

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.

java代码

public class Solution {
    public int removeDuplicates(int[] A) {
        
        if(A.length<=1)
        {
            return A.length;
        }
        int n=0,m=1;
        while(m<A.length)
        {
            if(A[n]==A[m])
            {
                m++;
            }
            else
            {
                A[++n]=A[m++];
            }
        }
        return n+1;
        
    }
}

go代码

func removeDuplicates(nums []int) int {
    var length int = len(nums)
    if length < 1{
        return length
    }
    var n int = 0
    var m int = 1
    for m < length{
        if nums[m] == nums[n]{
            m++
        }else{
            nums[n+1] = nums[m]
            n++
            m++
        }
    }
    return n+1
}