[Python3] greedy
Please pull this commit for solutions of biweekly 128 in C++, Java, Python3, Javascript and Typescript. \n\n\nclass Solution:\n    def minRectanglesToCoverPoint
Please pull this [commit](https://github.com/gaosanyong/leetcode/commit/e74c56785533ecc9eb227637eaa124214a6c2f2d) for solutions of biweekly 128 in C++, Java, Python3, Javascript and Typescript. \n\n```\nclass Solution:\n    def minRectanglesToCoverPoints(self, points: List[List[int]], w: int) -> int:\n        ans = 0\n        prev = -inf \n        for x, _ in sorted(points): \n            if prev + w < x: \n                ans += 1\n                prev = x \n        return ans \n```
['Python3']