Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 9 additions & 0 deletions src/main/java/Car.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,9 @@
public class Car {
String name;
int speed;

Car(String name, int speed) {
this.name = name;
this.speed = speed;
}
}
44 changes: 43 additions & 1 deletion src/main/java/Main.java
Original file line number Diff line number Diff line change
@@ -1,6 +1,48 @@
import java.util.Scanner;

public class Main {

public static void main(String[] args) {
System.out.println("Hello world!");
Car[] cars = fillCarsArray();
Race race = new Race();
String winnerName = race.getWinner(cars).name;
System.out.println("\nСамая быстрая машина: " + winnerName);
}

public static Car[] fillCarsArray () {
Scanner scanner = new Scanner(System.in);
Car[] cars = new Car[3];
int speed;
String name;
for (int i = 0; i < cars.length; i++) {
while (true) {
System.out.print("\nВведите название " + (i + 1) + "-го автомобиля: ");
name = scanner.nextLine();
name = name.trim();
if (!name.isEmpty()) {
break;
}
System.out.print("Вы не ввели название автомобиля. Попробуйте еще раз.");
}
while (true) {
System.out.print("Введите скорость " + (i + 1) + "-го автомобиля: ");
if (scanner.hasNextInt()) {
speed = scanner.nextInt();
if (speed > 0 && speed <= 250) {
scanner.nextLine();
break;
} else {
System.out.print("Скорость автомобиля должна быть в диапозоне (0; 250]. ");
}
scanner.nextLine();
} else {
scanner.nextLine();
}
System.out.println("Вы неправильно ввели скорость " + (i + 1) + "-го автомобиля. Попробуйте еще раз.");
}
cars[i] = new Car(name, speed);
}
scanner.close();
return cars;
}
}
20 changes: 20 additions & 0 deletions src/main/java/Race.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
public class Race {
int time = 24;
int maxDistance;
Car winner;

int[] distances = new int[3];


Car getWinner(Car[] cars) {
for(int i = 0; i < distances.length; i++) {
distances[i] = time * cars[i].speed;
if (distances[i] > maxDistance) {
maxDistance = distances[i];
winner = cars[i];
}
}
return winner;
}

}