[Failed] First thought of solution

Given two arrays, find the k th smallest number.
If A[k/2] < B[k/2], then A[0] … A[k/2] will be strictly less than
median; likewise B[k/2+1] … B[end] will be strictly larger than median.
So we can ignore these two parts. Search in the rest part with (k -
num1 - num2) th smallest number
[Comment] Array out of bound when looking for middle point
[Improvement] Compare array's half length with k/2. Choose smaller one
[Failed] ArrayIndexOutOfBoundsException: [], [2,3]

— len1 - 1 = -1, A[-1] out of bound
Revert "[Failed] ArrayIndexOutOfBoundsException: [], [2,3]"

This reverts commit 6440df15b2cdeca16fdd1c83646a407e6012ec27.
[Failed] If array size equals 0, then indexing will be out of bound:[], [1]
[Improvement] Move if(k==0) after index check, so that 0 size can be dealt first
[Failed] len1 - 1 out of bound for 0 size arrays
[Improvement] Added || condition to deal with size of 0
[Failed] [1], [1]: A[1] out of bound
[Failed] No idea what's solution yet
Merge pull request #1 from chinseone/MedianOfTwoSortedArrays

Median of two sorted arrays