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
45
46
47
48
49
50
51
|
#!/usr/bin/env python3
# Challenge 073
#
# TASK #2 > Smallest Neighbour
# Submitted by: Mohammad S Anwar
# You are given an array of integers @A.
#
# Write a script to create an array that represents the smallest element to
# the left of each corresponding index. If none found then use 0.
#
# Example 1
# Input: @A = (7, 8, 3, 12, 10)
# Output: (0, 7, 0, 3, 3)
#
# For index 0, the smallest number to the left of $A[0] i.e. 7 is none, so we
# put 0.
# For index 1, the smallest number to the left of $A[1] as compare to 8, in
# (7) is 7 so we put 7.
# For index 2, the smallest number to the left of $A[2] as compare to 3, in
# (7, 8) is none, so we put 0.
# For index 3, the smallest number to the left of $A[3] as compare to 12, in
# (7, 8, 3) is 3, so we put 3.
# For index 4, the smallest number to the left of $A[4] as compare to 10, in
# (7, 8, 3, 12) is 3, so we put 3 again.
#
# Example 2
# Input: @A = (4, 6, 5)
# Output: (0, 4, 4)
#
# For index 0, the smallest number to the left of $A[0] is none, so we put 0.
# For index 1, the smallest number to the left of $A[1] as compare to 6, in
# (4) is 4, so we put 4.
# For index 2, the smallest number to the left of $A[2] as compare to 5, in
# (4, 6) is 4, so we put 4 again.
import sys
def smallest_left(a):
smallest = [0]
for i in range(1, len(a)):
min_ = min(a[:i])
if min_ < a[i]:
smallest.append(min_)
else:
smallest.append(0)
return smallest
A = list(map(int, sys.argv[1:]))
smallest = smallest_left(A)
print(", ".join([str(x) for x in smallest]))
|
