-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathpickingNumbers.py
More file actions
44 lines (34 loc) · 838 Bytes
/
pickingNumbers.py
File metadata and controls
44 lines (34 loc) · 838 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#!/bin/python3
import math
import os
import random
import re
import sys
#
# Complete the 'pickingNumbers' function below.
#
# The function is expected to return an INTEGER.
# The function accepts INTEGER_ARRAY a as parameter.
#
def pickingNumbers(a):
# Write your code here
count = []
a.sort()
maximum = 0
for i in range(len(a)-1, -1, -1):
count = 1
for j in range(i-1, -1 , -1):
if (a[i]-a[j]) < 2:
count+=1
if count > maximum:
maximum = count
else:
maximum = maximum
return maximum
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
n = int(input().strip())
a = list(map(int, input().rstrip().split()))
result = pickingNumbers(a)
fptr.write(str(result) + '\n')
fptr.close()