leetCode--Remove Duplicates from Sorted Array

标签：from   oca   指针   nbsp   should   with   leave   选项   duplicate   

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 by modifying the input array in-place with O(1) extra memory.

Example:

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.
/*
　　由于数组已经排好序，设置i，j两个指针
　　如果nums[j]等于nums[i]则让j++跳过重复选项
　　如果nums[j]不等于i，则i++，将nums[j]赋给nums[i]
　　重复此过程
*/
class Solution {
    public int removeDuplicates(int[] nums) {
       int i = 0;
       for(int j = 1;j < nums.length;j++){
           if(nums[j] != nums[i]){
               i++;
               nums[i] = nums[j];
           }
       }
       return i + 1;
    }
}

leetCode--Remove Duplicates from Sorted Array

标签：from   oca   指针   nbsp   should   with   leave   选项   duplicate   

原文地址：http://www.cnblogs.com/kevincong/p/7801949.html