汽车加油问题：一辆汽车加满油后可以行驶N千米，汽车从A地开往B地，途中有K个加油站，已知AB两地距离最近一个加油站的距离以及各个加油站和之间的距离（各个加油站之间的距离不完全相等）。设计一个有效的贪心算法使沿途的加油次数最少，并指出应在哪些加油站停靠加油；-Vehicle refueling problem: Fill up the car after driving N kilometers, bound car from A to B, on the way there are K gas station, known both AB distance from the nearest gas station and various gas stations and The distance between (the distance between the various stations are not exactly equal). Design an effective greedy algorithm makes the least number of refueling along the way, and that should be what stops refueling stations