leetcode -- Remove Duplicates from Sorted Array

Remove Duplicates from Sorted Arrayapp

Given a sorted array, remove the duplicates in-place such that each element appear only once and return the new length.this

Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.spa

Example:code

Given 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.

Solution:ip

class Solution {
    public int removeDuplicates(int[] nums) {
    if(nums == null || nums.length==0)  
        return 0;  
    int index = 1;  
    for(int i=1;i<nums.length;i++)  
    {  
        if(nums[i]!=nums[i-1])  
        {  
            nums[index]=nums[i];  
            index++;  
        }  
    }  
    return index;  
    }
}
相關文章
相關標籤/搜索