1-D set cover optimisation with connected subsets
The leftmost point must be covered by some interval. There is no harm in picking the longest interval that covers the leftmost point. Then iterate (after removing the interval and all covered points from the instance).

This is the well-known greedy algorithm for the "Interval Point Cover" problem;
see for instance the course page by Andranik Mirzaian for a full analysis.