原题链接在这里：https: leetcode.com problems find k length substrings with no repeated characters 题目： Given a stringS, return the number of substrings of lengthKwith no repeated characters. Example : Example ...
2019-12-04 08:21 0 281 推荐指数：
题目如下： Given an array of strings arr. String s is a concatenation of a sub-sequence of arr which have unique characters. Return the maximum ...
原题链接在这里：https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters/ 题目： Given an array of strings arr. String s ...
Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays. Example 1: Note: 1 <= len ...
Let's define a function `countUniqueChars(s)` that returns the number of unique characters on `s`, for example if `s = "LEETCODE"` then `"L"`, `"T ...
Given a string, your task is to count how many palindromic substrings in this string. The substrings with different start indexes or end indexes ...
Given an array A of strings made only from lowercase letters, return a list of all characters that show up in all strings within the list ...
Given a string, find the length of the longest substring T that contains at most k distinct characters. Example 1: Example ...
395. Longest Substring with At least K Repeating Characters Find the length of the longest substring T of a given string (consists of lowercase ...
