LeetCode 2945: Find Maximum Non-decreasing Array Length Solution

Master LeetCode problem 2945 (Find Maximum Non-decreasing Array Length), a hard challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

2945. Find Maximum Non-decreasing Array Length

Hard

Array Binary Search Dynamic Programming Stack Queue Monotonic Stack Monotonic Queue

Problem Explanation

Explanation

To solve this problem, we can use dynamic programming. We will iterate through the array and for each element, we will keep track of the maximum non-decreasing length that can be achieved ending at that element. We will maintain an array dp where dp[i] represents the maximum non-decreasing length ending at index i.

For each element at index i, we will iterate from 0 to i-1 and check if we can extend the non-decreasing sequence ending at i by including the element at index j. If nums[i] >= nums[j], we can include element i and update the length accordingly.

The final answer will be the maximum value in the dp array.

Time Complexity: The time complexity of this approach is O(n^2) where n is the length of the input array nums.

Space Complexity: The space complexity is O(n) where n is the length of the input array nums.

Solution Code

class Solution {
    public int findLengthOfNonDecreasing(int[] nums) {
        int n = nums.length;
        int[] dp = new int[n];
        Arrays.fill(dp, 1);
        int maxLength = 1;

        for (int i = 1; i < n; i++) {
            for (int j = 0; j < i; j++) {
                if (nums[i] >= nums[j]) {
                    dp[i] = Math.max(dp[i], dp[j] + 1);
                }
            }
            maxLength = Math.max(maxLength, dp[i]);
        }

        return maxLength;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2945 (Find Maximum Non-decreasing Array Length)?

This page provides optimized solutions for LeetCode problem 2945 (Find Maximum Non-decreasing Array Length) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 2945 (Find Maximum Non-decreasing Array Length)?

The time complexity for LeetCode 2945 (Find Maximum Non-decreasing Array Length) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2945 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 2945 in Java, C++, or Python.

Back to LeetCode Solutions