gtalk现在怎么必须用WIFI才能视频了?# PDA - 掌中宝
B*1
1 楼
Given an input array of integers of size n, and a query array of integers of
size k, find the smallest window of input array that contains all the
elements of query array and also in the same order.
如果不要求保持order,ihas1337上面有解法,如果要保持order,怎么做才最好呢。
是不是最好应该是O(n)呢?
size k, find the smallest window of input array that contains all the
elements of query array and also in the same order.
如果不要求保持order,ihas1337上面有解法,如果要保持order,怎么做才最好呢。
是不是最好应该是O(n)呢?