Package g2201_2300.s2215_find_the_difference_of_two_arrays

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2215 - Find the Difference of Two Arrays\.

    Easy

    Given two 0-indexed integer arrays nums1 and nums2, return a list answer of size 2 where:

    • answer[0] is a list of all distinct integers in nums1 which are not present in nums2.

    • answer[1] is a list of all distinct integers in nums2 which are not present in nums1.

    Note that the integers in the lists may be returned in any order.

    Example 1:

    Input: nums1 = 1,2,3, nums2 = 2,4,6

    Output: [1,3,4,6]

    Explanation:

    For nums1, nums11 = 2 is present at index 0 of nums2, whereas nums10 = 1 and nums12 = 3 are not present in nums2. Therefore, answer0 = 1,3.

    For nums2, nums20 = 2 is present at index 1 of nums1, whereas nums21 = 4 and nums22 = 6 are not present in nums2. Therefore, answer1 = 4,6.

    Example 2:

    Input: nums1 = 1,2,3,3, nums2 = 1,1,2,2

    Output: [3,[]]

    Explanation:

    For nums1, nums12 and nums13 are not present in nums2. Since nums12 == nums13, their value is only included once and answer0 = 3.

    Every integer in nums2 is present in nums1. Therefore, answer1 = [].

    Constraints:

    • 1 <= nums1.length, nums2.length <= 1000

    • -1000 <= nums1[i], nums2[i] <= 1000

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final List<List<Integer>> findDifference(IntArray nums1, IntArray nums2)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait