First Missing Positive || Intuition + Example + Explanation || Must Do for Amazon
26.7 هزار بار بازدید -
3 سال پیش
-
Given an unsorted integer array
Given an unsorted integer array nums, return the smallest missing positive integer.
You must implement an algorithm that runs in O(n) time and uses constant extra space.
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
You must implement an algorithm that runs in O(n) time and uses constant extra space.
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
3 سال پیش
در تاریخ 1400/05/12 منتشر شده
است.
26,703
بـار بازدید شده