3111. 覆盖所有点的最少矩形数目

覆盖所有点的最少矩形数目

• 难度: medium
• 原始链接: https://leetcode.cn/problems/minimum-rectangles-to-cover-points
• 标签: 排序, 贪心

解法一: 排序, 贪心

go

func minRectanglesToCoverPoints(points [][]int, w int) int {
  sort.Slice(points, func(i, j int) bool {
    return points[i][0] <= points[j][0]
  })
  pre := -w - 1
  ans := 0
  for _, point := range points {
    if point[0]-pre > w {
      ans++
      pre = point[0]
    }
  }
  return ans
}