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-11-06
🟡3607.power-grid-maintenance
🏷️ Tags
#depth_first_search #breadth_first_search #union_find #graph #array #hash_table #ordered_set #heap_priority_queue
🟡3607.power-grid-maintenance
🏷️ Tags
#depth_first_search #breadth_first_search #union_find #graph #array #hash_table #ordered_set #heap_priority_queue
Telegraph
power-grid-maintenance
给你一个整数 c,表示 c 个电站,每个电站有一个唯一标识符 id,从 1 到 c 编号。 这些电站通过 n 条 双向 电缆互相连接,表示为一个二维数组 connections,其中每个元素 connections[i] = [ui, vi] 表示电站 ui 和电站 vi 之间的连接。直接或间接连接的电站组成了一个 电网 。 最初,所有 电站均处于在线(正常运行)状态。 另给你一个二维数组 queries,其中每个查询属于以下 两种类型之一 :
leetcode.com 2025-11-06
🟡3607.power-grid-maintenance
🏷️ Tags
#depth_first_search #breadth_first_search #union_find #graph #array #hash_table #ordered_set #heap_priority_queue
🟡3607.power-grid-maintenance
🏷️ Tags
#depth_first_search #breadth_first_search #union_find #graph #array #hash_table #ordered_set #heap_priority_queue
Telegraph
power-grid-maintenance
You are given an integer c representing c power stations, each with a unique identifier id from 1 to c (1‑based indexing). These stations are interconnected via n bidirectional cables, represented by a 2D array connections, where each element connections[i]…
leetcode.cn 2026-01-22
🟢3507.minimum-pair-removal-to-sort-array-i
🏷️ Tags
#array #hash_table #linked_list #doubly_linked_list #ordered_set #simulation #heap_priority_queue
🟢3507.minimum-pair-removal-to-sort-array-i
🏷️ Tags
#array #hash_table #linked_list #doubly_linked_list #ordered_set #simulation #heap_priority_queue
Telegraph
minimum-pair-removal-to-sort-array-i
给你一个数组 nums,你可以执行以下操作任意次数:
leetcode.com 2026-01-22
🟢3507.minimum-pair-removal-to-sort-array-i
🏷️ Tags
#array #hash_table #linked_list #doubly_linked_list #ordered_set #simulation #heap_priority_queue
🟢3507.minimum-pair-removal-to-sort-array-i
🏷️ Tags
#array #hash_table #linked_list #doubly_linked_list #ordered_set #simulation #heap_priority_queue
Telegraph
minimum-pair-removal-to-sort-array-i
Given an array nums, you can perform the following operation any number of times:
leetcode.cn 2026-01-23
🔴3510.minimum-pair-removal-to-sort-array-ii
🏷️ Tags
#array #hash_table #linked_list #doubly_linked_list #ordered_set #simulation #heap_priority_queue
🔴3510.minimum-pair-removal-to-sort-array-ii
🏷️ Tags
#array #hash_table #linked_list #doubly_linked_list #ordered_set #simulation #heap_priority_queue
Telegraph
minimum-pair-removal-to-sort-array-ii
给你一个数组 nums,你可以执行以下操作任意次数:
leetcode.com 2026-01-23
🔴3510.minimum-pair-removal-to-sort-array-ii
🏷️ Tags
#array #hash_table #linked_list #doubly_linked_list #ordered_set #simulation #heap_priority_queue
🔴3510.minimum-pair-removal-to-sort-array-ii
🏷️ Tags
#array #hash_table #linked_list #doubly_linked_list #ordered_set #simulation #heap_priority_queue
Telegraph
minimum-pair-removal-to-sort-array-ii
Given an array nums, you can perform the following operation any number of times:
leetcode.cn 2026-02-27
🔴3666.minimum-operations-to-equalize-binary-string
🏷️ Tags
#breadth_first_search #union_find #math #string #ordered_set
🔴3666.minimum-operations-to-equalize-binary-string
🏷️ Tags
#breadth_first_search #union_find #math #string #ordered_set
Telegraph
minimum-operations-to-equalize-binary-string
给你一个二进制字符串 s 和一个整数 k。
leetcode.cn 2026-08-13
🔴2213.longest-substring-of-one-repeating-character
🏷️ Tags
#segment_tree #array #string #ordered_set
🔴2213.longest-substring-of-one-repeating-character
🏷️ Tags
#segment_tree #array #string #ordered_set
Telegraph
longest-substring-of-one-repeating-character
给你一个下标从 0 开始的字符串 s 。另给你一个下标从 0 开始、长度为 k 的字符串 queryCharacters ,一个下标从 0 开始、长度也是 k 的整数 下标 数组 queryIndices ,这两个都用来描述 k 个查询。 第 i 个查询会将 s 中位于下标 queryIndices[i] 的字符更新为 queryCharacters[i] 。 返回一个长度为 k 的数组 lengths ,其中 lengths[i] 是在执行第 i 个查询 之后 s 中仅由 单个字符重复 组成的 最长子字符串…
leetcode.com 2026-08-13
🔴2213.longest-substring-of-one-repeating-character
🏷️ Tags
#segment_tree #array #string #ordered_set
🔴2213.longest-substring-of-one-repeating-character
🏷️ Tags
#segment_tree #array #string #ordered_set
Telegraph
longest-substring-of-one-repeating-character
You are given a 0-indexed string s. You are also given a 0-indexed string queryCharacters of length k and a 0-indexed array of integer indices queryIndices of length k, both of which are used to describe k queries. The ith query updates the character in s…