Categorygithub.com/szhou12/leetcode-goleetcode2771-Longest-Non-decreasing-Subarray-From-Two-Arrays
package
0.0.0-20241220224003-b7cf03a90b2b
Repository: https://github.com/szhou12/leetcode-go.git
Documentation: pkg.go.dev
Overview
Dependencies
0
Dependents
0

# README

2771. Longest Non-decreasing Subarray From Two Arrays

Solution idea

2-D DP

  1. 比较容易的题。
    1. max subarray length: “回头看，另起炉灶”
    2. DP第二维表示两种情况分类讨论：i位取较小的值；i位取较大的值。

Time complexity = $O(n)$