iOYES iOYES

아래 문제는 코딜리티에서 제공하는 MissingInteger의 문제입니다🧑🏻‍💻 문제 제시 This is a demo task. Write a function: public func solution(_ A : inout [Int]) -> Int that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A. For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5. Given A = [1, 2, 3], the function should return 4. Given A = [−1, −3]..