Create smallest-missing-positive.py

finds the smallest missing positive integer in a sequence

smallest-missing-positive.py

@@ -0,0 +1,16 @@
+class Solution(object):
+    def firstMissingPositive(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: int
+        """
+        smallest = 1
+        num_dict = {}
+        for num in nums:
+            num_dict[num] = 1
+        while smallest < 2147483648:
+            if smallest not in num_dict:
+                return smallest
+            smallest += 1
+        #return 
+