The smallest missing positive integer should be returned from an unsorted integer array called nums. You must build an algorithm that requires constant additional space and runs in O(n) time.

The smallest missing positive integer should be returned from an unsorted integer array called nums. You must build an algorithm that requires constant additional space and runs in O(n) time.

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: easy

标签: interviewbit, maq, company-specific

目标公司: MAQ Software

参考答案摘要

Example 1: Input: nums = [1,2,0] Output: 3 Example 2: Input: nums = [3,4,-1,1] Output: 2 Example 3: Input: nums = [7,8,9,11,12] Output: 1 Solution: Cycle sort is an unstable in-place sorting algorithm...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。