LeetCode 41: First Missing Positive

Source: Internet
Author: User

LeetCode 41: First Missing Positive

Given an unsorted integer array, find the first missing positive integer.

For example,
Given[1, 2, 0]Return3,
And[3, 4,-1, 1]Return2.

Your algorithm shocould run in O (n) time and uses constant space.

 

// Similar to bucket sorting, swap array elements so that the I-th digit in the array stores the value (I + 1); // finally traverse the array to find the first element that does not meet this requirement, returns its subscript. The whole process involves traversing two frequency groups with the complexity of O (n ). Class Solution {public: int firstMissingPositive (vector

 
  
& Nums) {int n = nums. size (); for (int I = 0; I <n; ++ I) {while (nums [I]> 0 & nums [I] <n & nums [nums [I]-1]! = Nums [I]) swap (nums [nums [I]-1], nums [I]) ;}for (int I = 0; I <n; ++ I) {if (nums [I]! = I + 1) return I + 1;} return n + 1 ;}};

 


 

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.