lintcode:Longest Increasing Continuous subsequence II

最新推荐文章于 2023-09-01 12:41:13 发布

martin_liang

最新推荐文章于 2023-09-01 12:41:13 发布

阅读量770

点赞数

分类专栏：算法 C++/C lintcode

本文链接：https://blog.csdn.net/martin_liang/article/details/46756659

版权

算法同时被 3 个专栏收录

537 篇文章 1 订阅

订阅专栏

C++/C

504 篇文章 0 订阅

订阅专栏

lintcode

66 篇文章 0 订阅

订阅专栏

Give you an integer matrix (with row size n, column size m)，find the longest increasing continuous subsequence in this matrix. (The definition of the longest increasing continuous subsequence here can start at any row or column and go up/down/right/left any direction).

Example

Given a matrix:

[
  [1 ,2 ,3 ,4 ,5],
  [16,17,24,23,6],
  [15,18,25,22,7],
  [14,19,20,21,8],
  [13,12,11,10,9]
]

return 25

Challenge

O(nm) time and memory.

LintCode

Coding interview questions online training system

    Language
    Problem
    Ladder
    Login

Hard Longest Increasing Continuous subsequence II
19%
Accepted

Give you an integer matrix (with row size n, column size m)，find the longest increasing continuous subsequence in this matrix. (The definition of the longest increasing continuous subsequence here can start at any row or column and go up/down/right/left any direction).
Example

Given a matrix:

[
  [1 ,2 ,3 ,4 ,5],
  [16,17,24,23,6],
  [15,18,25,22,7],
  [14,19,20,21,8],
  [13,12,11,10,9]
]

return 25
Challenge

O(nm) time and memory.
Tags Expand

Related Problems Expand