Form Smallest Number From Two Digit Arrays

Given two arrays of unique digits nums1 and nums2, return thesmallestnumber that containsat leastone digit from each array.

LeetCode Problem - 2605

class Solution {
    public int minNumber(int[] nums1, int[] nums2) {

        // Sort both arrays to ensure elements are in ascending order
        Arrays.sort(nums1);
        Arrays.sort(nums2);

        // Iterate through both arrays to find a common element
        for (int i = 0; i < nums1.length; i++) {
            for (int j = 0; j < nums2.length; j++) {
                // If a common element is found, return it immediately
                if (nums1[i] == nums2[j]) return nums2[j];
            }
        }

        // If no common element is found, create two possible numbers
        // by combining the smallest elements from both arrays in different orders
        int type1 = Integer.parseInt(nums1[0] + "" + nums2[0]);
        int type2 = Integer.parseInt(nums2[0] + "" + nums1[0]);

        // Return the smaller of the two possible numbers
        return Math.min(type1, type2);
    }
}