interval covering problem: output the minimum set of points that covers all of the input point

Question

Problem Description

given an array of cherry tree location on the road sorted in ascending order, say [1,4,8,17,21], we want to build minimum amount of stalls to se