- 博客(3)
- 收藏
- 关注
原创 792. Number of Matching Subsequences
Given string S and a dictionary of words words, find the number of words[i] that is a subsequence of S.Example : Input: S = "abcde" words = ["a", "bb", "acd", "ace"] Output: 3 Explanation: There are ...
2018-05-31 15:06:38 223
原创 743. Network Delay Time
There are N network nodes, labelled 1 to N.Given times, a list of travel times as directed edges times[i] = (u, v, w), where u is the source node, v is the target node, and w is the time it takes for ...
2018-05-28 11:34:39 171
原创 752. Open the Lock
You have a lock in front of you with 4 circular wheels. Each wheel has 10 slots: '0', '1', '2', '3', '4', '5', '6', '7', '8', '9'. The wheels can rotate freely and wrap around: for example we can turn...
2018-05-23 17:03:37 277
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人