Leetcode 26 Remove Duplicates from Sorted Array

最新推荐文章于 2024-10-06 13:06:38 发布

原创最新推荐文章于 2024-10-06 13:06:38 发布 · 337 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

167 篇文章

订阅专栏

本文介绍了一个高效的算法，用于在不使用额外空间的情况下移除已排序数组中的重复元素，并返回处理后数组的新长度。通过一次遍历和常数级内存消耗实现了这一目标。

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.

public class Solution {
    public int removeDuplicates(int[] nums) {
        int original = nums.length;
        int j =1;
        for(int i = 1; i<original;i++){
            if(nums[i] != nums[i-1]){
              nums[j++] = nums[i];
             
            } 
        }
        return j;
    }
}

没什么特别要说的/。。。就是记得看清楚是不是修改原数组