我们如何在不使用集合的情况下优化数组中的重复删除？

public static int[] improvedRemoveDuplicates(int[] arr) {

    int uniqueCount = 0;
    boolean[] exists = new boolean[arr.length]; // Flag to track unique elements

    for (int i = 0; i < arr.length; i++) {
        if (!exists[i]) {  // Check if element is not already unique
            arr[uniqueCount] = arr[i];
            exists[i] = true;
            uniqueCount++;
        }
    }

    int[] uniqueArray = new int[uniqueCount];
    for (int i = 0; i < uniqueCount; i++) {
        uniqueArray[i] = arr[i];
    }
    return uniqueArray;
}