-
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 ...
阅读题目
单选题
经典指数
-
-
-
-
-
-
-
-
-
扫描后移动端查看
"微软"公司热门职位
"研发工程师"职位热门公司