leetcode.cn 2026-11-06
🟡2747.count-zero-request-servers
🏷️ Tags
#array #hash_table #sorting #sliding_window
🟡2747.count-zero-request-servers
🏷️ Tags
#array #hash_table #sorting #sliding_window
Telegraph
count-zero-request-servers
给你一个整数 n ,表示服务器的总数目,再给你一个下标从 0 开始的 二维 整数数组 logs ,其中 logs[i] = [server_id, time] 表示 id 为 server_id 的服务器在 time 时收到了一个请求。 同时给你一个整数 x 和一个下标从 0 开始的整数数组 queries 。 请你返回一个长度等于 queries.length 的数组 arr ,其中 arr[i] 表示在时间区间 [queries[i] - x, queries[i]] 内没有收到请求的服务器数目。…
leetcode.com 2026-11-06
🟡2747.count-zero-request-servers
🏷️ Tags
#array #hash_table #sorting #sliding_window
🟡2747.count-zero-request-servers
🏷️ Tags
#array #hash_table #sorting #sliding_window
Telegraph
count-zero-request-servers
You are given an integer n denoting the total number of servers and a 2D 0-indexed integer array logs, where logs[i] = [server_id, time] denotes that the server with id server_id received a request at time time. You are also given an integer x and a 0-indexed…
leetcode.cn 2026-11-08
🟡1267.count-servers-that-communicate
🏷️ Tags
#depth_first_search #breadth_first_search #union_find #array #counting #matrix
🟡1267.count-servers-that-communicate
🏷️ Tags
#depth_first_search #breadth_first_search #union_find #array #counting #matrix
Telegraph
count-servers-that-communicate
这里有一幅服务器分布图,服务器的位置标识在 m * n 的整数矩阵网格 grid 中,1 表示单元格上有服务器,0 表示没有。 如果两台服务器位于同一行或者同一列,我们就认为它们之间可以进行通信。 请你统计并返回能够与至少一台其他服务器进行通信的服务器的数量。 示例 1: 输入:grid = [[1,0],[0,1]] 输出:0 解释:没有一台服务器能与其他服务器进行通信。 示例 2: 输入:grid = [[1,0],[1,1]] 输出:3 解释:所有这些服务器都至少可以与一台别的服务器进行通信。…
leetcode.com 2026-11-08
🟡1267.count-servers-that-communicate
🏷️ Tags
#depth_first_search #breadth_first_search #union_find #array #counting #matrix
🟡1267.count-servers-that-communicate
🏷️ Tags
#depth_first_search #breadth_first_search #union_find #array #counting #matrix
Telegraph
count-servers-that-communicate
You are given a map of a server center, represented as a m * n integer matrix grid, where 1 means that on that cell there is a server and 0 means that it is no server. Two servers are said to communicate if they are on the same row or on the same column.Return…
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…
leetcode.cn 2026-11-12
🟢3105.longest-strictly-increasing-or-strictly-decreasing-subarray
🏷️ Tags
#array
🟢3105.longest-strictly-increasing-or-strictly-decreasing-subarray
🏷️ Tags
#array
Telegraph
longest-strictly-increasing-or-strictly-decreasing-subarray
给你一个整数数组 nums 。 返回数组 nums 中 严格递增 或 严格递减 的最长非空子数组的长度。 示例 1: 输入:nums = [1,4,3,3,2] 输出:2 解释: nums 中严格递增的子数组有[1]、[2]、[3]、[3]、[4] 以及 [1,4] 。 nums 中严格递减的子数组有[1]、[2]、[3]、[3]、[4]、[3,2] 以及 [4,3] 。 因此,返回 2 。 示例 2: 输入:nums = [3,3,3,3] 输出:1 解释: nums 中严格递增的子数组有 [3]、[3]、[3]…