標籤: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; }}
Java 清除數組相同元素