微软70mins OA 和3~5月题目总结

今天的OA

第一题：
There are two wooden sticks of lengths A and B respectively. Each of them can be cut
into shorter sticks of integer lengths. Our goal is to construct the largest possible
square. In order to do this, we want to cut the sticks in such a way as to achieve four
sticks of the same length (note that there can be some leftover pieces). What is the
longest side of square that we can achieve?
Write a function:
def solution(A, B)
that, given two integers A, B, returns the side length of the largest square that we can
obtain. If it is not possible to create any square, the function should return 0.
Examples:
1. Given A = 10, B = 21, the function should return 7. We can split the second stick into
three sticks of length 7 and shorten the first stick by 3.
2. Given A = 13, B = 11, the function should return 5. We can cut two sticks of length 5
from each of the given sticks.
3. Given A = 2, B = 1, the function should return 0. It is not possible to make any square
from the given sticks.
4. Given A = 1, B = 8, the function should return 2. We can cut stick B into four parts.

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

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

感谢楼主分享，请问一下楼主oa完多久收到消息呀，已加米，感谢

感謝分享！！

多谢分享

请问楼主申请的是什么职位哦？ 谢谢～～

请问楼主申请的是SDE几，这都是近三个月的OTS题吗？

请问VO的时候会考系统设计吗

感谢分享！！！

匿名者 发表于 2022-5-29 13:57
请问楼主申请的是SDE几，这都是近三个月的OTS题吗？

我感觉后面的是VO的题吧

感谢分享 谢谢楼主