(Easy) Distance Between Bus Stops - LeetCode

Description:

A bus has n stops numbered from 0 to n - 1 that form a circle. We know the distance between all pairs of neighboring stops where distance[i] is the distance between the stops number i and (i + 1) % n.

The bus goes along both directions i.e. clockwise and counterclockwise.

Return the shortest distance between the given start and destination stops.

 

Example 1:

Input: distance = [1,2,3,4], start = 0, destination = 1
Output: 1
Explanation: Distance between 0 and 1 is 1 or 9, minimum is 1.

 

Example 2:

Input: distance = [1,2,3,4], start = 0, destination = 2
Output: 3
Explanation: Distance between 0 and 2 is 3 or 7, minimum is 3.

 

Example 3:

Input: distance = [1,2,3,4], start = 0, destination = 3
Output: 4
Explanation: Distance between 0 and 3 is 6 or 4, minimum is 4.

 

Constraints:

• 1 <= n <= 10^4
• distance.length == n
• 0 <= start, destination < n
• 0 <= distance[i] <= 10^4

Accepted

4,813

Submissions

8,337

 

Seen this question in a real interview before?

Solution:

class Solution {
    public int distanceBetweenBusStops(int[] distance, int start, int destination) {
        
        if(distance ==null|| distance.length ==0){
            return 0;
        }
        
        if(start == destination){
            
            return 0;
        }
          int length1 = 0;
         int length2 = 0;
        if(start<destination){
               for(int i = start; i < destination; i++){
           //System.out.print(" "+distance[i]);
            
            length1 = length1 + distance[i];    
        }
        
       // System.out.println();
       
            
            for(int i = start-1 ; i>=0; i--){
               // System.out.print(" "+distance[i]);
                length2 = length2+ distance[i];
            
            }
       //System.out.println();
        
            for(int i = distance.length-1; i>=destination ; i--){
                // System.out.print(" "+ distance[i]);
                length2 = length2 + distance[i];
            }
       // System.out.println();
        
       // System.out.println(length2+ " 2  1 "+ length1);
        
        }
        else{
           // System.out.println("check2");
               for(int i = start-1; i >= destination; i--){
           // System.out.print(" "+distance[i]);
            
            length1 = length1 + distance[i];    
        }
            
            
            for(int i = start; i<= distance.length-1; i++){
               //  System.out.println( " "+distance[i]);
                length2 = length2 + distance[i];
            }
         //   System.out.println("CHECK");
            for(int i =0; i< destination; i++){
                
                // System.out.print(" " + distance[i]);
                length2 = length2 +distance[i];
            }
            
          //  System.out.println();
            
            
        }
      
        
     
        if(length1>length2){
            return length2;
        } 
        else{
            return length1;
        }
        
    }
}

 

转载于:https://www.cnblogs.com/codingyangmao/p/11489897.html