845. Longest Mountain in Array

最新推荐文章于 2024-09-27 15:30:00 发布

就是那个党伟

最新推荐文章于 2024-09-27 15:30:00 发布

阅读量135

点赞数

分类专栏： LeetCode 文章标签： Longest Mountain in Array 845 leetcode c++

本文链接：https://blog.csdn.net/dangwei_90/article/details/102307171

版权

LeetCode 专栏收录该内容

107 篇文章 0 订阅

订阅专栏

class Solution {
public:
    int longestMountain(vector<int>& A) {
        int nlongest = 0;
        int nup = 0;
        int ndown = 0;
        
        if(A.size() <= 2)
        {
            return 0;
        }
        
        for(int n = 0; n < A.size()-1; n++)
        {           
            if(A[n] == A[n+1])
            {
                if(nup == 0)
                {
                    continue;
                }
                else if(ndown == 0)
                {
                    nup = 0;
                    continue;
                }
                else if(ndown >= nup)
                {
                    int temp = 0;
                    temp = nup + ndown + 1;
                    if(temp > nlongest)
                    {
                        nlongest = temp;
                    }
                    ndown = nup = 0;
                }
                else
                {
                    int temp = 0;
                    temp = nup + ndown + 1;
                    if(temp > nlongest)
                    {
                        nlongest = temp;
                    }
                    ndown = nup = 0;
                }
            }
            else if(A[n+1] > A[n])
            {
                if(nup == 0)
                {
                    nup++;
                    ndown = 0;
                    continue;
                }
                else if(ndown == 0)
                {
                    nup++;
                    continue;
                }
                else
                {
                    int temp = 0;
                    temp = nup + ndown + 1;
                    if(temp > nlongest)
                    {
                        nlongest = temp;
                    }
                    ndown = 0;
                    nup = 1;
                }
            }
            else if(A[n+1] < A[n])
            {
                if(nup == 0)
                {
                    ndown = 0;
                    continue;
                }
                else if(ndown == 0)
                {                   
                    ndown++;
                    int temp = 0;
                    temp = nup + ndown + 1;
                    if(temp > nlongest)
                    {
                        nlongest = temp;
                    }
                    continue;
                }
                else
                {
                    ndown++;
                    int temp = 0;
                    temp = nup + ndown + 1;
                    if(temp > nlongest)
                    {
                        nlongest = temp;
                    }
                    continue;
                }
            }
        }
        
        return nlongest;
    }
};