WXM

890. Find and Replace PatternYou have a list of words and a pattern, and you want to know which words in words matches the pattern.A word matches the pattern if there exists a permutation of lette...

522. Longest Uncommon Subsequence IIGiven a list of strings, you need to find the longest uncommon subsequence among them. The longest uncommon subsequence is defined as the longest subsequence of o...

395. Longest Substring with At Least K Repeating CharactersFind the length of the longest substring T of a given string (consists of lowercase letters only) such that every character in T appears no...

424. Longest Repeating Character ReplacementGiven a string that consists of only uppercase English letters, you can replace any letter in the string with another letter at most k times. Find the len...

385. Mini ParserGiven a nested list of integers represented as a string, implement a parser to deserialize it.Each element is either an integer, or a list – whose elements may also be integers or ot...

880. Decoded String at IndexAn encoded string S is given. To find and write the decoded string to a tape, the encoded string is read one character at a time and the following steps are taken:If the...

68. Text JustificationGiven an array of words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right) justified.You should pack your w...

（自己开发的博客，欢迎访问）https://www.weiboke.online316. Remove Duplicate LettersGiven a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. Yo...

10. Regular Expression MatchingGiven an input string (s) and a pattern §, implement regular expression matching with support for ‘.’ and ‘*’.‘.’ Matches any single character.‘*’ Matches zero or mor...