华为机试面试算法题

 

1-5

# 全排列
nums,a = [],input().split(',')
for i in a:
    for j in a:
        for k in a:
            if i!=j and j!=k and i!=k:
                nums.append([i,j,k])

print(nums)
# 盛水最多的容器
listNum = input().split(',')

v = 0
maxV = 0
end = 0
for i in listNum:
    k = 0
    end +=1
    for j in listNum[end:]:
        k += 1
        v = min(map(int,[i,j]))*k
        if v > maxV:
            maxV = v
print(maxV)
# 跳远比赛
nums = list(map(int,input().split(' ')))
totalSum = 0
i=1
count = 0
while totalSum<nums[0]-1:
    totalSum +=nums[i]
    count +=1
print(count)
# 字符消除
def isCut(pre,now,data):
    if data[pre]==data[now]:
        data = data[:pre] + data[now+1 :]
        global isModify
        isModify = True
    print(data)
    return data
isModify = True
data = list(input())
while isModify ==True:
    pre = 0
    now = 1
    isModify = False
    while pre<len(data)-1:
        data = isCut(pre,now,data)
        pre+=1
        now+=1
if data == []:
    print('True')
else:
    print('False')
# 航班预定座位数
def infoParse(each,answer):
    each = list(map(int,each.split(',')))
    i = each[0]
    j = each[1]
    k = each[2]
    for line in range(i,j+1):
        answer[line-1] +=k
    return answer
book = input().split(' ')
answer = [0]*int(book[-1])
bookLength = len(book)-1
for each in book[:bookLength]:
   answer = infoParse(each,answer)

print(answer)

6-10

import math
#字符串分割
s = input().split()
stringList = s[1].split('-')
stringTail = ''.join(list(map(lambda x:x.upper(),stringList[1:])))
count = 1
newString = ''
for i in stringTail:
    newString += i
    count +=1
    if count%3==0:
        newString+='-'
string = ''.join(stringList[:1])+'-'+newString
print(string)
#服务器广播
nums = input().split()
N = int(math.sqrt(len(nums)))
serverTab = list(zip(*[iter(nums)]*N))
i =0
broadCastCount = 0
while i<N:
    if '0' in serverTab[i][i:]:
        broadCastCount +=1
    i+=1
print(broadCastCount)
# #分子弹，这个题想了好久，最后发现是leetcode上面的candy那一类的
ranks = list(map(int,input().split(',')))
deliver = [1]*len(ranks)
for i in range(1,len(ranks)):
    if ranks[i]>ranks[i-1]:
        deliver[i]=deliver[i-1]+1
for i in range(len(ranks)-2,-1,-1):
    if ranks[i]>ranks[i+1] and deliver[i]<=deliver[i+1]:
        deliver[i]=deliver[i+1]+1
    if ranks[i]==ranks[i+1] and deliver[i]!=deliver[i+1]:
        deliver[i]=deliver[i+1]
print(sum(deliver))
#无重复字符的最长字串
s = input()
start = 0
end = len(s)
maxLen = 0
while len(s[start:])>maxLen:
    temp = s[start]
    endPos = s.find(temp, start + 1, end)
    if endPos>0:
        maxLen = max(len(s[start:endPos]),maxLen)
    start +=1
print(maxLen)
#九宫格按键输入
def curRepeat(s):
    s +='$'
    s_new = ''
    total = 0
    for i in range(len(s)-1):
        divisor = 1
        if s[i] in 'abcdefghijklmnotuv':
            divisor = 3
        elif s[i] in 'pqrswxyz':
            divisor = 4
        elif s[i] in ',.':
            divisor =2
        j =i+1
        if s[i]==s[j]:
            total +=1
            continue
        elif s[i].isalpha():
            s_new += chr((ord(s[i])+total%divisor))
            total = 0
        elif s[i] in ',.':
            s_new += ',.'[total%divisor]
            total =0
    return ''.join(s_new.split('$'))

def swichNum(s):
    return s
def swichLetter(s):
    letter = s.split('/')
    s = ''
    for i in letter:
        if s!='':
            s += '$'
        for j in i:
            s += chars[j][0]
    s = curRepeat(s)
    return s

i,s = 0,input().split('#')
chars = {'1':',.','2':'abc','3':'def','4':'ghi','5':'jkl','6':'mno',
         '7':'pqrs','8':'tuv','9':'wxyz','0':'# /'}
sNum = s[0]
sLetter = s[1]
sNum = swichNum(sNum)
sLetter = swichLetter(sLetter)
s = sNum + sLetter
print(s)

试题下载：https://download.csdn.net/download/qq_29032105/12667128