7-4 Remove duplicates (10分)

兜兜转转，又是一道数组去重

.util.*;


public class Main{
    public static int[] delete(int[] array){
        int len = array.length;
        int j = 0;
        int flag = 0;       //没找到相同的
        int[] rtn = new int[len];
        for (int i = 0; i < len; i++){
            for (int k = 0; k < len; k++){
                if (array[i] == rtn[k]){
                    flag = 1;   //结果数组中已经有了
                    break;
                }
            }
            if (flag == 0){     //结果数组中没有，存入结果数组。
                rtn[j++] = array[i];
            }
            flag = 0;           //一定要记得重置
        }
        int[] ans = new int[j];
        for (int i = 0; i < j; i++){
            ans[i] = rtn[i];
        }

        return ans;
    }
    public static void main(String[] args){
        Scanner input = new Scanner(System.in);
        int num = input.nextInt();
        int[] array = new int[num];
        for (int i = 0; i < num; i++){
            array[i] = input.nextInt();
        }
        int[] ans = Main.delete(array);
//         System.out.print(ans[0]);
        for (int i = 0; i < ans.length; i++){
            System.out.print(ans[i] + " ");
        }
    }
}