06 2021 档案

【leetcode】1668. Maximum Repeating Substring
摘要：题目如下： For a string sequence, a string word is k-repeating if word concatenated k times is a substring of sequence. The word's maximum k-repeating valu 阅读全文
posted @ 2021-06-25 16:36 seyjs 阅读(67) 评论(0) 推荐(0)
【leetcode】1664. Ways to Make a Fair Array
摘要：题目如下： You are given an integer array nums. You can choose exactly one index (0-indexed) and remove the element. Notice that the index of the elements 阅读全文
posted @ 2021-06-25 16:34 seyjs 阅读(68) 评论(0) 推荐(0)
【leetcode】1663. Smallest String With A Given Numeric Value
摘要：题目如下： The numeric value of a lowercase character is defined as its position (1-indexed) in the alphabet, so the numeric value of a is 1, the numeric v 阅读全文
posted @ 2021-06-25 16:31 seyjs 阅读(48) 评论(0) 推荐(0)
【leetcode】1662. Check If Two String Arrays are Equivalent
摘要：题目如下： Given two string arrays word1 and word2, return true if the two arrays represent the same string, and false otherwise. A string is represented b 阅读全文
posted @ 2021-06-25 16:28 seyjs 阅读(68) 评论(0) 推荐(0)
【leetcode】1672. Richest Customer Wealth
摘要：题目如下： You are given an m x n integer grid accounts where accounts[i][j] is the amount of money the i​​​​​​​​​​​th​​​​ customer has in the j​​​​​​​​​​​ 阅读全文
posted @ 2021-06-25 16:27 seyjs 阅读(124) 评论(0) 推荐(0)
【leetcode】1680. Concatenation of Consecutive Binary Numbers
摘要：题目如下： Given an integer n, return the decimal value of the binary string formed by concatenating the binary representations of 1 to n in order, modulo  阅读全文
posted @ 2021-06-25 16:25 seyjs 阅读(99) 评论(0) 推荐(0)
【leetcode】1679. Max Number of K-Sum Pairs
摘要：题目如下： You are given an integer array nums and an integer k. In one operation, you can pick two numbers from the array whose sum equals k and remove th 阅读全文
posted @ 2021-06-25 16:24 seyjs 阅读(70) 评论(0) 推荐(0)
【leetcode】1678. Goal Parser Interpretation
摘要：题目如下： You own a Goal Parser that can interpret a string command. The command consists of an alphabet of "G", "()" and/or "(al)" in some order. The Goa 阅读全文
posted @ 2021-06-25 16:19 seyjs 阅读(53) 评论(0) 推荐(0)
【leetcode】1653. Minimum Deletions to Make String Balanced
摘要：题目如下： You are given a string s consisting only of characters 'a' and 'b'​​​​. You can delete any number of characters in s to make s balanced. s is ba 阅读全文
posted @ 2021-06-25 15:57 seyjs 阅读(112) 评论(0) 推荐(0)
【leetcode】1652. Defuse the Bomb
摘要：题目如下： You have a bomb to defuse, and your time is running out! Your informer will provide you with a circular array code of length of n and a key k. T 阅读全文
posted @ 2021-06-25 15:51 seyjs 阅读(78) 评论(0) 推荐(0)
【leetcode】1636. Sort Array by Increasing Frequency
摘要：题目如下： Given an array of integers nums, sort the array in increasing order based on the frequency of the values. If multiple values have the same frequ 阅读全文
posted @ 2021-06-25 15:47 seyjs 阅读(91) 评论(0) 推荐(0)
【leetcode】1630. Arithmetic Subarrays
摘要：题目如下： A sequence of numbers is called arithmetic if it consists of at least two elements, and the difference between every two consecutive elements is 阅读全文
posted @ 2021-06-25 15:44 seyjs 阅读(119) 评论(0) 推荐(0)
【leetcode】1629. Slowest Key
摘要：题目如下： A newly designed keypad was tested, where a tester pressed a sequence of n keys, one at a time. You are given a string keysPressed of length n, 阅读全文
posted @ 2021-06-25 15:41 seyjs 阅读(82) 评论(0) 推荐(0)
【leetcode】1624. Largest Substring Between Two Equal Characters
摘要：题目如下： Given a string s, return the length of the longest substring between two equal characters, excluding the two characters. If there is no such sub 阅读全文
posted @ 2021-06-25 15:39 seyjs 阅读(84) 评论(0) 推荐(0)
【leetcode】1620. Coordinate With Maximum Network Quality
摘要：题目如下： You are given an array of network towers towers and an integer radius, where towers[i] = [xi, yi, qi] denotes the ith network tower with locatio 阅读全文
posted @ 2021-06-25 15:30 seyjs 阅读(96) 评论(0) 推荐(0)
【leetcode】1619. Mean of Array After Removing Some Elements
摘要：题目如下： Given an integer array arr, return the mean of the remaining integers after removing the smallest 5% and the largest 5% of the elements. Answers 阅读全文
posted @ 2021-06-25 15:23 seyjs 阅读(62) 评论(0) 推荐(0)
【leetcode】1609. Even Odd Tree
摘要：题目如下： A binary tree is named Even-Odd if it meets the following conditions: The root of the binary tree is at level index 0, its children are at level 阅读全文
posted @ 2021-06-25 15:21 seyjs 阅读(43) 评论(0) 推荐(0)