mirror of
https://github.com/ASDjonok/OOP_IO-2x_2023.git
synced 2026-04-21 21:34:35 +03:00
Compare commits
8 Commits
| Author | SHA1 | Date | |
|---|---|---|---|
| 1f0c160216 | |||
| 511422ad6c | |||
| 4f86e8cf76 | |||
| 9493c4974d | |||
| 66089802cc | |||
| bbb463871e | |||
| a7a259d3c6 | |||
| 8b6da131a0 |
@@ -0,0 +1,96 @@
|
||||
import java.util.Scanner;
|
||||
|
||||
public class lab1 {
|
||||
public static void main(String[] args) {
|
||||
int C2, C3, C5;
|
||||
var C7 = 0;
|
||||
|
||||
Scanner id = new Scanner(System.in);
|
||||
System.out.print("Enter the student's ID number: ");
|
||||
int idbook = id.nextInt();
|
||||
|
||||
C2 = idbook % 2;
|
||||
C3 = idbook % 3;
|
||||
C5 = idbook % 5;
|
||||
C7 = idbook % 7;
|
||||
|
||||
String[] oper1 = {"+", "-"};
|
||||
String[] oper2 = {"*", "/", "%", "+", "-"};
|
||||
String[] oper3 = {"byte", "short", "int", "long", "char", "float", "double"};
|
||||
|
||||
int C = C3;
|
||||
|
||||
String O1 = oper1[C2];
|
||||
String O2 = oper2[C5];
|
||||
String O3 = oper3[C7];
|
||||
|
||||
System.out.println("C2 is: " + C2 + ", operation is: " + O1);
|
||||
System.out.println("C3 = " + C);
|
||||
System.out.println("C5 is: " + C5 + ", operation is: " + O2);
|
||||
System.out.println("C7 is: " + C7 + ", Type of indexes i and j is: " + O3);
|
||||
|
||||
double i = 0;
|
||||
double j = 0;
|
||||
System.out.println("\nEnter a values for lower limits (i and j) in the "+ O3+" type: ");
|
||||
switch (O3) {
|
||||
case "byte" -> {
|
||||
i = id.nextByte();
|
||||
j = id.nextByte();
|
||||
}
|
||||
case "short" -> {
|
||||
i = id.nextShort();
|
||||
j = id.nextShort();
|
||||
}
|
||||
case "int" -> {
|
||||
i = id.nextInt();
|
||||
j = id.nextInt();
|
||||
}
|
||||
case "long" -> {
|
||||
i = id.nextLong();
|
||||
j = id.nextLong();
|
||||
}
|
||||
case "char" -> {
|
||||
i = id.next().charAt(0);
|
||||
j = id.next().charAt(0);
|
||||
}
|
||||
case "float" -> {
|
||||
i = id.nextFloat();
|
||||
j = id.nextFloat();
|
||||
}
|
||||
case "double" -> {
|
||||
i = id.nextDouble();
|
||||
j = id.nextDouble();
|
||||
}
|
||||
}
|
||||
|
||||
System.out.println("The value of the created variables is: " + i + " and " + j);
|
||||
System.out.println("Enter values for top limits (n and m):");
|
||||
int n, m;
|
||||
n = id.nextInt();
|
||||
m = id.nextInt();
|
||||
|
||||
double sum = 0, res = 0, res2 = 0;
|
||||
|
||||
if ((O1.equals("-") && i + n >= C && i <= C) || i > n || j > m || (C == 0 && i == 0)) {
|
||||
System.out.println("Incorrect input, try another values");
|
||||
} else {
|
||||
for (double a = i; a <= n; a++) {
|
||||
for (double b = j; b <= m; b++) {
|
||||
switch (O1) {
|
||||
case "+" -> res = a + C;
|
||||
case "-" -> res = a - C;
|
||||
}
|
||||
switch (O2) {
|
||||
case "+" -> res2 = a + b;
|
||||
case "-" -> res2 = a - b;
|
||||
case "*" -> res2 = a * b;
|
||||
case "/" -> res2 = a / b;
|
||||
case "%" -> res2 = a % b;
|
||||
}
|
||||
sum += res2 / res;
|
||||
}
|
||||
}
|
||||
System.out.println("Sum is: " + sum);
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,76 @@
|
||||
import java.util.Scanner;
|
||||
import java.util.Random;
|
||||
|
||||
public class Lab2 {
|
||||
public static void main(String[] args) {
|
||||
int C5, C11, C7;
|
||||
int idbook = 2430;
|
||||
|
||||
C5 = idbook % 5;
|
||||
C7 = idbook % 7;
|
||||
C11 = idbook % 11;
|
||||
|
||||
System.out.println("C5 = " + C5 + " - Action between matrix is: C=a×B, a - const");
|
||||
System.out.println("C7 = " + C7 + " - The matrix elements type is: byte");
|
||||
System.out.println("C11 = " + C11 + " - The action with matrix C is: Find the matrix elements' average value");
|
||||
|
||||
Scanner sc = new Scanner(System.in);
|
||||
System.out.print("\n Enter the number of rows: ");
|
||||
int rows = sc.nextInt();
|
||||
System.out.print(" Enter the number of columns: ");
|
||||
int cols = sc.nextInt();
|
||||
int min = 0;
|
||||
int max = 0;
|
||||
boolean valid = false;
|
||||
while (!valid) {
|
||||
System.out.print("\n Enter the minimum value of the matrix numbers (-128 to 127): ");
|
||||
min = sc.nextInt();
|
||||
System.out.print(" Enter the maximum value of the matrix numbers (-128 to 127): ");
|
||||
max = sc.nextInt();
|
||||
if (min >= -128 && max <= 127 && min < max) {
|
||||
valid = true;
|
||||
} else {
|
||||
System.out.println("\nInvalid input. Please enter the values again.");
|
||||
}
|
||||
}
|
||||
byte[][] matrix = new byte[rows][cols];
|
||||
Random rand = new Random();
|
||||
for (int i = 0; i < rows; i++) {
|
||||
for (int j = 0; j < cols; j++) {
|
||||
matrix[i][j] = (byte) (rand.nextInt(max - min + 1) + min);
|
||||
}
|
||||
}
|
||||
System.out.println("\nThe matrix is:");
|
||||
for (int i = 0; i < rows; i++) {
|
||||
for (int j = 0; j < cols; j++) {
|
||||
System.out.printf(" %-5d", matrix[i][j]);
|
||||
}
|
||||
System.out.println();
|
||||
}
|
||||
|
||||
System.out.print("\nEnter the constant to multiply the matrix by: ");
|
||||
int constant = sc.nextInt();
|
||||
byte[][] multipliedMatrix = new byte[rows][cols];
|
||||
System.out.println(" The matrix multiplied by " + constant + " is:");
|
||||
for (int i = 0; i < rows; i++) {
|
||||
for (int j = 0; j < cols; j++) {
|
||||
multipliedMatrix[i][j] = (byte) (matrix[i][j] * constant);
|
||||
System.out.printf(" %-5d", multipliedMatrix[i][j]);
|
||||
}
|
||||
System.out.println();
|
||||
}
|
||||
|
||||
System.out.println("\n Press 'enter' to search for the average value of the matrix.");
|
||||
sc.nextLine();
|
||||
sc.nextLine();
|
||||
int sum = 0;
|
||||
for (int i = 0; i < rows; i++) {
|
||||
for (int j = 0; j < cols; j++) {
|
||||
sum += multipliedMatrix[i][j];
|
||||
}
|
||||
}
|
||||
double average = (double) sum / (rows * cols);
|
||||
System.out.println("The average value of the multiplied matrix is: " + average);
|
||||
}
|
||||
}
|
||||
|
||||
@@ -0,0 +1,38 @@
|
||||
import java.util.Scanner;
|
||||
|
||||
public class lab3 {
|
||||
public static void main(String[] args) {
|
||||
|
||||
int C17 = 2430 % 17;
|
||||
System.out.println("\n---------------------------------------------------------------------------------------------------------------------");
|
||||
System.out.println(" C17 = " + C17 + ", So, the task is: delete all previous occurrences of the last letter of each word of the specified text");
|
||||
System.out.println("---------------------------------------------------------------------------------------------------------------------");
|
||||
|
||||
Scanner scanner = new Scanner(System.in);
|
||||
String input = null;
|
||||
while (input == null || input.isEmpty()) {
|
||||
System.out.print("\nEnter a string: ");
|
||||
input = scanner.nextLine();
|
||||
}
|
||||
try {
|
||||
StringBuilder sb = new StringBuilder(input);
|
||||
String[] words = sb.toString().split("\\s+");
|
||||
for (int i = 0; i < words.length; i++) {
|
||||
String word = words[i];
|
||||
char lastLetter = word.charAt(word.length() - 1);
|
||||
String newWord = "";
|
||||
for (int j = 0; j < word.length() - 1; j++) {
|
||||
if (word.charAt(j) != lastLetter) {
|
||||
newWord += word.charAt(j);
|
||||
}
|
||||
}
|
||||
newWord += lastLetter;
|
||||
words[i] = newWord;
|
||||
}
|
||||
System.out.print("\nFinal string: ");
|
||||
System.out.println(String.join(" ", words));
|
||||
} catch (Exception e) {
|
||||
System.out.println("An error occurred: " + e.getMessage());
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,115 @@
|
||||
import java.util.Arrays;
|
||||
import java.util.Comparator;
|
||||
import java.util.Scanner;
|
||||
|
||||
public class Lab4 {
|
||||
|
||||
public static class Student {
|
||||
private int grBook;
|
||||
private String name;
|
||||
private int age;
|
||||
private double gpa;
|
||||
private String faculty;
|
||||
|
||||
public Student(int grBook, String name, int age, double gpa, String faculty) {
|
||||
this.grBook = grBook;
|
||||
this.name = name;
|
||||
this.age = age;
|
||||
this.gpa = gpa;
|
||||
this.faculty = faculty;
|
||||
}
|
||||
|
||||
public int getGrBook() {
|
||||
return grBook;
|
||||
}
|
||||
|
||||
public String getName() {
|
||||
return name;
|
||||
}
|
||||
|
||||
public int getAge() {
|
||||
return age;
|
||||
}
|
||||
|
||||
public double getGpa() {
|
||||
return gpa;
|
||||
}
|
||||
|
||||
public String getFaculty() {
|
||||
return faculty;
|
||||
}
|
||||
}
|
||||
|
||||
public static void main(String[] args) {
|
||||
|
||||
int C11 = 2430 % 11;
|
||||
System.out.println("\n ----------------------------------------------------------------------------------------------------------");
|
||||
System.out.println(" C11 = " + C11 + ", So, the task is: Define the student class, which consists of at least 5 fields.");
|
||||
System.out.println(" ----------------------------------------------------------------------------------------------------------");
|
||||
|
||||
Student[] students = {
|
||||
new Student(1010, "Вікторія", 21, 84.6, "ФІОТ"),
|
||||
new Student(2010, "Дарія", 20, 79.8, "РТФ"),
|
||||
new Student(3010, "Анатолій", 19, 94.3, "ХТФ"),
|
||||
new Student(4040, "Генадій", 22, 62.0, "ІХФ"),
|
||||
new Student(5050, "Борис", 18, 89.1, "ФММ")
|
||||
};
|
||||
|
||||
Scanner scanner = new Scanner(System.in);
|
||||
boolean quit = false;
|
||||
while (!quit) {
|
||||
|
||||
System.out.print("\nEnter the field to sort by (greed book, name, age, gpa, faculty) or enter 'quit' to exit: ");
|
||||
String input = scanner.nextLine();
|
||||
|
||||
if (!input.equals("greed book") && !input.equals("name") && !input.equals("age") && !input.equals("gpa") && !input.equals("faculty") && !input.equals("quit")) {
|
||||
System.out.println("Invalid field to sort by! Please enter 'grBook', 'name', 'age', 'gpa', or 'faculty'.");
|
||||
continue;
|
||||
}
|
||||
if (input.equals("quit")) {
|
||||
quit = true;
|
||||
System.out.println("Thank you for using my program:)");
|
||||
continue;
|
||||
}
|
||||
|
||||
String field = input;
|
||||
System.out.print("Enter the sort order (asc or desc): ");
|
||||
String order = scanner.nextLine();
|
||||
|
||||
if (!order.equals("asc") && !order.equals("desc")) {
|
||||
System.out.println("Invalid sort order! Please enter 'asc' or 'desc'.");
|
||||
continue;
|
||||
}
|
||||
|
||||
Comparator<Student> comparator = null;
|
||||
switch (field) {
|
||||
case "greed book":
|
||||
comparator = Comparator.comparingInt(Student::getGrBook);
|
||||
break;
|
||||
case "name":
|
||||
comparator = Comparator.comparing(Student::getName);
|
||||
break;
|
||||
case "age":
|
||||
comparator = Comparator.comparingInt(Student::getAge);
|
||||
break;
|
||||
case "gpa":
|
||||
comparator = Comparator.comparingDouble(Student::getGpa);
|
||||
break;
|
||||
case "faculty":
|
||||
comparator = Comparator.comparing(Student::getFaculty);
|
||||
break;
|
||||
}
|
||||
if (order.equals("desc")) {
|
||||
comparator = comparator.reversed();
|
||||
}
|
||||
Arrays.sort(students, comparator);
|
||||
|
||||
System.out.println("\nSorted by " + field + " (in " + order + "ending order):");
|
||||
System.out.println(String.format("%n%-15s | %-20s | %-4s | %-4s | %-10s", "Greed book", "Name", "Age", "GPA", " Faculty"));
|
||||
System.out.println("----------------------------------------------------------------");
|
||||
for (Student student : students) {
|
||||
System.out.println(String.format("%-15d | %-20s | %-4d | %-3.1f | %-10s", student.getGrBook(), student.getName(), student.getAge(), student.getGpa(), student.getFaculty()));
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -1,58 +0,0 @@
|
||||
public class Lab1 {
|
||||
public static void main(String[] args) {
|
||||
// char c = 'a' + '1';
|
||||
char c = 97;
|
||||
// char c = '1';
|
||||
System.out.println(c);
|
||||
System.out.println((int) c);
|
||||
c++;
|
||||
System.out.println(c);
|
||||
System.out.println((int) c);
|
||||
System.out.println((double)'1'/'3');
|
||||
|
||||
// System.out.println( (double) 0 / 0 );
|
||||
// System.out.println( Math.sqrt(-1) );
|
||||
double s = 0;
|
||||
/*for (int i = 1; i <= 3; i++) { // 1) ��������� � i = 1, 2) ���� � <= 3, 3) �������� 䳿 � �� �����,
|
||||
System.out.println(i); // 4) �������������� � �� 1, 5) ����������� �� ����� 2
|
||||
// s = s + i;
|
||||
s += i;
|
||||
}*/
|
||||
/*int[] array = new int[2];
|
||||
for (int i = 0; i < array.length; i++) {
|
||||
|
||||
}*/
|
||||
final int A = -3;
|
||||
final int B = 0;
|
||||
final int N = 2;
|
||||
final int M = 2;
|
||||
|
||||
final int C = 1;
|
||||
// boolean wasDivisionByZero = false;
|
||||
// todo char
|
||||
// todo[clear code] think about avoiding brackets
|
||||
if ((A <= -C && -C <= N) || (B <= 0 && 0 <= M)) {
|
||||
System.out.println("Division by zero!");
|
||||
return;
|
||||
}
|
||||
/*myLabel:*/for (int i = A; i <= N /*&& !wasDivisionByZero*/; i++) {
|
||||
/*if (i + C == 0) { // todo optimize
|
||||
System.out.println("Division by zero!");
|
||||
wasDivisionByZero = true;
|
||||
break; //todo flag vs return;
|
||||
}*/
|
||||
for (int j = B; j <= M; j++) {
|
||||
/*if (j == 0) {
|
||||
System.out.println("Division by zero!");
|
||||
return;
|
||||
// wasDivisionByZero = true;
|
||||
// break myLabel;
|
||||
}*/
|
||||
s += (double) (i / j) / (i + C);
|
||||
}
|
||||
}
|
||||
// if (!wasDivisionByZero) {
|
||||
System.out.println("s = " + s);
|
||||
// }
|
||||
}
|
||||
}
|
||||
@@ -1,26 +0,0 @@
|
||||
public class Lab2 {
|
||||
public static void main(String[] args) {
|
||||
int[] array = {1, 2, 3};
|
||||
/*for (int i = 0; i < array.length; i++) {
|
||||
if (i % 2 == 0) {
|
||||
System.out.println("!" + array[i]);
|
||||
} else {
|
||||
System.out.println("?" + array[i]);
|
||||
}
|
||||
}*/
|
||||
|
||||
for (int i = 0; i < array.length; i+=2) {
|
||||
System.out.println("!" + array[i]);
|
||||
}
|
||||
|
||||
for (int i = 1; i < array.length; i+=2) {
|
||||
System.out.println("?" + array[i]);
|
||||
}
|
||||
|
||||
// зубчасті матриці
|
||||
int[][] matrix = {
|
||||
{1, 2},
|
||||
{3}
|
||||
};
|
||||
}
|
||||
}
|
||||
+1
-28
@@ -1,35 +1,8 @@
|
||||
public class Main {
|
||||
public static void main(String[] args) {
|
||||
System.out.println(args[2]);
|
||||
System.out.println(args[1]);
|
||||
System.out.println("Hello world!");
|
||||
// System.out.println(1);
|
||||
|
||||
int a = 1;
|
||||
int b = 2;
|
||||
int c = 1;
|
||||
int d = 1;
|
||||
|
||||
System.out.println(2&1);
|
||||
System.out.println(2|1);
|
||||
int aa = 2;
|
||||
|
||||
/*if (aa) {
|
||||
|
||||
}*/
|
||||
|
||||
// System.out.println("a"&"b");
|
||||
System.out.println('a'&'b');
|
||||
|
||||
if ((a > b) & MyBooleanMethod()) {
|
||||
System.out.println("?????????????????????????");
|
||||
}
|
||||
|
||||
|
||||
}
|
||||
|
||||
static boolean MyBooleanMethod() {
|
||||
System.out.println("!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!");
|
||||
return true;
|
||||
}
|
||||
|
||||
void myFunction() {
|
||||
|
||||
@@ -2,8 +2,4 @@ package encapsulationInheritancePolymorphism.inheritance;
|
||||
|
||||
public class ElectricEngine extends Engine {
|
||||
private String batteryType;
|
||||
|
||||
/*private class Engine {
|
||||
private int power;
|
||||
}*/
|
||||
}
|
||||
|
||||
@@ -1,5 +0,0 @@
|
||||
package encapsulationInheritancePolymorphism.inheritance;
|
||||
|
||||
public class FuelEngine extends Engine {
|
||||
private String fuelType;
|
||||
}
|
||||
@@ -2,7 +2,6 @@ package encapsulationInheritancePolymorphism.inheritance;
|
||||
|
||||
public class Main {
|
||||
public static void main(String[] args) {
|
||||
ElectricEngine electricEngine = new ElectricEngine(); // створення нового об'єкту (екземпляру) класу ElectricEngine
|
||||
FuelEngine fuelEngine = new FuelEngine();
|
||||
ElectricEngine electricEngine = new ElectricEngine();
|
||||
}
|
||||
}
|
||||
|
||||
@@ -1,14 +0,0 @@
|
||||
package encapsulationInheritancePolymorphism.polymorphism;
|
||||
|
||||
public class ElectricEngine extends Engine {
|
||||
private String batteryType;
|
||||
|
||||
@Override
|
||||
public int getPower() {
|
||||
return 20;
|
||||
}
|
||||
|
||||
/*private class Engine {
|
||||
private int power;
|
||||
}*/
|
||||
}
|
||||
@@ -1,9 +0,0 @@
|
||||
package encapsulationInheritancePolymorphism.polymorphism;
|
||||
|
||||
public class Engine {
|
||||
private int power;
|
||||
|
||||
public int getPower() {
|
||||
return power;
|
||||
}
|
||||
}
|
||||
@@ -1,10 +0,0 @@
|
||||
package encapsulationInheritancePolymorphism.polymorphism;
|
||||
|
||||
public class FuelEngine extends Engine {
|
||||
private String fuelType;
|
||||
|
||||
@Override
|
||||
public int getPower() {
|
||||
return 50;
|
||||
}
|
||||
}
|
||||
@@ -1,38 +0,0 @@
|
||||
package encapsulationInheritancePolymorphism.polymorphism;
|
||||
|
||||
/*import encapsulationInheritancePolymorphism.inheritance.ElectricEngine;
|
||||
import encapsulationInheritancePolymorphism.inheritance.FuelEngine;*/
|
||||
|
||||
public class Main {
|
||||
public static void main(String[] args) {
|
||||
/*encapsulationInheritancePolymorphism.inheritance.*/ElectricEngine electricEngine = new ElectricEngine(); // створення нового об'єкту (екземпляру) класу ElectricEngine
|
||||
/*encapsulationInheritancePolymorphism.inheritance.*/FuelEngine fuelEngine = new FuelEngine();
|
||||
|
||||
Engine engine1 = fuelEngine;
|
||||
|
||||
Engine[] engines = {
|
||||
electricEngine,
|
||||
fuelEngine
|
||||
};
|
||||
|
||||
for (Engine engine : engines) {
|
||||
System.out.println(engine.getPower());
|
||||
}
|
||||
|
||||
/*for (int i = 0; i < engines.length; i++) {
|
||||
System.out.println(engines[i].getPower());
|
||||
}*/
|
||||
|
||||
// +
|
||||
int a = 1;
|
||||
int b = 1;
|
||||
int c = a + b;
|
||||
System.out.println(c);
|
||||
|
||||
|
||||
String sA = "1";
|
||||
String sB = "1";
|
||||
String sC = sA + sB;
|
||||
System.out.println(sC);
|
||||
}
|
||||
}
|
||||
@@ -1,19 +0,0 @@
|
||||
package encapsulationInheritancePolymorphism.polymorphism.enhanced;
|
||||
|
||||
public class ElectricEngine extends Engine {
|
||||
private String batteryType;
|
||||
private int chargeLevel = 9;
|
||||
private int criticalChargeLevel = 10;
|
||||
private float coefficientCriticalPowerCut = 0.1f;
|
||||
|
||||
@Override
|
||||
public int getPower() {
|
||||
return chargeLevel > criticalChargeLevel
|
||||
? super.getPower()
|
||||
: (int) (super.getPower() * coefficientCriticalPowerCut);
|
||||
}
|
||||
|
||||
/*private class Engine {
|
||||
private int power;
|
||||
}*/
|
||||
}
|
||||
@@ -1,9 +0,0 @@
|
||||
package encapsulationInheritancePolymorphism.polymorphism.enhanced;
|
||||
|
||||
public class Engine {
|
||||
private int power = 100;
|
||||
|
||||
public int getPower() {
|
||||
return power;
|
||||
}
|
||||
}
|
||||
@@ -1,10 +0,0 @@
|
||||
package encapsulationInheritancePolymorphism.polymorphism.enhanced;
|
||||
|
||||
public class FuelEngine extends Engine {
|
||||
private String fuelType;
|
||||
|
||||
/*public int getPower() {
|
||||
return 50;
|
||||
}*/
|
||||
|
||||
}
|
||||
@@ -1,28 +0,0 @@
|
||||
package encapsulationInheritancePolymorphism.polymorphism.enhanced;
|
||||
|
||||
/*import encapsulationInheritancePolymorphism.inheritance.ElectricEngine;
|
||||
import encapsulationInheritancePolymorphism.inheritance.FuelEngine;*/
|
||||
|
||||
public class Main {
|
||||
public static void main(String[] args) {
|
||||
/*encapsulationInheritancePolymorphism.inheritance.*/
|
||||
ElectricEngine electricEngine = new ElectricEngine(); // створення нового об'єкту (екземпляру) класу ElectricEngine
|
||||
/*encapsulationInheritancePolymorphism.inheritance.*/
|
||||
FuelEngine fuelEngine = new FuelEngine();
|
||||
|
||||
Engine engine1 = fuelEngine;
|
||||
|
||||
Engine[] engines = {
|
||||
electricEngine,
|
||||
fuelEngine
|
||||
};
|
||||
|
||||
for (Engine engine : engines) {
|
||||
System.out.println(engine.getPower());
|
||||
}
|
||||
|
||||
/*for (int i = 0; i < engines.length; i++) {
|
||||
System.out.println(engines[i].getPower());
|
||||
}*/
|
||||
}
|
||||
}
|
||||
-17
@@ -1,17 +0,0 @@
|
||||
package encapsulationInheritancePolymorphism.polymorphism.overload;
|
||||
|
||||
public class MyClassForOverloadExample {
|
||||
void myMethod(int a) {
|
||||
System.out.println("Integer: " + a);
|
||||
}
|
||||
|
||||
void myMethod(double a) {
|
||||
System.out.println("Double: " + a);
|
||||
}
|
||||
|
||||
public static void main(String[] args) {
|
||||
MyClassForOverloadExample overload = new MyClassForOverloadExample();
|
||||
overload.myMethod(1);
|
||||
overload.myMethod(0.1);
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user