Java 有没有更快的方法在N个容器中删除重复项

假设我们有三排水果.每个数组都有不同的项，但有些项在多个数组中重复.我想删除重复项，以便数组只包含唯一项.

之前:

arrayA = {"lychee", "orange", "grape", "watermelon"};
arrayB = {"banana", "grape", "pear", "apple"};
arrayC = {"pear", "orange", "strawberry", "apple"};

之后:

arrayA = {"lychee", "watermelon"}
arrayB = {"banana"}
arrayC = {"strawberry"}

我已经编写了以下Java代码，它可以工作，但我想知道是否有更快的算法.

编辑:我简化了Java代码并添加了文档.我想知道如何使算法更高效，并降低时间复杂度.

这是伪代码版本:

    declare method [@name=removeDuplicates] [@params={@name=NItems, @type=String-Matrix/Set-List}]:
        declare a variable [@name=MapList, @type=List[item:HashMap[key:String, value:Number]]] assign List.@new
        iterate NItems with @[index, element]:
            declare a variable [@name=nmap, @type=HashMap[key:String, value:Number]] assign HashMap.@new
            for each @[item] in @element, put [key:@item, value:0] to @[name=nmap]
            reference @[name=MapList][@index] to @[name=nmap]
        declare a variable [@name=result] with the same type of @NItems
        iterate NItems with @[index, element]:
            iterate MapList with @[mapIndex, mapElement] where @index != @mapIndex:
                iterate @element with @[item]:
                    if @mapElement[@mapIndex] contains the [key:@item]:
                        set the corresponding map @MapList[@index] update [key:@item, value:@old+1]
            set @result[@index] values: items from @MapList[@index] where it's value == 0
        return @result

这是Java代码版本:

    /**
     * Remove duplicate items among N container
     * @param arrays list of item container, each container contains no duplicates,
     *               and the container is unordered internally, which can be considered as a Set
     * @return N containers after remove duplicates
     */
    @SuppressWarnings("unchecked")
    public static String[][] removeDuplicates(String[]... arrays) {
        Map<String, Integer>[] maps = new Map[arrays.length];
        for (int i = 0; i < arrays.length; i++) {
            maps[i] = new HashMap<>();
            for (String itm : arrays[i]) {
                maps[i].put(itm, 0);
            }
        }
        String[][] result = new String[arrays.length][];
        for (int i = 0; i < arrays.length; i++) {
            for (int j = 0; j < maps.length; j++) {
                if (j == i)
                    continue;
                for (String s : arrays[i]) {
                    if (maps[j].containsKey(s))
                        maps[i].compute(s, (_, v) -> v + 1);
                }
            }
            int finalI = i;
            result[i] = Arrays.stream(arrays[i])
                    .filter(itm -> maps[finalI].get(itm) < 1)
                    .toArray(String[]::new);
        }
        return result;
    }