[Python] sort and greedy; Explained
The y does not matter as only the width is limited.\n(1) sort the points by their x values;\n(2) sweep from the first point, if the width of the current point t
The `y` does not matter as only the width is limited.\n(1) sort the points by their x values;\n(2) sweep from the first point, if the width of the current point to the start of the sweep point, we increase the rectangle count;\n(3) reset the start of sweep point\n\n```\nclass Solution:\n    def minRectanglesToCoverPoints(self, points: List[List[int]], w: int) -> int:\n        # y values does not matter\n        ans, ss = 0, None\n        for x in sorted(points):\n            if ss is not None and x[0] <= ss + w:\n                continue\n            else:\n                ans += 1\n                ss = x[0]\n        return ans\n```
['Greedy', 'Python3']