02 2022 档案

【leetcode】1704. Determine if String Halves Are Alike
摘要：题目如下： You are given a string s of even length. Split this string into two halves of equal lengths, and let a be the first half and b be the second hal 阅读全文
posted @ 2022-02-07 16:02 seyjs 阅读(38) 评论(0) 推荐(0)
【leetcode】1671. Minimum Number of Removals to Make Mountain Array
摘要：题目如下： You may recall that an array arr is a mountain array if and only if: arr.length >= 3 There exists some index i (0-indexed) with 0 < i < arr.leng 阅读全文
posted @ 2022-02-07 15:57 seyjs 阅读(64) 评论(0) 推荐(0)
【leetcode】1696. Jump Game VI
摘要：题目如下： You are given a 0-indexed integer array nums and an integer k. You are initially standing at index 0. In one move, you can jump at most k steps 阅读全文
posted @ 2022-02-07 15:46 seyjs 阅读(79) 评论(0) 推荐(0)
【leetcode】1695. Maximum Erasure Value
摘要：题目如下： You are given an array of positive integers nums and want to erase a subarray containing unique elements. The score you get by erasing the subar 阅读全文
posted @ 2022-02-05 16:58 seyjs 阅读(75) 评论(0) 推荐(0)
【leetcode】1694. Reformat Phone Number
摘要：题目如下： You are given a phone number as a string number. number consists of digits, spaces ' ', and/or dashes '-'. You would like to reformat the phone 阅读全文
posted @ 2022-02-05 16:53 seyjs 阅读(66) 评论(0) 推荐(0)
【leetcode】1656. Design an Ordered Stream
摘要：题目如下： There is a stream of n (idKey, value) pairs arriving in an arbitrary order, where idKey is an integer between 1 and n and value is a string. No 阅读全文
posted @ 2022-02-05 16:50 seyjs 阅读(178) 评论(0) 推荐(0)
【leetcode】1685. Sum of Absolute Differences in a Sorted Array
摘要：题目如下： You are given an integer array nums sorted in non-decreasing order. Build and return an integer array result with the same length as nums such t 阅读全文
posted @ 2022-02-05 16:42 seyjs 阅读(71) 评论(0) 推荐(0)
【leetcode】1684. Count the Number of Consistent Strings
摘要：题目如下： You are given a string allowed consisting of distinct characters and an array of strings words. A string is consistent if all characters in the 阅读全文
posted @ 2022-02-04 16:38 seyjs 阅读(56) 评论(0) 推荐(0)
【leetcode】1689. Partitioning Into Minimum Number Of Deci-Binary Numbers
摘要：题目如下： A decimal number is called deci-binary if each of its digits is either 0 or 1 without any leading zeros. For example, 101 and 1100 are deci-bina 阅读全文
posted @ 2022-02-04 16:35 seyjs 阅读(114) 评论(0) 推荐(0)
【leetcode】1688. Count of Matches in Tournament
摘要：题目如下： You are given an integer n, the number of teams in a tournament that has strange rules: If the current number of teams is even, each team gets p 阅读全文
posted @ 2022-02-04 16:28 seyjs 阅读(55) 评论(0) 推荐(0)
【leetcode】1604. Alert Using Same Key-Card Three or More Times in a One Hour Period
摘要：题目如下： LeetCode company workers use key-cards to unlock office doors. Each time a worker uses their key-card, the security system saves the worker's na 阅读全文
posted @ 2022-02-04 16:25 seyjs 阅读(50) 评论(0) 推荐(0)
【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 阅读(90) 评论(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 阅读(29) 评论(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 阅读(32) 评论(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 阅读(32) 评论(0) 推荐(0)