-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathalgoSolver.py
39 lines (37 loc) · 1.24 KB
/
algoSolver.py
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
def consequetiveMedian(arr):
ans = ''
window = arr[0]
arr.pop(0)
length = len(arr)
for i in range(length):
temp = []
if(window-1 > i):
for j in range(i):
temp.append(arr[j])
if(i == 0):
median = str(arr[i]) + str(arr[i])
ans += median
elif(len(temp) % 2 != 0):
median = str(arr[j]) + str(temp[len(temp)//2])
ans += median
else:
median = str(
arr[j]) + str((temp[len(temp)//2] + temp[len(temp)//2 + 1]) / 2)
ans += median
temp = []
else:
start = i - (window-1)
for j in range(start, i+1):
temp.append(arr[j])
if(i ==0):
median = str(arr[i]) + str(arr[i])
ans += median
elif(len(temp) % 2 != 0):
median = str(arr[j]) + str(temp[len(temp)//2])
ans += median
else:
median = str(arr[j]) + str((temp[len(temp)//2] + temp[len(temp)//2 +1]) / 2)
ans += median
temp = []
return ans
print(consequetiveMedian([1,2,4]))