leetcode.cn 2026-07-16
🟡3867.sum-of-gcd-of-formed-pairs
🏷️ Tags
#array #math #two_pointers #number_theory #sorting #simulation
🟡3867.sum-of-gcd-of-formed-pairs
🏷️ Tags
#array #math #two_pointers #number_theory #sorting #simulation
Telegraph
sum-of-gcd-of-formed-pairs
给你一个长度为 n 的整数数组 nums。
leetcode.com 2026-07-16
🟡3867.sum-of-gcd-of-formed-pairs
🏷️ Tags
#array #math #two_pointers #number_theory #sorting #simulation
🟡3867.sum-of-gcd-of-formed-pairs
🏷️ Tags
#array #math #two_pointers #number_theory #sorting #simulation
Telegraph
sum-of-gcd-of-formed-pairs
You are given an integer array nums of length n. Construct an array prefixGcd where for each index i:
leetcode.cn 2026-11-09
🔴1606.find-servers-that-handled-most-number-of-requests
🏷️ Tags
#array #ordered_set #simulation #heap_priority_queue
🔴1606.find-servers-that-handled-most-number-of-requests
🏷️ Tags
#array #ordered_set #simulation #heap_priority_queue
Telegraph
find-servers-that-handled-most-number-of-requests
你有 k 个服务器,编号为 0 到 k-1 ,它们可以同时处理多个请求组。每个服务器有无穷的计算能力但是 不能同时处理超过一个请求 。请求分配到服务器的规则如下:
leetcode.com 2026-11-09
🔴1606.find-servers-that-handled-most-number-of-requests
🏷️ Tags
#array #ordered_set #simulation #heap_priority_queue
🔴1606.find-servers-that-handled-most-number-of-requests
🏷️ Tags
#array #ordered_set #simulation #heap_priority_queue
Telegraph
find-servers-that-handled-most-number-of-requests
You have k servers numbered from 0 to k-1 that are being used to handle multiple requests simultaneously. Each server has infinite computational capacity but cannot handle more than one request at a time. The requests are assigned to servers according to…