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

解答:

c语言

int removeDuplicates(int* nums, int numsSize) 
{
    if(numsSize==0 || numsSize==1)
    return numsSize;
    
    
    int i,count=0;
    for(i=1;i<numsSize;i++)
    {
        if(nums[i]==nums[i-1])
        {
            count++;          
        }
        
        if(count)
        {
            nums[i-count]=nums[i];
        }       
    }   
    return numsSize-count;
    
}


阅读更多
个人分类: leetcode
上一篇leetcode 24. Swap Nodes in Pairs
下一篇leetcode 25. Reverse Nodes in k-Group
想对作者说点什么? 我来说一句

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

关闭
关闭