dp
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\nO(n)\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(n)\n# Code\n```cpp []\nclass Solution {\npublic:\n    int maxNonDecreasingLength(vector<int>& nums1, vector<int>& nums2) {\n        const int n = nums1.size();\n        vector<vector<int>> dp(n, vector<int>(2, 1));\n        int res = 1;\n        for (int i = 1; i < n; ++ i)\n        {\n            if (nums1[i - 1] <= nums1[i])\n                dp[i][0] = max(dp[i][0], dp[i - 1][0] + 1);\n            if (nums2[i - 1] <= nums1[i])\n                dp[i][0] = max(dp[i][0], dp[i - 1][1] + 1);\n            if (nums1[i - 1] <= nums2[i])\n                dp[i][1] = max(dp[i][1], dp[i - 1][0] + 1);\n            if (nums2[i - 1] <= nums2[i])\n                dp[i][1] = max(dp[i][1], dp[i - 1][1] + 1);\n            res = max({res, dp[i][0], dp[i][1]});\n        }\n        return res;\n    }\n};\n```
['C++']