Median of Two Sorted Arrays

There are two sorted arrays nums1 and nums2 of size m and n respectively.

Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

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