微信公众号：山青咏芝 shanqingyongzhi 博客园地址：山青咏芝 https: www.cnblogs.com strengthen GitHub地址：https: github.com strengthen LeetCode 原文地址：https: www.cnblogs.com strengthen p .html 如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。 原文已 ...
2019-06-09 12:29 0 484 推荐指数：
Return the lexicographically smallest subsequence of s that contains all the distinct characters of s exactly once. Note: This question ...
原题链接在这里：https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/ 题目： Return the lexicographically smallest subsequence of text ...
Q：返回字符串 text 中按字典序排列最小的子序列，该子序列包含 text 中所有不同字符一次。 示例 1： 输入："cdadabcc" 输出："adbc" 示例 2： 输入："abcd" 输出："abcd" 示例 3： 输入："ecbacba" 输出："eacb" 示例 4： 输入 ...
Given a binary tree rooted at `root`, the *depth* of each node is the shortest distance to the root ...
Given strings S and T, find the minimum (contiguous) substring W of S, so that T is a subsequence of W. If there is no such window in S ...
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 ...
all characters in T, return the empty string "". If ...
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★➤微信公众号：山青咏芝（let_us_code）➤博主域名：https://www.zengqiang.org➤GitHub地址：https://github.com/strengthen/LeetCode➤原文地址 ...
