2019年1月8日

Leetcode 727. Minimum Window Subsequence

摘要： Problem: 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 that 阅读全文

posted @ 2019-01-08 14:06 周浩炜 阅读(444) 评论(0) 推荐(0) 编辑

Leetcode 815. Bus Routes

摘要： Problem: We have a list of bus routes. Each routes[i] is a bus route that the i-th bus repeats forever. For example if routes[0] = [1, 5, 7], this mea 阅读全文

posted @ 2019-01-08 12:34 周浩炜 阅读(177) 评论(0) 推荐(0) 编辑

Leetcode 568. Maximum Vacation Days

摘要： Problem: LeetCode wants to give one of its best employees the option to travel among N cities to collect algorithm problems. But all work and no play 阅读全文

posted @ 2019-01-08 12:19 周浩炜 阅读(286) 评论(0) 推荐(0) 编辑

导航