2018 年 2月 12 日随笔档案 - 浩然119

2018年2月12日

Find minimum continuous subsequence tags

摘要： Given targetList, a list of strings representing the desired tags, and availableTagList, a list of strings representing the sequence of all available 阅读全文

posted @ 2018-02-12 20:03 浩然119 阅读(454) 评论(0) 推荐(0)

Find substring with K-1 distinct characters

摘要：参考 Find substring with K distinct characters Find substring with K distinct characters(http://www.cnblogs.com/pegasus923/p/8444653.html) Given a strin 阅读全文

posted @ 2018-02-12 16:50 浩然119 阅读(663) 评论(0) 推荐(0)

Find substring with K distinct characters

摘要： Given a string and number K, find the substrings of size K with K distinct characters. If no, output empty list. Remember to emit the duplicate substr 阅读全文

posted @ 2018-02-12 15:26 浩然119 阅读(764) 评论(0) 推荐(0)

LeetCode 763. Partition Labels

摘要： https://leetcode.com/problems/partition-labels/description/ A string S of lowercase letters is given. We want to partition this string into as many pa 阅读全文

posted @ 2018-02-12 11:15 浩然119 阅读(211) 评论(0) 推荐(0)