Merge pull request doocs#117 from ashwek/sol

0066 Plus One - Python / 0041 First Missing Positive - C

Author: yanglbme

solution/0041.First Missing Positive/Solution.c

@@ -0,0 +1,22 @@
+int firstMissingPositive(int* nums, int numsSize) {
+    
+    int Max = nums[0], i, *Count;
+    
+    for(i = 1; i<numsSize; i++){
+        Max = (Max < nums[i]) ? nums[i] : Max;
+    }
+    
+    Count = (int*)calloc(Max+1, sizeof(int));
+    for(i = 0; i<numsSize; i++){
+        if(nums[i] > 0){
+            Count[nums[i]]++;
+        }
+    }
+    
+    i = 1;
+    while(Count[i] != 0){
+        i++;
+    }
+    
+    return i;
+}

solution/0066.Plus One/Solution.py

@@ -0,0 +1,20 @@
+class Solution:
+    def plusOne(self, digits):
+        """
+        :type digits: List[int]
+        :rtype: List[int]
+        """
+        
+        i = len(digits)-1
+        digits[i] += 1
+        
+        while i > 0 and digits[i] > 9 :
+            digits[i] = 0
+            i -= 1
+            digits[i] += 1
+        
+        if digits[0] > 9:
+            digits[0] = 0
+            digits.insert(0, 1)
+        
+        return digits

solution/0066.Plus One/Solution2.py

@@ -0,0 +1,8 @@
+class Solution:
+    def plusOne(self, digits):
+        """
+        :type digits: List[int]
+        :rtype: List[int]
+        """
+        
+        return list(map(int, str(int("".join(map(str, digits)))+1)))