[Java] Easy 100% solution
java []\nclass Solution {\n    public int distanceBetweenBusStops(final int[] distance, final int start, final int destination) {\n        if(start == destinati
```java []\nclass Solution {\n    public int distanceBetweenBusStops(final int[] distance, final int start, final int destination) {\n        if(start == destination)\n            return 0;\n\n        final int n = distance.length;\n\n        int d = distance[start], right = Integer.MAX_VALUE, i = (start + 1) % n;\n\n        while(i != start) {\n            if(i == destination) {\n                right = d;\n                d = 0;\n            }\n\n            d += distance[i];\n\n            i++;\n            i %= n;\n        }\n\n        return Math.min(d, right);\n    }\n}\n```
['Java']