Longest monotonous consequent sub-sequence

最新推荐文章于 2024-08-05 17:54:35 发布

simplify2012

最新推荐文章于 2024-08-05 17:54:35 发布

阅读量743

点赞数

分类专栏： Interview 文章标签： c++ Dynamic Programming

本文链接：https://blog.csdn.net/u012212811/article/details/45333695

版权

Interview 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Problem: Find out the longest continuous sub-sequence.

Analysis:

This is a canonical solution. Runing from the ledt side of the given sequence, if the i+1th element is bigger or equal to the ith one, add to a temporary vector. Otherwise, the i+1th element will not increase the length of the current stored sub-sequence. Then, compare the temporary vector with the returned vector, replace the returned vector with the temporary one.

The time complexity is O(n).

Solutions:

C++:

vector<int> longest_monotonous_sequence(int seq[], int n, bool isIncreased = true)
{
    vector<int> lms;
    if(n == 0)
        return lms;

    vector<int> temp_mon_seq;
    for(int i = 0; i < n; ++i) {
        if(temp_mon_seq.empty())
            temp_mon_seq.push_back(seq[i]);
        else {
            if(isIncreased) {
                if(seq[i] >= *(temp_mon_seq.end() - 1))
                    temp_mon_seq.push_back(seq[i]);
                else {
                    if(temp_mon_seq.size() > lms.size())
                        lms = temp_mon_seq;
                    temp_mon_seq.clear();
                }
            } else {
                if(seq[i] <= *(temp_mon_seq.end() - 1))
                    temp_mon_seq.push_back(seq[i]);
                else {
                    if(temp_mon_seq.size() > lms.size())
                        lms = temp_mon_seq;
                    temp_mon_seq.clear();
                }
            }
        }
    }

    if(temp_mon_seq.size() > lms.size())
        lms = temp_mon_seq;

    return lms;
}