Maximum White Tiles Covered by a Carpet
You are given a 2D integer array tiles where tiles[i] = [li, ri] represents that every tile j in the range li <= j <= ri is colored white.
You are also given an integer carpetLen, the length of a single carpet that can be placed anywhere.
Return the maximum number of white tiles that can be covered by the carpet.
Example 1
Input
tiles = [[1,5],[10,11],[12,18],[20,25],[30,32]], carpetLen = 10Output
9Place the carpet starting on tile 10; it covers 9 white tiles, and it can be shown that no placement covers more than 9 white tiles.
Example 2
Input
tiles = [[10,11],[1,1]], carpetLen = 2Output
2Place the carpet starting on tile 10; it covers 2 white tiles, so return 2.
Constraints
- 1 <= tiles.length <= 5 * 10^4
- tiles[i].length == 2
- 1 <= li <= ri <= 10^9
- 1 <= carpetLen <= 10^9
- The tiles are non-overlapping.