Median of Two Sorted Arrays

class Solution {
public:
double findMedianSortedArrays(int A[], int m, int B[], int n) {
double lhs=0,rhs=0;//lhs为第(m+n)/2大的数  rhs为第(m+n)/2+1大的数
//O(m+n)
int aIndex=0,bIndex=0,number=1,cur=0;
while(aIndex < m || bIndex < n)
{
if(aIndex < m && bIndex < n)
{
if(A[aIndex] <= B[bIndex])
{
cur=A[aIndex];
aIndex++;
}
else
{
cur=B[bIndex];
bIndex++;
}
}
else if(aIndex < m && bIndex >=n)
{
cur=A[aIndex];
aIndex++;
}
else
{
cur=B[bIndex];
bIndex++;
}
if(number==(m+n)/2)
{
lhs=(double)cur;
}
if(number==(m+n)/2+1)
{
rhs=(double)cur;
return ((m+n)%2)?rhs:(lhs+rhs)/2;
}
number++;
}
}
};