Leetcode || Remove Duplicates from Sorted Array

sjtu_chenchen

于 2015-11-05 11:31:23 发布

阅读量368

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 数据结构算法 java技术文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/sjtu_chenchen/article/details/49660505

java技术同时被 3 个专栏收录

96 篇文章 ¥19.90 ¥99.00

订阅专栏

超级会员免费看

数据结构算法

50 篇文章

订阅专栏

leetcode

32 篇文章

订阅专栏

这篇博客探讨了如何在已排序的数组中就地删除重复元素，以确保每个元素只出现一次。通过实现一个返回新长度的函数，例如对于输入数组nums = [1,1,2]，正确操作后数组长度应为2，前两个元素为1和2。" 111253445,9336631,Go语言基础：变量、常量与枚举详解,['Go'],"['Go语言', '变量', '常量', '枚举', 'iota', '类型推断']

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

package pack;

import java.util.Arrays;

class Solution {
    public int removeDuplicates(int[] nums) {
        if(nums ==

了解本专栏

超级会员免费看