两个String数组合并去重，不能使用集合和自带的排序

package com.example.demo1.service.impl;

import java.util.*;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.atomic.AtomicInteger;

public class Test {


        public static void main(String[] args) {
           String[]a=new String[]{"张三","李四","王五"};
           String[]b=new String[]{"赵六","老八","李四","小红","王五"};
           //创建合并数组
           String []ans=new String[a.length+b.length];
            //把A数组放入
            int aLen=a.length;
            for (int j = 0; j < aLen; j++) {
                ans[j]=a[j];
            }
            //把B数组放入
            for (int i = 0; i <b.length ; i++) {
                ans[i+aLen]=b[i];
            }
            //冒泡排序数组
            sort(ans);
            //创建新的数组 去重复
            String []res=new String[ans.length];
            //前缀
            String pre="";
            for (int i = 0; i < ans.length; i++) {
                //如果和前面的不匹配 则放入新数组中
                if(!pre.equals(ans[i])){
                    pre=ans[i];
                    res[i]=ans[i];
                }
            }
            //[小红, 张三, 李四, null, 王五, null, 老八, 赵六]
            System.out.println(Arrays.toString(res));


        }


        //冒泡排序
        public static void sort(String[]ans){
            int len=ans.length;
            for (int i = 0; i < len; i++) {
                for (int j = 0; j < len-i-1; j++) {
                    if(ans[j].compareTo(ans[j+1])>0){
                        //交换位置
                        String temp=ans[j];
                        ans[j]=ans[j+1];
                        ans[j+1]=temp;
                    }
                }
            }

        }


}