4011. Smallest Absent Positive Greater Than Average¶

4011. Smallest Absent Positive Greater Than Average

Easy

You are given an integer array nums.

Return the smallest absent positive integer in nums such that it is strictly greater than the average of all elements in nums.

The average of an array is defined as the sum of all its elements divided by the number of elements.

Example 1:

Example 2:

Example 3:

Constraints:

• 1 <= nums.length <= 100
• -100 <= nums[i] <= 100​​​​​​​

Solution¶

class Solution {
    public int smallestAbsent(int[] nums) {
        int n = nums.length;
        int sum = 0;
        HashSet<Integer> set = new HashSet<>();
        for (int ele : nums) {
            set.add(ele);
            sum += ele;
        }
        int idx = 1;
        while (true) {
            if (idx * n > sum) {
                if (set.contains(idx)) {
                    idx++;
                    continue;
                }
                return idx;
            }
            idx++;
        }
    }
}

Complexity Analysis¶

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

Explanation¶

[Add detailed explanation here]