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.

Subscribe to see which companies asked this question

二、解题思路：

思路1：

我的编程能力非常弱，沮丧。。。。。。只是easy题而已。

（1）删除重复元素时，将最后一个元素与前面的元素依次比较，相同则删除，如果从前往后比较，删掉后，循环下标将会出问题。

（2）还是没搞懂，为什么我不加第一条数组为空的判断语句会超时。

思路2：

（1）倒着遍历数组，若当前元素与其前一个元素的值不同，计数加1；否则，将后续元素前移。

（2）注意当数组为空的情况。

三、源码：

1、

public class Solution 
{
    public int removeDuplicates(int[] nums)
    {
      if (nums.length == 0) return 0;
      int count = nums.length; 
      for (int i = nums.length - 1; i > 0; i --)
      {
    	  for (int j = 0; j < i; j ++)
    	  {
    		  if (nums[i] == nums[j]) {remove(nums,i,count); count--; break;}
    	  }
      }
      return count;
    }
    public void remove(int[] num, int q, int c)
    {
    	for (int i = q; i < c - 1; i++)
    	{
    		num[i] = num[i + 1];
    	}
    	     
    }
    public static void main(String args[])
    {
    	int[] a = {};
    	Solution solution = new Solution();
    	System.out.println(solution.removeDuplicates(a));
    }
}

2、

import java.util.ArrayList;
import java.util.Arrays;


public class Solution  
{  
	public int removeDuplicates(int[] nums) 
	{
	  if (nums.length == 0) return 0;
	  int count = 1;
      for (int i = nums.length - 1; i > 0; i--)
    	  if (nums[i] != nums[i-1]) count++;
    	  else 
    	  {
    		  for (int j = i; j < nums.length - 1; j++)
    			  nums[j] = nums[j+1];
    	  }
      return count;
    }
	
    public static void main(String args[])      
    {      
             
    	
    	int[] nums = {1,1,2};
    	//String word = "ABfS";
        Solution solution = new Solution();     
        System.out.print(solution.removeDuplicates(nums)); 
    }      
}