2019年4月30日
916. Word Subsets
摘要： We are given two arrays A and B of words. Each word is a string of lowercase letters. Now, say that word b is a subset of word a if every letter in b  阅读全文
posted @ 2019-04-30 20:48 Veritas_des_Liberty 阅读(217) 评论(0) 推荐(0)
899. Orderly Queue
摘要： A string S of lowercase letters is given. Then, we may make any number of moves. In each move, we choose one of the first K letters (starting from the 阅读全文
posted @ 2019-04-30 18:00 Veritas_des_Liberty 阅读(295) 评论(0) 推荐(0)