LeetCode 4. Median of Two Sorted Arrays

public class Solution {
public double findMedianSortedArrays(int[] nums1, int[] nums2) {
int [] numsum=new int [nums1.length+nums2.length];
int i=0;
int j=0;
int k=0;
while(i<nums1.length && j<nums2.length )
{
if(nums1[i]<=nums2[j]){
numsum[k++]=nums1[i++];
}else {
numsum[k++]=nums2[j++];
}
}
while(i<nums1.length){
numsum[k++]=nums1[i++];
}
while(j<nums2.length){
numsum[k++]=nums2[j++];
}
if(numsum.length%2!=0)
{
return numsum[numsum.length/2];
}else{
return (numsum[numsum.length/2]+numsum[numsum.length/2-1])/2.0;
}

}
}