349. Intersection of Two Arrays

最新推荐文章于 2025-09-05 16:34:31 发布

weixin_34337381

最新推荐文章于 2025-09-05 16:34:31 发布

阅读量52

点赞数

CC 4.0 BY-SA版权

文章标签：移动开发

原文链接：http://www.cnblogs.com/johnnyzhao/p/10264160.html

本文提供了一种解决LeetCode第349题两个数组的交集的方法，使用Kotlin编程语言实现。通过先排序再双指针遍历的方式，高效地找到两个数组中的共同元素，并确保结果中每个元素的唯一性。

/**
 * 349. Intersection of Two Arrays
 * https://leetcode.com/problems/intersection-of-two-arrays/description/

Example 1:

Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2]

Example 2:

Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [9,4]

Note:

Each element in the result must be unique.
The result can be in any order.

Kotlin version
 * */

fun intersection(num1: IntArray, num2: IntArray): IntArray {
        num1.sort();
        num2.sort();
        var index1 = 0;
        var index2 = 0;
        var map = HashMap<Int, Int>();
        while (index1 < num1.size && index2 < num2.size) {
            if (num1[index1] < num2[index2])
                index1++;
            else if (num1[index1] > num2[index2])
                index2++;
            else {
                if (map.get(num2[index2]) == null)
                    map.put(num2[index2], num2[index2]);
                index1++;
                index2++;
            }
        }
        var totalIndex = 0;
        var result = IntArray(map.size);
        map.forEach { (key, value) ->
            result.set(totalIndex, key);
            totalIndex++;
        };
        return result;
    }

转载于:https://www.cnblogs.com/johnnyzhao/p/10264160.html