C++|| Easy Solution || Best Approach || 🔥🔥
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   int maxNonDecreasingLength(vector<int>& nums1, vector<int>& nums2) {\n        int n = nums1.size();\n       // making dp vector\n        vector<vector<int>> dp(n, vector<int>(2));\n        int ans = 0;\n        for (int i = 0; i < n; i++) {\n            dp[i][0] = dp[i][1] = 1;\n            if (i>0) {\n                if (nums1[i] >= nums1[i - 1])\n                dp[i][0] = dp[i - 1][0] + 1;\n                if (nums1[i] >= nums2[i - 1])\n                dp[i][0] = max(dp[i][0], dp[i - 1][1] + 1);\n                if (nums2[i] >= nums1[i - 1])\n                dp[i][1] = dp[i - 1][0] + 1;\n                if (nums2[i] >= nums2[i - 1])\n                dp[i][1] = max(dp[i][1], dp[i - 1][1] + 1);\n            }\n            ans = max(ans, max(dp[i][0], dp[i][1]));\n        }\n        return ans;\n    }\n};\n```
['C++']