4080. Smallest Missing Multiple Of K¶

4080. Smallest Missing Multiple of K

Easy

Given an integer array nums and an integer k, return the smallest positive multiple of k that is missing from nums.

A multiple of k is any positive integer divisible by k.

Example 1:

Example 2:

Constraints:

• 1 <= nums.length <= 100
• 1 <= nums[i] <= 100
• 1 <= k <= 100

Solution¶

class Solution {
    public int missingMultiple(int[] nums, int k) {
        int n = nums.length;
        HashSet<Integer> set = new HashSet<>();
        for (int ele : nums)
            set.add(ele);
        int curr = k; 
        while (true) {
            if (!set.contains(curr))
                return curr;
            curr += k;
        }
    }
}

Complexity Analysis¶

• Time Complexity: O(?)
• Space Complexity: O(?)

Explanation¶

[Add detailed explanation here]