private boolean isGreater(int[] a, int[] b, int i, int j) {
        while (i < a.length && j < b.length) {
            if (a[i] > b[j]) {
                return true;
            } else if (a[i] < b[j]) {
                return false;
            }
            i++;
            j++;
        }
        return j == b.length;
    }
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