2020年8月6日
leetcode78 - Subsets - medium
摘要： Given a set of distinct integers, nums, return all possible subsets (the power set). Note: The solution set must not contain duplicate subsets. Exampl 阅读全文
posted @ 2020-08-06 15:13 little_veggie 阅读(133) 评论(0) 推荐(0)
leetcode340 - Longest Substring with At Most K Distinct Characters - hard
摘要： Given a string, find the length of the longest substring T that contains at most k distinct characters. Example 1: Input: s = "eceba", k = 2 Output: 3 阅读全文
posted @ 2020-08-06 07:35 little_veggie 阅读(82) 评论(0) 推荐(0)
leetcode76 - Minimum Window Substring - hard
摘要： Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). Example: Input: S = "ADOB 阅读全文
posted @ 2020-08-06 04:14 little_veggie 阅读(121) 评论(0) 推荐(0)