C++ | Easy and Simple
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 
# 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)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n  \n    int maxNonDecreasingLength(vector<int>& nums1, vector<int>& nums2) {\n        int n=nums1.size();\n        vector<vector<int>> dp(n,vector<int>(2,1));\n        int ans=1;\n        for(int i=1;i<n;i++){\n            if(nums1[i]>=nums1[i-1])dp[i][0]=max(dp[i][0],dp[i-1][0]+1);\n            if(nums1[i]>=nums2[i-1])dp[i][0]=max(dp[i][0],dp[i-1][1]+1);\n            if(nums2[i]>=nums1[i-1])dp[i][1]=max(dp[i][1],dp[i-1][0]+1);\n            if(nums2[i]>=nums2[i-1])dp[i][1]=max(dp[i][1],dp[i-1][1]+1);\nans=max({dp[i][0],dp[i][1],ans});\n        }\n       return  ans;\n    }\n};\n```
['Dynamic Programming', 'C++']