网易算法笔试

import numpy as np

def func1(a):
n, m = a.shape
if n == 2:
a = a.reshape(-1)
a = a.tolist()
a.sort()
return a[1]
l = []
for i in range(0, n, 2):
for j in range(0, m, 2):
li = [a[i][j], a[i + 1][j], a[i][j + 1], a[i + 1][j + 1]]
li.sort()
l.append(li[1])
matrix = np.array(l)
matrix = matrix.reshape((n // 2, m // 2))
return func1(matrix)

def func2(min_num,max_num):
li = []
length = max_num-min_num
for i in range(length+1):
res = i + min_num
if ‘6’ in str(res) and ‘8’ in str(res):
li.append(res)
return li,len(li)

if name == “main”:
#第一题
# a = [[4,0,0,0,0,0,0,0], [5, 6, 7, 8, 0, 5, 3, 4], [9, 10, 11, 12, 3, 7, 0, 2], [13, 10, 8, 6, 4, 15, 0, 16],
# [3,2,1,2,4,2,4,5],[3,4,5,2,6,3,2,8],[9,12,4,23,9,3,4,5],[3,4,1,2,6,1,10,30]]
# print(a)
# print(type(a))
# b = np.array(a)
# res = func1(b)
# print(res)

#第二题
min_num = 600
max_num = 699
res,l = func2(min_num,max_num)
print(res,l)