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
|
#!/usr/bin/env python3
# Challenge 071
#
# TASK #1 > Peak Element
# Submitted by: Mohammad S Anwar
# You are given positive integer $N (>1).
#
# Write a script to create an array of size $N with random unique elements
# between 1 and 50.
#
# In the end it should print peak elements in the array, if found.
#
# An array element is called peak if it is bigger than it's neighbour.
#
# Example 1
# Array: [ 18, 45, 38, 25, 10, 7, 21, 6, 28, 48 ]
# Peak: [ 48, 45, 21 ]
# Example 2
# Array: [ 47, 11, 32, 8, 1, 9, 39, 14, 36, 23 ]
# Peak: [ 47, 32, 39, 36 ]
import sys
def peek_elem(n):
out = []
if len(n) < 2:
return out
if n[0] > n[1]:
out.append(n[0])
for i in range(1, len(n) - 1):
if n[i] > n[i-1] and n[i] > n[i+1]:
out.append(n[i])
if n[-1] > n[-2]:
out.append(n[-1])
return out
n = list(map(int, sys.argv[1:]))
print(", ".join(map(str, peek_elem(n))))
|
