亚麻OA2贡献数据

是之前OA1 DDL2.22那一批， 做了OA1之后，当天收到OA2， 今天做完OA

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

peed版)


求大米，没米寸步难行。。。

Mozart 发表于 2019/03/13 09:24:24


请问lz这题目是你手打的吗？还是哪里有资源？ 求告知，已加米

地里有截图版本，我只是整理的时候ocr转了一下。

求问楼主 (Software component speed版)是哪版呢？

贿贿 发表于 2019-3-1 05:10
求问楼主 (Software component speed版)是哪版呢？

Subtree with Maximum Average 有两个版本，区别在于背景故事不一样， 实现几乎是一样的。

jennifer666666 发表于 2019-3-1 06:24
Subtree with Maximum Average 有两个版本，区别在于背景故事不一样， 实现几乎是一样的。

感谢！楼主做的是general tree么 能不能描述一下题目呀？有什么限制吗？

贿贿 发表于 2019-3-1 06:31
感谢！楼主做的是general tree么 能不能描述一下题目呀？有什么限制吗？

Subtree with Maximum Average(Software component speed版)
------------------------------------------------------------------------------------------------------------------------------
Engineers at Amazon are interested in knowing which software component moves the fastest by counting the number of lines of code changed in that component and all subcomponents in the code base over a month. Component nodes have subcomponent nodes that make up the larger component. We've stored the components as a tree where each node represents one component that contains the number of lines changed that month. Software component speed is computed as the average number of lines of code changed for a given component and all its subcomponents. Engineers compute this software component speed for all such components which have one or more subcomponents. Find the component with the highest software component speed. Assume there will be at least one subcomponent in the tree and that there will be no ties.

Input
The input to the function/method consists of an argument:
rootComponent, representing the root node.

Output
Return the reference to the component that has highest software component speed.

Example
Input:
rootComponent:
           200
       /              \
   120                   180
/  I  \                  /  \
110 20  30         150 80

Output:
180

Explanation: The component at the root of the tree has had 200 lines changed this month; its two dependencies have had 120 and 180 changed respectively. There are three components in this tree with the following changes:
120 => (110+20+30+120)/4 = 70
180 => (180+150+80)/3 =130.67
200 => (110+20+30+120+180+150+80 + 200)/8 = 86.25

jennifer666666 发表于 2019-3-1 14:51
Subtree with Maximum Average(Software component speed版)
---------------------------------------- ...

请问lz这题目是你手打的吗？还是哪里有资源？ 求告知，已加米