public int[] maxNumber(int[] nums1, int[] nums2, int k) {
        int[] max = new int[k];
        for (int i = 0; i <= k; i++) {
            if (nums1.length < i || nums2.length < k - i) {
                continue;
            }
            int[] a = merge(findLargest1(nums1, i), findLargest1(nums2, k - i));
            if (isGreater(a, max, 0, 0)) {
                max = a;
            }
        }
        return max;
    }
Date 03/01/2016
@author Tushar Roy

Given two arrays of length m and n with digits 0-9 representing two numbers.
Create the maximum number of length k <= m + n from digits of the two

e.g
nums1 = [3, 4, 6, 5]
nums2 = [9, 1, 2, 5, 8, 3]
k = 5
return [9, 8, 6, 5, 3]

https://leetcode.com/problems/create-maximum-number/
src/com/interview/array/MaxNumberFromTwoArray.java