原题链接在这里：https: leetcode.com problems smallest subsequence of distinct characters 题目： Return the lexicographically smallest subsequence oftextthat contains all the distinct characters oftextexactly onc ...
2019-12-03 13:44 0 254 推荐指数：
Return the lexicographically smallest subsequence of s that contains all the distinct characters of s exactly once. Note: This question ...
/strengthen/LeetCode➤原文地址：https://www.cnblogs.com/streng ...
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 ...
Given a string, find the length of the longest substring T that contains at most k distinct characters. Example 1: Example ...
Given a string s , find the length of the longest substring t that contains at most 2 distinct characters. Example 1: Example 2: 这道题给我 ...
Given a string S, find the length of the longest substring T that contains at most two distinct characters.For example,Given S = "eceba",T is "ece ...
原题链接在这里：https://leetcode.com/problems/smallest-common-region/ 题目： You are given some lists of regions where the first region of each list includes ...
) of the string. You can swap the characters at any pair ...
