题解 | #牛的体重排序#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param weightsA int整型vector 
     * @param weightsB int整型vector 
     * @return double浮点型
     */
    double findMedianSortedArrays(vector<int>& weightsA, vector<int>& weightsB) {
        // write code here
        int m=weightsA.size(),n=weightsB.size();
        for (int i=0;i<n;i++){
            weightsA.push_back(weightsB[i]);
        }
        sort(weightsA.begin(),weightsA.end());
        int mid = 0;
        if ((m+n)%2==0) {
            mid = (m+n)/2;
            return (float(weightsA[mid-1]+weightsA[mid])/2);
        } 
        else {
            mid = (m+n)/2;
            return (float(weightsA[mid]));
        }
    }
};