4. 寻找两个正序数组的中位数

最新推荐文章于 2024-05-30 20:15:33 发布

cccc楚染rrrr

最新推荐文章于 2024-05-30 20:15:33 发布

阅读量593

点赞数 13

分类专栏： LeetCode 文章标签：算法数据结构 java

本文链接：https://blog.csdn.net/qq_43606119/article/details/135753152

版权

LeetCode 专栏收录该内容

206 篇文章 0 订阅

订阅专栏

背吧

题解链接：https://leetcode.cn/problems/median-of-two-sorted-arrays/solutions/258842/xun-zhao-liang-ge-you-xu-shu-zu-de-zhong-wei-s-114

class Solution {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int n1 = nums1.length, n2 = nums2.length;
        int totalLength = n1 + n2;
        double ans;
        if (totalLength % 2 == 1) {
            int midIndex = totalLength / 2;
            // 注意midIndex要+1
            ans = getKthElement(nums1, nums2, midIndex + 1);
        } else {
            int midIndex1 = totalLength / 2 - 1, midIndex2 = totalLength / 2;
            // 注意midIndex要+1
            ans = (getKthElement(nums1, nums2, midIndex1 + 1) + getKthElement(nums1, nums2, midIndex2 + 1)) / 2;
        }
        return ans;
    }
    public double getKthElement(int[] nums1, int[] nums2, int k) {
        int n1 = nums1.length, n2 = nums2.length;
        int index1 = 0, index2 = 0;
        
        while (true) {
            if (index1 == n1) return nums2[index2 + k - 1];
            if (index2 == n2) return nums1[index1 + k - 1];
            if (k == 1) return Math.min(nums1[index1], nums2[index2]);
            int half = k / 2;
            int newIndex1 = Math.min(index1 + half, n1) - 1;
            int newIndex2 = Math.min(index2 + half, n2) - 1;
            if (nums1[newIndex1] <= nums2[newIndex2]) {
                k -= (newIndex1 - index1 + 1);
                index1 = newIndex1 + 1;
            } else {
                k -= (newIndex2 - index2 + 1);
                index2 = newIndex2 + 1;
            }
        }
    }
}