7.设计算法,在数组r[四中删除重复的元素,要求移动元素的次数较少并使剩余元素的相对次序保持不变
package thirdChapter;
import java.util.ArrayList;
import java.util.Scanner;
public class DeleteRepeated {
public void deleteRepeated(int[] arr) {
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < i; j++) {
if (arr[i] == arr[j]) {
arr[i] = 100000000; //赋值一个不存在的值
}
}
}
for (int i = 0; i < arr.length; i++) {
if(arr[i] != 100000000) {
System.out.println(arr[i] + " ");
}
}
}
public static void main(String[] args) {
int[] arr = {1, 4, 2, 1, 2, 3 ,6, 7};
DeleteRepeated dRepeated = new DeleteRepeated();
dRepeated.deleteRepeated(arr);
}
}