注册一亩三分地论坛,查看更多干货!
您需要 登录 才可以下载或查看附件。没有帐号?注册账号 
x
本帖最后由 mingyue86010 于 2019-7-23 00:05 编辑
感谢地里的面经。之前地里的面经已经比较全了,我把我提前准备的code贴上来供交流。
电面基本上一问一问给的,一步步引导,所刚好是记录的时间点。我这里用了二分查找,不过面试时说并不要求,for循环就好了。
代码如下:
- class Pallet (object):
- def __init__(self, id, weight):
- self.id = id
- self.weight = weight
- class Trailer_Followup(object):
- def __init__(self):
- self.total_weight = 0
- self.time_weights = [(0, 0)] # (time, weight)
- self.pallets = {} # key=id, val=pallet
- def load(self, pallet, time):
- self.total_weight += pallet.weight
- self.pallets[pallet.id] = pallet
- self.time_weights.append((time, self.total_weight)) # follow up
- # unload by id
- def unload(self, id, time):
- if id not in self.pallets:
- return
- pallet = self.pallets[id]
- del self.pallets[id]
- self.total_weight -= pallet.weight
- self.time_weights.append((time, self.total_weight))
- return pallet
- def get_weight_at_time(self, time):
- idx = self.find_the_front_closest(self.time_weights, (time, 0))
- return self.time_weights[idx][1]
- def find_the_front_closest(self, A, num):
- start, end = 0, len(A)-1
- while start + 1 < end:
- mid = (start + end) // 2
- if num < A[mid]:
- end = mid
- elif num > A[mid]:
- start = mid
- else:
- return mid
- if num >= A[end]:
- return end
- return start
复制代码
|