Python Simple Intuitive 3 Dimention Solution
\nclass Solution(object):\n    def maxNumber(self, nums1, nums2, length):\n        """\n        :type nums1: List[int]\n        :type nums2: List[int]\n        
```\nclass Solution(object):\n    def maxNumber(self, nums1, nums2, length):\n        """\n        :type nums1: List[int]\n        :type nums2: List[int]\n        :type k: int\n        :rtype: List[int]\n        """\n        if len(nums1) + len(nums2) < length:\n            return []\n    \n        dp = [[[0 for _ in xrange(length + 1)] for _ in xrange(len(nums2) + 1)] for _ in xrange(len(nums1) + 1)]\n        for k in xrange(1,length + 1):\n            for j in xrange(k,len(nums2) + 1):\n                dp[0][j][k] = max(dp[0][j - 1][k],10 * dp[0][j - 1][k - 1] + nums2[j - 1])\n            for i in xrange(k,len(nums1) + 1):\n                dp[i][0][k] = max(dp[i - 1][0][k],10 * dp[i - 1][0][k - 1] + nums1[i - 1])\n                \n            for i in xrange(1,len(nums1) + 1):\n                for j in xrange(1,len(nums2) + 1):\n                    if i + j < k:\n                        continue\n                    dp[i][j][k] = max(dp[i][j][k],dp[i - 1][j][k],dp[i][j - 1][k])\n                    dp[i][j][k] = max(dp[i][j][k],dp[i - 1][j][k - 1] * 10 + nums1[i - 1])\n                    dp[i][j][k] = max(dp[i][j][k],dp[i][j - 1][k - 1] * 10 + nums2[j - 1])\n            \n        return map(int,list(str(dp[-1][-1][-1])))\n```
[]