https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/
题目描述: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) {
int length=nums.length;
//考虑数组长度为0的情况
if(length==0){
return 0;
}
int[] array=new int[length];
int count=0;
array[0]=nums[0];
//将不重复的元素保存到新的数组中
for(int i=1;i<length;i++){
if(nums[i-1]!=nums[i]){
array[++count]=nums[i];
}
}
for(int i=0;i<=count;i++){
nums[i]=array[i];
}
return (count+1);
}
}