#2605

Form Smallest Number From Two Digit Arrays

pupil · 420 · lc easy +25 · verified · 55% accepted · 328 likes · top 48%

Description

Given two arrays of distinct digits nums1 and nums2, return the smallest positive integer whose decimal digits include at least one digit from nums1 and at least one digit from nums2.

Example 1:

Input: nums1 = [4,1,3], nums2 = [5,7]

Output: 15

Explanation: The number 15 contains the digit 1 from nums1 and the digit 5 from nums2. It can be proven that 15 is the smallest number we can have.

Example 2:

Input: nums1 = [3,5,2,6], nums2 = [3,1,7]

Output: 3

Explanation: The number 3 contains the digit 3 which exists in both arrays.

Code

1

2

3

class Solution:
    def minNumber(self, nums1: List[int], nums2: List[int]) -> int:

class Solution:
    def minNumber(self, nums1: List[int], nums2: List[int]) -> int: