LC.P2605[从两个数字数组里生成最小数字]

发表于2023-09-05|更新于2023-09-05|LeetCode

|字数总计:128|阅读时长:1分钟|阅读量:

方法一：哈希表

class Solution {
    public int minNumber(int[] nums1, int[] nums2) {
        boolean[] s1 = new boolean[10], s2 = new boolean[10];
        for (int x : nums1) s1[x] = true;
        for (int x : nums2) s2[x] = true;
        int a = 0, b = 0;
        for (int i = 1; i < 10; ++i) {
            if (s1[i] & s2[i]) return i;
            if (a == 0 && s1[i]) a = i;
            if (b == 0 && s2[i]) b = i;
        }
        return Math.min(a * 10 + b, b * 10 + a);
    }
}