LeetCode Median of Two Sorted Arrays

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)).

public class Solution {
    public double findMedianSortedArrays(int A[], int B[]) {
        int la=A.length;
        int lb=B.length;
        int l=la+lb;
        int ia=0,ib=0;
        ArrayList<Integer> list = new ArrayList<Integer>();
        for (int i = 0; i < l; i++) {
            if (ia < la && ib < lb) {
                if (A[ia] < B[ib]) {
                    list.add(A[ia]);
                    ++ia;
                } else {
                    list.add(B[ib]);
                    ++ib;
                }
            }else if (ia >= la && ib < lb) {
                list.add(B[ib]);
                ++ib;
            }else if (ia < la && ib >= lb) {
                list.add(A[ia]);
                ++ia;
            }

            if (list.size() == l / 2 + 1) {
                if (l % 2 == 1) {
                    return list.get(list.size() - 1);
                } else {
                    double last1 = list.get(list.size() - 1);
                    double last2 = list.get(list.size() - 2);
                    return (last1 + last2) / 2;
                }
            }
            
            
        } 

        return 0;

    }
}