# coding=utf-8
import unittest

"""41. First Missing Positive
https://leetcode.com/problems/first-missing-positive/description/

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

**Example 1:**

    
    
    Input: [1,2,0]
    Output: 3
    

**Example 2:**

    
    
    Input: [3,4,-1,1]
    Output: 2
    

**Example 3:**

    
    
    Input: [7,8,9,11,12]
    Output: 1
    

**Note:**

Your algorithm should run in _O_ ( _n_ ) time and uses constant extra space.


Similar Questions:
  Missing Number (missing-number)
  Find the Duplicate Number (find-the-duplicate-number)
  Find All Numbers Disappeared in an Array (find-all-numbers-disappeared-in-an-array)
  Couples Holding Hands (couples-holding-hands)
"""


class Solution(object):
    def firstMissingPositive(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        

    def test(self):
        pass


if __name__ == "__main__":
    unittest.main()
