雇佣问题

一.

#根据给定的应聘者列表，得出最好的应聘者
def hire_assistant(assList):
    n = len(assList)
    best = 0
    index = 0
    for i in range(n):
        value = assList[i].score
        if value > best:
            best = value
            index = i
    return assList[index]

# 定义一个应聘者的类，给出他的属性score和name
class Assistant:
    def __init__(self, a_name="anonymous", value=0):
        self.name = a_name
        self.score = value

assList=[Assistant("A",12),Assistant("B",13),Assistant("C",8),Assistant("D",10),Assistant("E",22),Assistant("F",21)]
print(hire_assistant(assList).name)
-------------------------------------------------
E

二.

 

#平衡最小化面试次数和最大化应聘者质量
def on_line_maximum(k,assList):
    n = len(assList)
    bestscore = float("-inf")#最好的分数
    #先搜寻前k个中分数最高的
    for i in range(k):
        if assList[i].score > bestscore:
            bestscore = assList[i].score
    #对于后面的，如果有更高分数的，立即选择，否则选择最后一个
    for i in range(k,n):
        if assList[i].score > bestscore:
            return assList[i]
    return assList[n-1]

assList=[Assistant("A",12),Assistant("B",13),Assistant("C",8),Assistant("D",10),Assistant("E",22),Assistant("F",21)]
assistant = on_line_maximum(3, assList)
print(assistant.name)
----------------------------------
E