Problem Statement

Drone Delivery Description You're planning drone deliveries down a long, straight warehouse aisle. The aisle is modeled as a number line running from position 0 to position target ( target > 0 ). Charging stations sit at various points along this aisle, given by the array stations , where stations[i] is the position of the ith station. Every drone has just enough battery to cover 10 units of distance once fully charged. For instance, a drone charged at position 12 can fly onward to any of positions 12, 13, 14, ..., up through position 22 (inclusive), but position 23 is out of its reach without a recharge. Your delivery process works like this: Carry the cargo on foot from wherever you currently stand to the closest charging station up ahead. If no stations remain ahead, walk the cargo all the way to the target instead. Launch a freshly charged drone from that station and let it carry the cargo as far toward the target as its battery allows. If the target still hasn't been reached, walk