leetcode.cn 2025-09-16
🔴2197.replace-non-coprime-numbers-in-array
🏷️ Tags
#stack #array #math #number_theory
🔴2197.replace-non-coprime-numbers-in-array
🏷️ Tags
#stack #array #math #number_theory
Telegraph
replace-non-coprime-numbers-in-array
给你一个整数数组 nums 。请你对数组执行下述操作:
leetcode.com 2025-09-16
🔴2197.replace-non-coprime-numbers-in-array
🏷️ Tags
#stack #array #math #number_theory
🔴2197.replace-non-coprime-numbers-in-array
🏷️ Tags
#stack #array #math #number_theory
Telegraph
replace-non-coprime-numbers-in-array
You are given an array of integers nums. Perform the following steps:
leetcode.cn 2025-09-17
🟡2349.design-a-number-container-system
🏷️ Tags
#design #hash_table #ordered_set #heap_priority_queue
🟡2349.design-a-number-container-system
🏷️ Tags
#design #hash_table #ordered_set #heap_priority_queue
Telegraph
design-a-number-container-system
设计一个数字容器系统,可以实现以下功能:
leetcode.com 2025-09-17
🟡2353.design-a-food-rating-system
🏷️ Tags
#design #array #hash_table #string #ordered_set #heap_priority_queue
🟡2353.design-a-food-rating-system
🏷️ Tags
#design #array #hash_table #string #ordered_set #heap_priority_queue
Telegraph
design-a-food-rating-system
Design a food rating system that can do the following:
leetcode.cn 2025-09-18
🟡3408.design-task-manager
🏷️ Tags
#design #hash_table #ordered_set #heap_priority_queue
🟡3408.design-task-manager
🏷️ Tags
#design #hash_table #ordered_set #heap_priority_queue
Telegraph
design-task-manager
一个任务管理器系统可以让用户管理他们的任务,每个任务有一个优先级。这个系统需要高效地处理添加、修改、执行和删除任务的操作。 请你设计一个 TaskManager 类:
leetcode.com 2025-09-18
🟡3408.design-task-manager
🏷️ Tags
#design #hash_table #ordered_set #heap_priority_queue
🟡3408.design-task-manager
🏷️ Tags
#design #hash_table #ordered_set #heap_priority_queue
Telegraph
design-task-manager
There is a task management system that allows users to manage their tasks, each associated with a priority. The system should efficiently handle adding, modifying, executing, and removing tasks. Implement the TaskManager class:
leetcode.cn 2025-09-20
🟡3508.implement-router
🏷️ Tags
#design #queue #array #hash_table #binary_search #ordered_set
🟡3508.implement-router
🏷️ Tags
#design #queue #array #hash_table #binary_search #ordered_set
Telegraph
implement-router
请你设计一个数据结构来高效管理网络路由器中的数据包。每个数据包包含以下属性:
leetcode.cn 2025-09-21
🔴1912.design-movie-rental-system
🏷️ Tags
#design #array #hash_table #ordered_set #heap_priority_queue
🔴1912.design-movie-rental-system
🏷️ Tags
#design #array #hash_table #ordered_set #heap_priority_queue
Telegraph
design-movie-rental-system
你有一个电影租借公司和 n 个电影商店。你想要实现一个电影租借系统,它支持查询、预订和返还电影的操作。同时系统还能生成一份当前被借出电影的报告。 所有电影用二维整数数组 entries 表示,其中 entries[i] = [shopi, moviei, pricei] 表示商店 shopi 有一份电影 moviei 的拷贝,租借价格为 pricei 。每个商店有 至多一份 编号为 moviei 的电影拷贝。 系统需要支持以下操作:
leetcode.com 2025-09-21
🔴1912.design-movie-rental-system
🏷️ Tags
#design #array #hash_table #ordered_set #heap_priority_queue
🔴1912.design-movie-rental-system
🏷️ Tags
#design #array #hash_table #ordered_set #heap_priority_queue
Telegraph
design-movie-rental-system
You have a movie renting company consisting of n shops. You want to implement a renting system that supports searching for, booking, and returning movies. The system should also support generating a report of the currently rented movies. Each movie is given…
leetcode.cn 2025-09-22
🟢3005.count-elements-with-maximum-frequency
🏷️ Tags
#array #hash_table #counting
🟢3005.count-elements-with-maximum-frequency
🏷️ Tags
#array #hash_table #counting
Telegraph
count-elements-with-maximum-frequency
给你一个由 正整数 组成的数组 nums 。 返回数组 nums 中所有具有 最大 频率的元素的 总频率 。 元素的 频率 是指该元素在数组中出现的次数。 示例 1: 输入:nums = [1,2,2,3,1,4] 输出:4 解释:元素 1 和 2 的频率为 2 ,是数组中的最大频率。 因此具有最大频率的元素在数组中的数量是 4 。 示例 2: 输入:nums = [1,2,3,4,5] 输出:5 解释:数组中的所有元素的频率都为 1 ,是最大频率。 因此具有最大频率的元素在数组中的数量是 5 。 …
leetcode.com 2025-09-22
🟢3005.count-elements-with-maximum-frequency
🏷️ Tags
#array #hash_table #counting
🟢3005.count-elements-with-maximum-frequency
🏷️ Tags
#array #hash_table #counting
Telegraph
count-elements-with-maximum-frequency
You are given an array nums consisting of positive integers. Return the total frequencies of elements in nums such that those elements all have the maximum frequency. The frequency of an element is the number of occurrences of that element in the array. …