26. Remove Duplicates from Sorted Array(移除有序数组中的重复元素)

来源:互联网 发布:logo设计软件app 编辑:程序博客网 时间:2024/05/17 05:11

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


0 0
原创粉丝点击