[数据结构与算法]leecode-1606

题目

https://leetcode-cn.com/problems/find-servers-that-handled-most-number-of-requests/

Javascript 暴力破解

/**
 * @param {number} k
 * @param {number[]} arrival
 * @param {number[]} load
 * @return {number[]}
 */
var busiestServers = function (k, arrival, load) {
  let arr = []
  for (let i = 0; i < k; i++) {
    arr.push({
      excuteTime: 0,
      excuteTask: 0,
    })
  }
  for (let j = 0; j < arrival.length; j++) {
    let current = j % k
    let isJoin = false
    while (current < k) {
      if (arr[current].excuteTime - arrival[j] <= 0) {
        arr[current].excuteTime = arrival[j] + load[j]
        arr[current].excuteTask += 1
        isJoin = true
        break
      }
      current++
    }
    if (!isJoin) {
      let start = 0
      while (start < j % k) {
        if (arr[start].excuteTime - arrival[j] <= 0) {
          arr[start].excuteTime = arrival[j] + load[j]
          arr[start].excuteTask += 1
          isJoin = true
          break
        }
        start++
      }
    }
  }
  let result = []
  let num = 0
  for (let i = 0; i < k; i++) {
    if (arr[i].excuteTask > num) {
      num = arr[i].excuteTask
      result = [i]
    } else if (arr[i].excuteTask == num) {
      result.push(i)
    }
  }
  return result
}

测试