2022年2月3日
【leetcode】1647. Minimum Deletions to Make Character Frequencies Unique
摘要： 题目如下： A string s is called good if there are no two different characters in s that have the same frequency. Given a string s, return the minimum numbe 阅读全文
posted @ 2022-02-03 09:40 seyjs 阅读(99) 评论(0) 推荐(0)
【leetcode】1646. Get Maximum in Generated Array
摘要： 题目如下： You are given an integer n. A 0-indexed integer array nums of length n + 1 is generated in the following way: nums[0] = 0 nums[1] = 1 nums[2 * i 阅读全文
posted @ 2022-02-03 09:35 seyjs 阅读(35) 评论(0) 推荐(0)
【leetcode】1670. Design Front Middle Back Queue
摘要： 题目如下： Design a queue that supports push and pop operations in the front, middle, and back. Implement the FrontMiddleBack class: FrontMiddleBack() Init 阅读全文
posted @ 2022-02-03 09:33 seyjs 阅读(39) 评论(0) 推荐(0)
【leetcode】1669. Merge In Between Linked Lists
摘要： 题目如下： You are given two linked lists: list1 and list2 of sizes n and m respectively. Remove list1's nodes from the ath node to the bth node, and put l 阅读全文
posted @ 2022-02-03 09:28 seyjs 阅读(37) 评论(0) 推荐(0)