标签:dem util blog 代码 int 清除 als lag 记录
定义一个函数清除该数组的重复元素,返回一个不能浪费长度的数组.
代码如下:
import java.util.*; public class demo1 { public static void main(String[] args) { int[] arr = {11, 2, 4, 2, 10, 11}; arr = clearRepeat(arr); System.out.println("清除重复元素的数组:" + Arrays.toString(arr)); } public static int[] clearRepeat(int[] arr) { int count = 0;// 记录重复元素个数 for (int i = 0; i < arr.length - 1; i++) { for (int j = i + 1; j < arr.length; j++) { if (arr[i] == arr[j]) { count++; break; } } } int newLength = arr.length - count; int[] newArr = new int[newLength]; int index = 0; for (int i = 0; i < arr.length; i++) { int temp = arr[i]; boolean flag = false; for (int j = 0; j < newArr.length; j++) { if (temp == newArr[j]) { flag = true; break; } } if (flag == false) { newArr[index++] = temp; } } return newArr; } }
import java.util.*; public class demo1 { public static void main(String[] args) { int[] arr = {11, 2, 4, 2, 10, 11}; arr = clearRepeat(arr); System.out.println("清除重复元素的数组:" + Arrays.toString(arr)); } public static int[] clearRepeat(int[] arr) { int count = 0;// 记录重复元素个数 for (int i = 0; i < arr.length - 1; i++) { for (int j = i + 1; j < arr.length; j++) { if (arr[i] == arr[j]) { count++; break; } } } int newLength = arr.length - count; int[] newArr = new int[newLength]; int index = 0; for (int i = 0; i < arr.length; i++) { int temp = arr[i]; boolean flag = false; for (int j = 0; j < newArr.length; j++) { if (temp == newArr[j]) { flag = true; break; } } if (flag == false) { newArr[index++] = temp; } } return newArr; } }
标签:dem util blog 代码 int 清除 als lag 记录
原文地址:http://www.cnblogs.com/Liang-Haishan216/p/6181844.html