package algorithm;
//【026-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.
题目大意
给定一个排序的数组,将数组中的重复元素去掉,相同的只保留一个,并且返回数组新的元素个数,不要创建一个新的数组来保存结果。在常量时间内解决这个问题
解题思路
从第二个元素开始处理,记为当前处理的元素,如果当前元素与他的前一个元素相同就删除这个元素,如果不同就将它移动到正确的位置,返回最后数组元素人个数。
*/
public class RemoveDuplicates {
public class Node{
int value;
Node nextNode;
public Node(int value) {
this.value=value;
nextNode=null;
}
}
public Node createNode(int[] tmp){
if(tmp==null)
return null;
Node root=null;
Node first=null;
for(int i=0;i<tmp.length;i++){
Node tmpNode=new Node(tmp[i]);
if(i==0){
first=tmpNode;
root=tmpNode;
}else{
root.nextNode=tmpNode;
root=tmpNode;
}
}
return first;
}
public int removeDuplicates(Node node){
if(node==null){
return 0;
}
int sum=1;
Node root=node;
Node nextNode=node.nextNode;
while(nextNode!=null){
int lastValue=node.value; //上一个的值
int now=nextNode.value;//现在的值
if(now!=lastValue){//不同,则继续
sum++;
node=nextNode;
nextNode=nextNode.nextNode;
}else{//这个和上一个同,则删除
node.nextNode=nextNode.nextNode;
nextNode=nextNode.nextNode;
}
}
node=root;
return sum;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
//int[] ints={1,1,1,2,3,4,4,5};
int[] ints={1};
Node node=new RemoveDuplicates().createNode(ints);
int length=new RemoveDuplicates().removeDuplicates(node);
System.out.println("长度="+length);
}
}