Given k guards in a museum with n rooms that are connected in a certain way (was drawn on a whiteboard when I was asked this) write a function to determine which of the k guards is closest to each of the n rooms?

Given k guards in a museum with n rooms that are connected in a certain way (was drawn on a whiteboard when I was asked this) write a function to determine which of the k guards is closest to each of the n rooms?

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: easy

标签: interviewbit, ntt-data, company-specific

目标公司: NTT DATA

参考答案摘要

Below example Python function that finds the closest guard to each room in a museum from collections import deque def find_closest_guards(n, guards, connections): # Initialize the result dictionary re...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。