LeetCode in Kotlin

3678. 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:

Input: nums = [3,5]

Output: 6

Explanation:

• The average of nums is (3 + 5) / 2 = 8 / 2 = 4.
• The smallest absent positive integer greater than 4 is 6.

Example 2:

Input: nums = [-1,1,2]

Output: 3

Explanation:

• The average of nums is (-1 + 1 + 2) / 3 = 2 / 3 = 0.667.
• The smallest absent positive integer greater than 0.667 is 3.

Example 3:

Input: nums = [4,-1]

Output: 2

Explanation:

• The average of nums is (4 + (-1)) / 2 = 3 / 2 = 1.50.
• The smallest absent positive integer greater than 1.50 is 2.

Constraints:

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

Solution

class Solution {
    fun smallestAbsent(nums: IntArray): Int {
        var sum = 0
        for (j in nums) {
            sum += j
        }
        val avg = sum.toDouble() / nums.size
        var num: Int
        if (avg < 0) {
            num = 1
        } else {
            num = avg.toInt() + 1
        }
        while (true) {
            var flag = false
            for (j in nums) {
                if (num == j) {
                    flag = true
                    break
                }
            }
            if (!flag && num > avg) {
                return num
            }
            num++
        }
    }
}

This site is open source. Improve this page.