广联达笔试20190819

#!/usr/bin/env python
# coding: utf-8

code 1
# # 求第k小的数据，分治法


code 2
# # 2个数组，交换一个元素，使得2个数组求和相等
代码：
def arrayequal(array1,array2):
    diff = int((sum(array2)-sum(array1))/2)
    for item in array1:
        if item+diff in array2:
            res = [item,item+diff]
            return res
if __name__ == "__main__":
    array1 = [1,2,5]
    array2 = [2,4]
    print(arrayequal(array1,array2))



code3:
# # 最大水量问题
代码：
def Max_w(nlist):
    max_w = 0
    for i in range(len(nlist)-1):
        for j in range(i+1,len(nlist)):
            if nlist[i]<nlist[j]:
                area_w = nlist[i]*(j-i)
            else:
                area_w = nlist[j]*(j-i)
            if max_w < area_w:
                max_w = area_w
#                 res = [i,j]
    return max_w

if __name__ == "__main__":
    nlist = [1,8,6,2,5,4,8,3,7]
   
    print(Max_w(nlist))


code4:
# # 圆圈找规律 （（n-1）*2）**2

　　

转载于:https://www.cnblogs.com/ivyharding/p/11378732.html