算法
文章平均质量分 68
算法
优惠券已抵扣
余额抵扣
还需支付
¥9.90
¥99.00
购买须知?
本专栏为图文内容,最终完结不会低于15篇文章。
订阅专栏,享有专栏所有文章阅读权限。
本专栏为虚拟商品,基于网络商品和虚拟商品的性质和特征,专栏一经购买无正当理由不予退款,不支持升级,敬请谅解。
杨鑫newlfe
算法就是我的灵魂
展开
-
LeetCode --- 2154. Keep Multiplying Found Values by Two 解题报告
You are given an array of integers . You are also given an integer which is the first number that needs to be searched for in .You then do the following steps:Return the final value of .Example 1:Input: nums = [5,3,6,1,12], original = 3Output: 24Explan原创 2024-07-30 23:31:16 · 76 阅读 · 0 评论 -
LeetCode --- 2148. Count Elements With Strictly Smaller and Greater Elements 解题报告
Given an integer array , return the number of elements that have both a strictly smaller and a strictly greater element appear in .Example 1:Input: nums = [11,7,2,15]Output: 2Explanation: The element 7 has the element 2 strictly smaller than it and the原创 2024-07-18 01:58:39 · 3678 阅读 · 0 评论 -
LeetCode --- 2144. Minimum Cost of Buying Candies With Discount 解题报告
A shop is selling candies at a discount. For every two candies sold, the shop gives a third candy for free.The customer can choose any candy to take away for free as long as the cost of the chosen candy is less than or equal to the minimum cost of the two原创 2024-07-18 01:30:58 · 636 阅读 · 0 评论 -
LeetCode --- 2138. Divide a String Into Groups of Size k 解题报告
A string can be partitioned into groups of size using the following procedure:Note that the partition is done so that after removing the character from the last group (if it exists) and concatenating all the groups in order, the resultant string should原创 2024-07-16 23:15:32 · 9066 阅读 · 0 评论 -
LeetCode --- 2133. Check if Every Row and Column Contains All Numbers 解题报告
An matrix is valid if every row and every column contains all the integers from to (inclusive).Given an integer matrix , return if the matrix is valid. Otherwise, return .Example 1:Input: matrix = [[1,2,3],[3,1,2],[2,3,1]]Output: trueExplanation: I原创 2024-07-16 01:33:55 · 92 阅读 · 0 评论 -
LeetCode --- 2129. Capitalize the Title 解题报告
You are given a string consisting of one or more words separated by a single space, where each word consists of English letters. Capitalize the string by changing the capitalization of each word such that:Return the capitalized .Example 1:Input: title =原创 2024-07-16 01:17:04 · 1642 阅读 · 0 评论 -
LeetCode --- 2124. Check if All A‘s Appears Before All B‘s 解题报告
Given a string consisting of only the characters and , return if every appears before every in the string. Otherwise, return .Example 1:Input: s = "aaabbb"Output: trueExplanation:The 'a's are at indices 0, 1, and 2, while the 原创 2024-07-11 22:47:58 · 619 阅读 · 0 评论 -
LeetCode --- 2119. A Number After a Double Reversal 解题报告
Reversing an integer means to reverse all its digits.Given an integer , reverse to get , then reverse to get . Return if equals . Otherwise return .Example 1:Input: num = 526Output: trueExplanation: Reverse num to get 625, then reverse 625 to get 52原创 2024-07-10 23:25:32 · 353 阅读 · 0 评论 -
LeetCode --- 2114. Maximum Number of Words Found in Sentences 解题报告
A sentence is a list of words that are separated by a single space with no leading or trailing spaces.You are given an array of strings , where each represents a single sentence.Return the maximum number of words that appear in a single sentence.Example 1原创 2024-07-10 23:03:37 · 481 阅读 · 0 评论 -
LeetCode --- 2108. Find First Palindromic String in the Array 解题报告
Given an array of strings , return the first palindromic string in the array. If there is no such string, return an empty string .A string is palindromic if it reads the same forward and backward.Example 1:Input: words = ["abc","car",&原创 2024-07-09 00:23:27 · 2879 阅读 · 0 评论 -
LeetCode --- 2103. Rings and Rods 解题报告
There are rings and each ring is either red, green, or blue. The rings are distributed across ten rods labeled from to .You are given a string of length that describes the rings that are placed onto the rods. Every two characters in forms a color-pos原创 2024-07-08 00:03:11 · 225 阅读 · 0 评论 -
LeetCode --- 2099. Find Subsequence of Length K With the Largest Sum 解题报告
You are given an integer array and an integer . You want to find a subsequence of of length that has the largest sum.Return any such subsequence as an integer array of length .A subsequence is an array that can be derived from another array by deleting原创 2024-07-06 02:10:34 · 181 阅读 · 0 评论 -
LeeCode --- 2094. Finding 3-Digit Even Numbers 解题报告
You are given an integer array , where each element is a digit. The array may contain duplicates.You need to find all the unique integers that follow the given requirements:For example, if the given were , integers and follow the requirements.Return a s原创 2024-07-05 00:19:59 · 273 阅读 · 0 评论 -
Leetcode --- 2089. Find Target Indices After Sorting Array 解题报告
You are given a 0-indexed integer array and a target element .A target index is an index such that .Return a list of the target indices of after sorting in non-decreasing order. If there are no target indices, return an empty list. The returned list mu原创 2024-07-04 23:51:55 · 47 阅读 · 0 评论 -
LeetCode --- 2085. Count Common Words With One Occurrence 解题报告
Given two string arrays and , return the number of strings that appear exactly once in each of the two arrays.Example 1:Input: words1 = ["leetcode","is","amazing","as","is"], words2 = ["amazing"原创 2024-07-04 00:23:22 · 419 阅读 · 0 评论 -
LeetCode --- 2078. Two Furthest Houses With Different Colors 解题报告
There are houses evenly lined up on the street, and each house is beautifully painted. You are given a 0-indexed integer array of length , where represents the color of the house.Return the maximum distance between two houses with different colors.The原创 2024-07-04 00:06:27 · 221 阅读 · 0 评论 -
LeetCode --- 2073. Time Needed to Buy Tickets 解题报告
There are people in a line queuing to buy tickets, where the person is at the front of the line and the person is at the back of the line.You are given a 0-indexed integer array of length where the number of tickets that the person would like to buy原创 2024-06-16 23:56:32 · 138 阅读 · 0 评论 -
LeetCode --- 2068. Check Whether Two Strings are Almost Equivalent 解题报告
Two strings and are considered almost equivalent if the differences between the frequencies of each letter from to between and is at most .Given two strings and , each of length , return if and are almost equivalent, or otherwise.The frequency o原创 2024-03-16 14:16:31 · 163 阅读 · 0 评论 -
LeetCode --- 2062. Count Vowel Substrings of a String 解题报告
A substring is a contiguous (non-empty) sequence of characters within a string.A vowel substring is a substring that only consists of vowels (, , , , and ) and has all five vowels present in it.Given a string , return the number of vowel substrings in .Exa原创 2024-03-14 08:08:23 · 150 阅读 · 0 评论 -
LeetCode --- 2057. Smallest Index With Equal Value 解题报告
Given a 0-indexed integer array , return the smallest index of such that , or if such index does not exist. denotes the remainder when is divided by .Example 1:Input: nums = [0,1,2]Output: 0Explanation: i=0: 0 mod 10 = 0 == nums[0].i=1: 1 mod 10 =原创 2024-03-14 07:48:04 · 210 阅读 · 0 评论 -
LeetCode --- 2053. Kth Distinct String in an Array 解题报告
A distinct string is a string that is present only once in an array.Given an array of strings , and an integer , return the distinct string present in . If there are fewer than distinct strings, return an empty string .Note that the strings are considere原创 2024-03-05 07:35:58 · 972 阅读 · 1 评论 -
LeetCode --- 2047. Number of Valid Words in a Sentence 解题报告
LeetCode --- 2047. Number of Valid Words in a Sentence 解题报告原创 2024-02-17 03:18:58 · 265 阅读 · 0 评论 -
LeetCode --- 2042. Check if Numbers Are Ascending in a Sentence 解题报告
A sentence is a list of tokens separated by a single space with no leading or trailing spaces. Every token is either a positive number consisting of digits with no leading zeros, or a word consisting of lowercase English letters.Given a string representi原创 2024-02-02 00:14:14 · 130 阅读 · 0 评论 -
LeetCode --- 2037. Minimum Number of Moves to Seat Everyone 解题报告
There are seats and students in a room. You are given an array of length , where is the position of the seat. You are also given the array of length , where is the position of the student.You may perform the following move any number of times:Retur原创 2024-02-01 23:58:54 · 263 阅读 · 0 评论 -
LeetCode --- 2032. Two Out of Three 解题报告
Given three integer arrays , , and , return a distinct array containing all the values that are present in at least two out of the three arrays. You may return the values in any order.Example 1:Input: nums1 = [1,1,3,2], nums2 = [2,3], nums3 = [3]Output:原创 2024-01-31 22:04:24 · 180 阅读 · 0 评论 -
LeetCode --- 2027. Minimum Moves to Convert String 解题报告
You are given a string consisting of characters which are either or .A move is defined as selecting three consecutive characters of and converting them to . Note that if a move is applied to the character , it will stay the same.Return the minimum numb原创 2024-01-31 21:45:47 · 159 阅读 · 0 评论 -
LeetCode --- CodeTestcaseTest ResultTest Result2022. Convert 1D Array Into 2D Array 解题报告
模拟操作,给定一个一位数组,利用规律使其变为二维数组。这里就通过盘点给定一位数组的长度是否等于m*n直接判断是否可变换。然后通过两个for遍历赋值即可原创 2024-01-19 01:58:54 · 61 阅读 · 0 评论 -
LeetCode --- 2016. Maximum Difference Between Increasing Elements 解题报告
LeetCode升序求差值原创 2024-01-15 01:56:58 · 131 阅读 · 0 评论 -
LeetCode --- 2011. Final Value of Variable After Performing Operations 解题报告
There is a programming language with only four operations and one variable :Initially, the value of is .Given an array of strings containing a list of operations, return the final value of after performing all the operations.Example 1:Input: operations原创 2023-12-10 23:55:52 · 173 阅读 · 0 评论 -
LeetCode --- 2006. Count Number of Pairs With Absolute Difference K 解题报告
Given an integer array and an integer , return the number of pairs where such that .The value of is defined as:Example 1:Input: nums = [1,2,2,1], k = 1Output: 4Explanation: The pairs with an absolute difference of 1 are:- [1,2,2,1]- [1,2,2,1]- [1原创 2023-12-10 23:44:34 · 159 阅读 · 0 评论 -
LeetCode --- 2000. Reverse Prefix of Word 解题报告
Given a 0-indexed string and a character , reverse the segment of that starts at index and ends at the index of the first occurrence of (inclusive). If the character does not exist in , do nothing.Return the resulting string.Example 1:Input: word = &原创 2023-12-03 12:20:01 · 237 阅读 · 0 评论 -
LeetCode --- 1995. Count Special Quadruplets 解题报告
两种解法处理移动下标算法问题原创 2023-11-11 11:22:36 · 205 阅读 · 0 评论 -
LeetCode --- CodeTestcaseTestcaseTest Result1991. Find the Middle Index in Array 解题报告
Given a 0-indexed integer array , find the leftmost (i.e., the smallest amongst all the possible ones).A is an index where .If , the left side sum is considered to be . Similarly, if , the right side sum is considered to be .Return the leftmost that sat原创 2023-11-05 23:27:30 · 126 阅读 · 0 评论 -
LeetCode --- 1984. Minimum Difference Between Highest and Lowest of K Scores 解题报告
You are given a 0-indexed integer array , where represents the score of the student. You are also given an integer .Pick the scores of any students from the array so that the difference between the highest and the lowest of the scores is minimized.Retu原创 2023-11-03 08:48:14 · 113 阅读 · 0 评论 -
LeetCode --- 1979. Find Greatest Common Divisor of Array 解题报告
Given an integer array , return the greatest common divisor of the smallest number and largest number in .The greatest common divisor of two numbers is the largest positive integer that evenly divides both numbers.Example 1:Input: nums = [2,5,6,9,10]Outp原创 2023-10-23 00:18:16 · 281 阅读 · 0 评论 -
LeetCode --- 1974. Minimum Time to Type Word Using Special Typewriter 解题报告
There is a special typewriter with lowercase English letters to arranged in a circle with a pointer. A character can only be typed if the pointer is pointing to that character. The pointer is initially pointing to the character .Each second, you may perf原创 2023-10-20 00:12:17 · 615 阅读 · 0 评论 -
LeetCode --- 1971. Find if Path Exists in Graph 解题报告
并查集处理无向图联通问题原创 2023-10-09 23:19:16 · 586 阅读 · 0 评论 -
LeetCode --- 1967. Number of Strings That Appear as Substrings in Word 解题报告
Given an array of strings and a string , return the number of strings in that exist as a substring in .A substring is a contiguous sequence of characters within a string.Example 1:Input: patterns = ["a","abc","bc","d&q原创 2023-09-25 01:06:53 · 488 阅读 · 0 评论 -
LeetCode --- 1961. Check If String Is a Prefix of Array 解题报告
Given a string and an array of strings , determine whether is a prefix string of .A string is a prefix string of if can be made by concatenating the first strings in for some positive no larger than .Return if is a prefix string of , or otherwis原创 2023-09-25 00:51:33 · 297 阅读 · 0 评论 -
LeetCode --- 1957. Delete Characters to Make Fancy String 解题报告
A fancy string is a string where no three consecutive characters are equal.Given a string , delete the minimum possible number of characters from to make it fancy.Return the final string after the deletion. It can be shown that the answer will always be u原创 2023-09-24 10:55:41 · 150 阅读 · 0 评论