上中位数的应用

最新推荐文章于 2023-07-28 12:15:41 发布

yqtaowhu

最新推荐文章于 2023-07-28 12:15:41 发布

阅读量793

点赞数

分类专栏： Leetcode 文章标签：中位数

本文链接：https://blog.csdn.net/taoyanqi8932/article/details/52252718

版权

Leetcode 专栏收录该内容

113 篇文章 0 订阅

订阅专栏

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int findMedianProcess(vector<int>arr1, int start1, int end1, vector<int>arr2, int start2, int end2) {
    if (end1 == start1) return min(arr1[start1], arr2[start2]);
    int mid1 = (start1 + end1) >> 1;
    int mid2 = (start2 + end2) >> 1;
    int offset = ((end1 - start1) % 2);  // ==0 为奇数 ==1 为偶数  
    if (arr1[mid1] == arr2[mid2]) return arr1[mid1];
    else if (arr1[mid1] >= arr2[mid2])
        return findMedianProcess(arr1, start1, mid1, arr2, mid2 + offset, end2);
    else return findMedianProcess(arr1, mid1 + offset, end1, arr2, start2, mid2);
}
int findKthNum(vector<int> arr1, vector<int> arr2, int kth) {
    if (kth <= 0 || kth >arr1.size() + arr2.size()) return 0;// 不存在 
    if (arr1.size() > arr2.size()) swap(arr1, arr2);
    int length1 = arr1.size(), length2 = arr2.size();
    if (kth <= length1) return findMedianProcess(arr1, 0, kth - 1, arr2, 0, kth - 1);
    else if (kth < length2) {
        if (arr2[kth - length1 - 1] >= arr1[length1 - 1])return arr2[kth - length1 - 1];
        else return  findMedianProcess(arr1, 0, length1 - 1, arr2, kth - length1, kth - 1);
    }
    else {
        if (arr2[kth - length1 - 1] >= arr1[length1 - 1])return arr2[kth - length1 - 1];
        else if (arr1[kth - length2 - 1] >= arr2[length2 - 1]) return arr1[kth - length2 - 1];
        else return  findMedianProcess(arr1, kth - length2, length1 - 1, arr2, kth - length1, length1 - 1);
    }

}
int findMedianProcess(vector<int>arr1, int start1, int end1, vector<int>arr2, int start2, int end2) {
    if (end1 == start1) return min(arr1[start1], arr2[start2]);
    int mid1 = (start1 + end1) >> 1;
    int mid2 = (start2 + end2) >> 1;
    int offset = ((end1 - start1) % 2);  // ==0 为奇数 ==1 为偶数  
    if (arr1[mid1] == arr2[mid2]) return arr1[mid1];
    else if (arr1[mid1] >= arr2[mid2])return findMedianProcess(arr1, start1, mid1, arr2, mid2 + offset, end2);
    else return findMedianProcess(arr1, mid1 + offset, end1, arr2, start2, mid2);

}
int getUpMedian(vector<int> arr1, vector<int> arr2) {
    int len1 = arr1.size(), len2 = arr2.size();
    if (len1 == 0 || len1 != len2) return -1;
    if (len1 == 1) return min(arr1[0], arr2[0]);
    int left1 = 0, right1 = len1 - 1;
    int left2 = 0, right2 = len2 - 1;
    while (left1 <= right1) {
        if (left1 == right1) return min(arr1[left1], arr2[left2]);
        int mid1 = (left1 + right1) / 2, mid2 = (left2 + right2) / 2;
        int offset = (right1 - left1) % 2;
        if (arr1[mid1] == arr2[mid2]) return arr1[mid1];
        else if (arr1[mid1]>arr2[mid2]) {
            right1 = mid1; left2 = mid2 + offset;
        }
        else {
            right2 = mid2; left1 = mid1 + offset;
        }
    }
    return 0;
}
int getKTopProcess(vector<int> s, vector<int> p, int k) {
    if (k <= 0 || k >s.size() + p.size()) return 0;// 不存在 
    if (s.size() > p.size())
        swap(s, p);
    int length1 = s.size(), length2 = p.size();
    // 如果k小于length1, 就相当于找arr1与arr2前k个元素的上中位数  
    if (k <= length1) return findMedianProcess(s, 0, k - 1, p, 0, k - 1);
    // 如果k在length1和length2 之间，那么就是取shoArr与lonArr在[k-length1,k-length1+length1-1]之间的上中位数  
    else if (k <=length2) {
        if (p[k - length1 - 1] >= s[length1 - 1])
            return p[k - length1 - 1];
        else return  findMedianProcess(s, 0, length1 - 1, p, k - length1, k - 1);
    }
    // 第三种情况k大于等于length2  都转换成了求中位数了  
    else {
        if (p[k - length1 - 1] >= s[length1 - 1])return p[k - length1 - 1];
        else if (s[k - length2 - 1] >= p[length2 - 1]) return s[k - length2 - 1];
        else return  findMedianProcess(s, k - length2, length1 - 1, p, k - length1, length2 - 1);
    }

}
int main()
{

    vector<int>v1 = { 0,0,1,1,1,3,3,3,4,4,5,5,11,11,12,13,13 };
    vector<int>v2 = { 2,8,18,25,31,31,39,40,41,44,45,47,50,50 };
    vector<int>v3 = { 3,3,3,4,4,5,5,11,11,12,13,13 };
    vector<int>v4 = { 18,25,31,31,39,40,41,44,45,47,50,50 };
//  cout << findMedianProcess(v3, 0, 11, v4, 0, 11);
    cout << getKTopProcess(v1, v2, 19);

}