_1184.java

packagecom.fishercoder.solutions.secondthousand;

publicclass_1184 {
publicstaticclassSolution1 {
publicintdistanceBetweenBusStops(int[] distance, intstart, intdestination) {
if (start > destination) {
inttmp = start;
start = destination;
destination = tmp;
 }
intclockwise = 0;
for (inti = start; i < destination; i++) {
clockwise += distance[i];
 }
intcounterClockwise = 0;
for (inti = destination; i < distance.length; i++) {
counterClockwise += distance[i];
 }
for (inti = 0; i < start; i++) {
counterClockwise += distance[i];
 }

returnMath.min(clockwise, counterClockwise);
 }
 }
}