Median of Two Sorted Arrays - LeetCode

There are two sorted arrays A and B 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)).

我写的太不简洁了，也没有优化，不过AC了：

更好的算法请戳这里： http://www.cnblogs.com/longdouhzt/archive/2013/03/04/2943572.html 

还有这里： http://www.programcreek.com/2012/12/leetcode-median-of-two-sorted-arrays-java/

public class Solution {
	public double getMedian(int[] numArray) {
		int index;
		double median;
		if (numArray.length % 2 == 0)
		    median = ((double)numArray[numArray.length/2] + (double)numArray[numArray.length/2 - 1])/2;
		else
		    median = (double) numArray[numArray.length/2];
		return median;
	}
public double findMedianSortedArrays(int A[], int B[]) {
        int m = A.length;
        int n = B.length;
        int n1 = 0;
        int m1 = 0;
        int flag = 0;
        int pre = 0;
        if(m == 0 && n == 0)
        	return 0;
        else if(m == 0 && n != 0){
        	return getMedian(B);
        }
        else if(m != 0 && n == 0){
        	return getMedian(A);
        }
        else if((m + n) % 2 == 1){
		for(int i = 0; i <= (m + n)/2; i++){
			if(n1 >= n){
				m1 ++;
				flag = 1;
			}
			else if(m1 >= m){
				n1 ++;
				flag = 2;
			}
			else if(A[m1] >= B[n1]){
				n1++;
				flag = 2;
			}
			else
			{
				m1++;
				flag = 1;
			}
		}
		if(flag == 1){
			m1 = m1 - 1;
			return A[m1];
		}
		else
		{
			n1 = n1 - 1;
			return B[n1];
		}
	}
	
	else{
		for(int i = 0; i < (m + n)/2; i++){
			if(n1 >= n){
			//	pre = A[m1];
				m1 ++;
				flag = 1;
			}
			else if(m1 >= m){
				//pre = B[n1];
				n1 ++;
				flag = 2;
			}
			else if(A[m1] > B[n1]){
			//	pre = B[n1];
				n1++;
				flag = 2;
			}
			else
			{
				//pre = A[m1];
				m1++;
				flag = 1;
			}
		}
		
		if(flag == 1){
			
			pre = A[m1 - 1];
		}
		else{
			pre = B[n1 - 1];
		}
		
		if(n1 >= n){
			//	pre = A[m1];
				m1 ++;
				flag = 1;
			}
			else if(m1 >= m){
				//pre = B[n1];
				n1 ++;
				flag = 2;
			}
			else if(A[m1] > B[n1]){
			//	pre = B[n1];
				n1++;
				flag = 2;
			}
			else
			{
				//pre = A[m1];
				m1++;
				flag = 1;
			}
		
		if(flag == 1){
			m1 = m1 - 1;
			return ((double)A[m1] + (double)pre)/2;
		}
		else
		{
			n1 = n1 -1;
			return ((double)B[n1] + (double)pre)/2;
		}
	}
    }

}