当前标签：HashMap

LeetCode 2365. Task Scheduler II

Dylan_Java_NYC 2022-10-03 15:24 阅读:124 评论:0 推荐:0

LeetCode 2186. Minimum Number of Steps to Make Two Strings Anagram II

Dylan_Java_NYC 2022-08-28 15:56 阅读:62 评论:0 推荐:0

LeetCode 1347. Minimum Number of Steps to Make Two Strings Anagram

Dylan_Java_NYC 2022-08-28 15:50 阅读:109 评论:0 推荐:0

LeetCode 811. Subdomain Visit Count

Dylan_Java_NYC 2022-08-22 03:21 阅读:34 评论:0 推荐:0

LeetCode 2094. Finding 3-Digit Even Numbers

Dylan_Java_NYC 2022-08-08 02:22 阅读:135 评论:0 推荐:0

LeetCode 895. Maximum Frequency Stack

Dylan_Java_NYC 2022-08-07 13:38 阅读:50 评论:0 推荐:0

LeetCode 1400. Construct K Palindrome Strings

Dylan_Java_NYC 2022-08-04 14:39 阅读:38 评论:0 推荐:0

LeetCode 815. Bus Routes

Dylan_Java_NYC 2022-07-31 09:41 阅读:82 评论:0 推荐:0

LeetCode 828. Count Unique Characters of All Substrings of a Given String

Dylan_Java_NYC 2022-07-26 05:46 阅读:195 评论:0 推荐:0

LeetCode 588. Design In-Memory File System

Dylan_Java_NYC 2022-07-24 12:36 阅读:300 评论:0 推荐:0

LeetCode 1743. Restore the Array From Adjacent Pairs

Dylan_Java_NYC 2022-07-19 12:21 阅读:81 评论:0 推荐:0

LeetCode 1345. Jump Game IV

Dylan_Java_NYC 2022-07-03 08:16 阅读:68 评论:0 推荐:0

LeetCode 1636. Sort Array by Increasing Frequency

Dylan_Java_NYC 2022-06-26 15:21 阅读:53 评论:0 推荐:0

LeetCode 1207. Unique Number of Occurrences

Dylan_Java_NYC 2022-06-24 14:46 阅读:46 评论:0 推荐:0

LeetCode 1658. Minimum Operations to Reduce X to Zero

Dylan_Java_NYC 2022-06-14 15:05 阅读:58 评论:0 推荐:0

LeetCode 1152. Analyze User Website Visit Pattern

Dylan_Java_NYC 2020-02-24 12:08 阅读:5121 评论:0 推荐:0

LeetCode 706. Design HashMap

Dylan_Java_NYC 2020-01-15 12:48 阅读:258 评论:0 推荐:0

LeetCode 957. Prison Cells After N Days

Dylan_Java_NYC 2020-01-09 10:59 阅读:361 评论:0 推荐:0

LeetCode 771. Jewels and Stones

Dylan_Java_NYC 2020-01-05 07:13 阅读:121 评论:0 推荐:0

LeetCode 632. Smallest Range Covering Elements from K Lists

Dylan_Java_NYC 2019-12-29 12:43 阅读:279 评论:0 推荐:0