LeetCode Weekly Contest 3是LeetCode举办的第二场正式周赛,共4道题目,比赛时长2.5小时。
比赛链接:https://leetcode.com/contest/leetcode-weekly-contest-3/
题解列表:
LeetCode 393. UTF-8 Validation
LeetCode 395. Longest Substring with At Least K Repeating Characters
LeetCode Weekly Contest 3是LeetCode举办的第二场正式周赛,共4道题目,比赛时长2.5小时。
比赛链接:https://leetcode.com/contest/leetcode-weekly-contest-3/
题解列表:
LeetCode 393. UTF-8 Validation
LeetCode 395. Longest Substring with At Least K Repeating Characters
LeetCode 395. Longest Substring with At Least K Repeating Characters
Find the length of the longest substring T of a given string (consists of lowercase letters only) such that every character in T appears no less than k times ...
Given an encoded string, return it's decoded string.
The encoding rule is: k[encoded_string]
, where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is guaranteed to be a ...
LeetCode 393. UTF-8 Validation
A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules:
A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules:
Given a string s and a string t, check if s is subsequence of t.
You may assume that there is only lower case English letters in both s and t. t is potentially a ...