LeetCode in Kotlin
448. Find All Numbers Disappeared in an Array
Easy
Given an array nums of n integers where nums[i] is in the range [1, n], return an array of all the integers in the range [1, n] that do not appear in nums.
Example 1:
Input: nums = [4,3,2,7,8,2,3,1]
Output: [5,6]
Example 2:
Input: nums = [1,1]
Output: [2]
Constraints:
n == nums.length1 <= n <= 1051 <= nums[i] <= n
Follow up: Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space.
Solution
class Solution {
fun findDisappearedNumbers(nums: IntArray): List<Int> {
val arr = IntArray(nums.size)
var counter = 0
for (i in nums.indices) {
arr[nums[counter] - 1] = 1
counter++
}
val res: MutableList<Int> = ArrayList()
for (i in arr.indices) {
if (arr[i] == 0) {
res.add(i + 1)
}
}
return res
}
}