Golang Leetcode 378. Kth Smallest Element in a Sorted Matrix.go

思路

二分查找，查找的同时计算个数

code

func kthSmallest(matrix [][]int, k int) int {
	if len(matrix) == 0 {
		return 0
	}
	m := len(matrix)
	low, high := matrix[0][0], matrix[m-1][m-1]
	for low < high {
		mid := (low + high) / 2
		cc := helper(matrix, mid)
		if cc < k {
			low = mid + 1
		} else {
			high = mid
		}
	}
	return low
}
func helper(matrix [][]int, target int) int {
	c := 0
	i, j := len(matrix)-1, 0
	for i >= 0 && j <= len(matrix)-1 {
		if matrix[i][j] <= target {
			j++
			c += i + 1
		} else {
			i--
		}
	}
	return c
}

更多内容请移步我的repo：https://github.com/anakin/golang-leetcode