-
-
-
Longest Increasing Subsequence (LIS) means a sequence containing some
elements in another sequence by the same order, and the values of
elements keeps increasing.For example, LIS of {2, 1, 4, 2, 3, 7, 4, 6}
is {1, 2, 3, 4, 6}, and its LIS length is 5. Considering an array with N
elements, what is the average time and space complexity to get the
length of LIS?
Time: N^2, Space: N^2
Time: N^2, Space: N
Time: NlogN, Space: N
Time: N, Space: N
Time: N, Space: C ...
阅读题目
单选题
经典指数
-
-
-
-
There is a sequence of n numbers 1, 2, 3,.., n and a stack which can
keep m numbers at most. Push the n numbers into the stack following the
sequence and pop out randomly. Suppose n is 2 and m is 3, the output
sequence may be 1, 2 or 2, 1, so we get 2 different sequences. Suppose n
is 7 and m is 5, please choose the output sequences of the stack:
1, 2, 3, 4, 5, 6, 7
7, 6, 5, 4, 3, 2, 1
5, 6, 4, 3, 7, 2, 1
5, 6, 4, 3, 7, 2, 1
1, 7, 6, 5, 4, 3, 2
3, 2, 1, 7, 6,5, 4 ...
阅读题目
多选题
经典指数
-
-
-
扫描后移动端查看
"微软"公司热门职位
"研发工程师"职位热门公司