20190827滴滴测试开发笔试编程题

第一题：项目分配的问题。

n,m= 3,3
nums = [[1,3,3],[2,2,2],[3,2,1]]

new_nums = [[] for i in range(m)]
for i in range(n):
    for j in range(m):
        new_nums[j].append(nums[i][j])

max_ = 0
for i in range(m):
    max_ += max(new_nums[i])

print(max_)

第二题：正多变形的问题

n = 6
nums = [1,-2,3,5,6,2]

res = []
# 子阵的长度是原始阵列的约数
for i in range(3,n//2+1):
    if n%i ==0:
        res.append(i)

m = len(res)
max_ = sum(nums)
# 遍历每一个子阵
for i in range(m):
    r = res[i] # 子阵的长度
    h = n//res[i]  # 间隔
    for j in range(0, h):
        tmp = 0
        for k in range(j, n, h):
            tmp += nums[k]

        max_ = max(tmp, max_)

print(max_)

虽然编程题全a了，可是选择题做得稀烂~