编程测试-走路与打车所用时间最短

最新推荐文章于 2021-02-26 09:16:48 发布

原创最新推荐文章于 2021-02-26 09:16:48 发布 · 525 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#编程 #测试

程序员代码面试同时被 2 个专栏收录

24 篇文章

订阅专栏

面试

24 篇文章

订阅专栏

本文介绍了一个计算从起点到终点的最短行程时间的Java程序。该程序通过输入多个站点的坐标，计算步行时间和打车时间，进而得出两种出行方式的总用时，并输出最短时间。涉及的主要步骤包括读取输入数据、计算距离和时间。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

import java.util.Scanner;

public class ShortTime {

    public static void main(String[] args) {

        int[] destination = new int[2];
        int walkTime, taxiTime,minTime;
        Scanner input = new Scanner(System.in);
        //打车点为num
        int stationNumber = input.nextInt();
        int[] x = new int[stationNumber];
        int[] y = new int[stationNumber];
        System.out.println("1s");
        while(input.hasNext()){
            System.out.println("2s");
            for(int i =0; i < stationNumber; i++){
                System.out.println("t");
                x[i] = input.nextInt();
                System.out.println("d");
            }
            break;
        }
        System.out.println("sex");
        while(input.hasNext()){

            for(int i = 0; i< stationNumber;i++){
                y[i] = input.nextInt();
            }
//          destination[0] = input.nextInt();
//          destination[1] = input.nextInt();
//          walkTime = input.nextInt();
//          taxiTime = input.nextInt();

            break;
        }
        destination[0] = input.nextInt();
        destination[1] = input.nextInt();
        walkTime = input.nextInt();
        taxiTime = input.nextInt();
        int minTotalTime = getMinTime(x, y, destination, walkTime, taxiTime);
        System.out.println("\n");
        System.out.println(minTotalTime);
    }

    public static int getMinTime(int[]x ,int[]y, int[] destination, int walkTime, int taxiTime){
        //1、walktime
        //int totalDistance = x[x.length - 1] - x[0] + y[y.length-1] - y[0];

        //int totalWalkTime = totalDistance * walkTime;
        int totalWalkTime = (Math.abs(destination[0]) + Math.abs(destination[1])) * walkTime;
        //
        int minStationDistance = 0, k = 0,min = Math.abs(x[0])+Math.abs(y[0]); int totalMinTime = 0;
        int[] minStation = new int[2];
        for(int i =0; i<x.length; i++){

            int sum = Math.abs(x[i])+Math.abs(y[i]);

            if(sum <= min){
                min = sum;
                minStation[0] = x[i];
                minStation[1] = y[i];
            }
            //temp = sum;
        }
        int walkStationTime = min * walkTime;
        int taxiTime2 = (Math.abs(destination[1] - minStation[1]) + Math.abs(destination[0] - minStation[0])) *taxiTime;  
        int totalTime2 =  walkStationTime + taxiTime2;
        if(totalWalkTime < totalTime2){
            totalMinTime = totalWalkTime;
        }else{
            totalMinTime = totalTime2;
        }
        return totalMinTime;

    }

}