Intersection of Two Arrays

Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any order.

LeetCode Problem - 349

class Solution {
    // This method finds the intersection of two arrays `nums1` and `nums2`.
    public int[] intersection(int[] nums1, int[] nums2) {
        // ArrayList to store the intersection elements
        ArrayList<Integer> al = new ArrayList<>();

        // Nested loop to compare each element of nums1 with each element of nums2
        for (int num1 : nums1) {
            for (int num2 : nums2) {
                // If an element is found in both arrays and not already in the intersection list, add it to the list
                if (num1 == num2 && !(al.contains(num1))) {
                    al.add(num1);
                }
            }
        }

        // Convert the ArrayList to an array
        int[] ans = new int[al.size()];
        for (int i = 0; i < ans.length; i++) {
            ans[i] = al.get(i);
        }

        // Return the intersection array
        return ans;
    }
}