26. Remove Duplicates from Sorted Array

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) {
        
        if(nums.length<=1){
            
            return nums.length;
            
        }
        
        int len = 1;
        
        for(int i=1;i<nums.length;i++){
            
            if(nums[i]!=nums[i-1]){
                
                nums[len] = nums[i];
                
                len++;
                
            }
            
        }
        
        return len;
        
    }
}


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/lihaitao000/article/details/51558121
个人分类: LeetCode
上一篇21. Merge Two Sorted Lists
下一篇27. Remove Element
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭