Smallest Missing Number
Given a list of numbers, write a program to print the smallest positive integer missing in the given numbers.
Input
The input will be a single line containing numbers separated by space.
Output
The output should be a single line containing the smallest missing number from given numbers.
Explanation
For example, if the input numbers are 3, 1, 2, 5, 3, 7, 7.
The number 1, 2, 3 are present. But the number 4 is not. So 4 is the smallest positive integers that is missing from the given numbers.
Sample Input 1
3 1 2 5 3 7 7
Sample Output 1
4
Sample Input 2
5 5 2 3 1 8 8 4
Sample Output 2
6
import sys
if len(sys.argv) > 1:
nums = sys.argv[1:]
else:
nums = input().split(" ")
nums.sort()
if int(nums[0]) > 1:
print("1")
else:
for k in range(0, len(nums)-1):
if int(nums[k+1]) > int(nums[k])+1:
print(int(nums[k])+1)
sys.exit()
print(int(nums[-1])+1)
Comments
Leave a comment