leetcode 378 有序矩阵中第K小的元素

最新推荐文章于 2024-10-01 05:04:32 发布

雾散了来我身边

最新推荐文章于 2024-10-01 05:04:32 发布

阅读量47

点赞数

分类专栏： leetcode 文章标签： leetcode 矩阵算法

本文链接：https://blog.csdn.net/hanhanhanha1/article/details/133267185

版权

leetcode 专栏收录该内容

45 篇文章 0 订阅

订阅专栏

二分排序

class Solution {
    public int kthSmallest(int[][] matrix, int k) {
        //二分法合并
        int left = 0,right = matrix.length - 1;
        int mid = (left + right) / 2;
        int[] result = twoMerge(matrix,left,right);
        return result[k - 1];
    }

    private int[] twoMerge(int[][] matrix, int left, int right) {
        //递归终止，当left = right
        if (left == right)
            return matrix[left];
        int mid = (left + right) / 2;
        return merge(twoMerge(matrix,left,mid),twoMerge(matrix,mid + 1,right));
    }

    private int[] merge(int[] ints, int[] ints1) {
        int length1 = ints.length;
        int length2 = ints1.length;
        int index = 0,index1 = 0,index2 = 0;
        int[] result = new int[length1 + length2];
        while (index1 < length1 && index2 < length2){
            if (ints[index1] <= ints1[index2]){
                result[index++] = ints[index1];
                index1++;
            }
            else{
                result[index++] = ints1[index2];
                index2++;
            }
        }
        while (index1 < length1)
            result[index++] = ints[index1++];
        while (index2 < length2)
            result[index++] = ints1[index2++];
        return result;
    }
}