There are service_nodes of different micro-services in a system with bidirectional connections in the form of...

 

Transcribed Image Text:

There are service_nodes of different micro-services in a system with bidirectional connections in the form of a tree, where the th edge connects the micro-services service_from[i] and service_to[i]. Each micro-service is configured with a maximum number of live threads that can be present in its lifecycle, where the ith micro-service can have a maximum of threads[i] threads. The micro-services adjacent to each other must have maximum threads differing by exactly 1. Some configurations. were lost, and only k of the micro-services are known. This information is given as a 2D array, currentValues, of size kx 2 denoting [micro-service index, maximum threads], or, [i, threads[i]]. Find the maximum number of live threads that each micro-service can have such that the total number of live threads in the system is the minimum possible. Return an array of length service_nodes where the th element denotes the maximum number of live threads for the ith micro- service. Note: It is guaranteed that the solution always exists. Example Given service_nodes = 5, service_from = [1, 2, 3, 4], service_to=[2, 3, 4, 5], k =2, currentValues = [[1, 3], [5, 3]] 1:3 2 3 5:3 There are service_nodes of different micro-services in a system with bidirectional connections in the form of a tree, where the th edge connects the micro-services service_from[i] and service_to[i]. Each micro-service is configured with a maximum number of live threads that can be present in its lifecycle, where the ith micro-service can have a maximum of threads[i] threads. The micro-services adjacent to each other must have maximum threads differing by exactly 1. Some configurations. were lost, and only k of the micro-services are known. This information is given as a 2D array, currentValues, of size kx 2 denoting [micro-service index, maximum threads], or, [i, threads[i]]. Find the maximum number of live threads that each micro-service can have such that the total number of live threads in the system is the minimum possible. Return an array of length service_nodes where the th element denotes the maximum number of live threads for the ith micro- service. Note: It is guaranteed that the solution always exists. Example Given service_nodes = 5, service_from = [1, 2, 3, 4], service_to=[2, 3, 4, 5], k =2, currentValues = [[1, 3], [5, 3]] 1:3 2 3 5:3

Answer rating: 100% (QA)

To find the maximum number of live threads such that the total number of live threads in the system ... View the full answer