mirror of
https://github.com/ASDjonok/OOP_IO-2x_2023.git
synced 2026-04-21 21:34:35 +03:00
Compare commits
6 Commits
| Author | SHA1 | Date | |
|---|---|---|---|
| 4fce8c914c | |||
| 71baf63a21 | |||
| 0b16cf927b | |||
| 0ba52b8eaf | |||
| 86e06c3a5a | |||
| dca4d9f449 |
Generated
+1
-1
@@ -1,6 +1,6 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<project version="4">
|
||||
<component name="ProjectRootManager" version="2" languageLevel="JDK_18" default="true" project-jdk-name="openjdk-18" project-jdk-type="JavaSDK">
|
||||
<component name="ProjectRootManager" version="2" languageLevel="JDK_17" default="true" project-jdk-name="17" project-jdk-type="JavaSDK">
|
||||
<output url="file://$PROJECT_DIR$/out" />
|
||||
</component>
|
||||
</project>
|
||||
@@ -1,68 +0,0 @@
|
||||
import java.util.Scanner;
|
||||
import java.util.Arrays;
|
||||
import java.util.Comparator;
|
||||
|
||||
public class Lab4 {
|
||||
|
||||
public static void main(String[] args) {
|
||||
Students student1 = new Students("Максим", 22, "ФІОТ", 91, 8);
|
||||
Students students2 = new Students("Ольга", 19, "ФЕА", 34, 4);
|
||||
Students students3 = new Students("Владислав", 18, "ФММ", 55, 10);
|
||||
Students students4 = new Students("Марія", 20, "ХТФ", 11, 6);
|
||||
Students students5 = new Students("Петро", 23, "ФМФ", 78, 2);
|
||||
Students[] students = {student1, students2, students3, students4, students5};
|
||||
System.out.println("Список студентів: ");
|
||||
System.out.println(String.format("%-9s | %-3s | %-9s | %-11s | %s", "Ім'я", "Вік", "Факультет", "Номер групи", "Рівень знань(від 0 до 10)"));
|
||||
for (Students student : students) {
|
||||
System.out.println(String.format("%-9s | %-3s | %-9s | %-11s | %s", student.getName(), student.getAge(), student.getNameOfFaculty(), student.getNumberOfGroup(), student.getLvlOfKnowledge()));
|
||||
}
|
||||
Scanner scan = new Scanner(System.in);
|
||||
System.out.println("Введіть за чим сортувати: ");
|
||||
System.out.println("1 - Зростання \n2 - Спадання:");
|
||||
int incOrDec = scan.nextInt();
|
||||
System.out.println("Введіть за чим хочете сортувати: ");
|
||||
System.out.println("1 - Ім'я \n2 - Вік \n3 - Факультет\n4 - Група\n5 - Рівень знань: ");
|
||||
int num = scan.nextInt();
|
||||
if (incOrDec == 1) {
|
||||
switch (num) {
|
||||
case 1:
|
||||
Arrays.sort(students, Comparator.comparing(Students::getName));
|
||||
break;
|
||||
case 2:
|
||||
Arrays.sort(students, Comparator.comparingInt(Students::getAge));
|
||||
break;
|
||||
case 3:
|
||||
Arrays.sort(students, Comparator.comparing(Students::getNameOfFaculty));
|
||||
break;
|
||||
case 4:
|
||||
Arrays.sort(students, Comparator.comparingInt(Students::getNumberOfGroup));
|
||||
break;
|
||||
case 5:
|
||||
Arrays.sort(students, Comparator.comparingInt(Students::getLvlOfKnowledge));
|
||||
break;
|
||||
}
|
||||
} else {
|
||||
switch (num) {
|
||||
case 1:
|
||||
Arrays.sort(students, Comparator.comparing(Students::getName).reversed());
|
||||
break;
|
||||
case 2:
|
||||
Arrays.sort(students, Comparator.comparingInt(Students::getAge).reversed());
|
||||
break;
|
||||
case 3:
|
||||
Arrays.sort(students, Comparator.comparing(Students::getNameOfFaculty).reversed());
|
||||
break;
|
||||
case 4:
|
||||
Arrays.sort(students, Comparator.comparingInt(Students::getNumberOfGroup).reversed());
|
||||
break;
|
||||
case 5:
|
||||
Arrays.sort(students, Comparator.comparingInt(Students::getLvlOfKnowledge).reversed());
|
||||
break;
|
||||
}
|
||||
}
|
||||
System.out.println(String.format("%-9s | %-3s | %-9s | %-11s | %s", "Ім'я", "Вік", "Факультет", "Номер групи", "Рівень знань(від 0 до 10)"));
|
||||
for (Students student : students) {
|
||||
System.out.println(String.format("%-9s | %-3s | %-9s | %-11s | %s", student.getName(), student.getAge(), student.getNameOfFaculty(), student.getNumberOfGroup(), student.getLvlOfKnowledge()));
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -1,107 +0,0 @@
|
||||
public class Lab5 {
|
||||
public static void main(String[] args) {
|
||||
StringBuilder txt = new StringBuilder("соціальна мережа, яка є мережею мікроблогів. Дає змогу користувачам надсилати короткі текстові повідомлення (до 2802 символів, до 2017 року — до 140 символів), використовуючи SMS,");
|
||||
System.out.println("Початковий текст:");
|
||||
System.out.println(txt);
|
||||
Text text = new Text(txt);
|
||||
StringBuilder result = text.splitText();
|
||||
System.out.println("Змінений текст:");
|
||||
System.out.println(result);
|
||||
}
|
||||
}
|
||||
|
||||
class Text {
|
||||
private final StringBuilder textString;
|
||||
public Text(StringBuilder textString){
|
||||
this.textString = textString;
|
||||
}
|
||||
|
||||
public StringBuilder splitText() {
|
||||
StringBuilder result = new StringBuilder();
|
||||
String[] sentenceStrings = textString.toString().split("(?<=[?.!])\\s?");
|
||||
for (String s : sentenceStrings) {
|
||||
StringBuilder sb = new StringBuilder(s);
|
||||
Sentence sentence = new Sentence(sb);
|
||||
result.append(sentence.splitSentence());
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
class Sentence {
|
||||
private final StringBuilder sentence;
|
||||
|
||||
public Sentence(StringBuilder sentence) {
|
||||
this.sentence = sentence;
|
||||
|
||||
}
|
||||
|
||||
public StringBuilder splitSentence() {
|
||||
StringBuilder returnSentence = new StringBuilder();
|
||||
String text = sentence.toString();
|
||||
String[] words = text.split(" ");
|
||||
for (String w : words) {
|
||||
StringBuilder wb = new StringBuilder(w);
|
||||
Word word = new Word(wb);
|
||||
returnSentence.append(word.splitWord()).append(" ");
|
||||
}
|
||||
return returnSentence;
|
||||
|
||||
}
|
||||
}
|
||||
|
||||
class Word {
|
||||
private final StringBuilder word;
|
||||
|
||||
public Word(StringBuilder word) {
|
||||
this.word = word;
|
||||
}
|
||||
|
||||
public StringBuilder splitWord() {
|
||||
StringBuilder returnWord = new StringBuilder();
|
||||
String wordstring = word.toString();
|
||||
String[] letters = wordstring.split("");
|
||||
String firstLetter = wordstring.substring(0, 1);
|
||||
returnWord.append(firstLetter);
|
||||
for (String l: letters){
|
||||
StringBuilder lb = new StringBuilder(l);
|
||||
Letter letter = new Letter(lb);
|
||||
if (firstLetter.equals(letter.getLetter().toString())){
|
||||
returnWord.append("");
|
||||
}else{
|
||||
if(l.equals("!") || l.equals("?") || l.equals(".") || l.equals(",") || l.equals(":") || l.equals(";")){
|
||||
Punctuation punctuation = new Punctuation(lb);
|
||||
returnWord.append(punctuation.getPunctuation());
|
||||
}else{
|
||||
returnWord.append(letter.getLetter());
|
||||
}
|
||||
}
|
||||
}
|
||||
return returnWord;
|
||||
}
|
||||
}
|
||||
|
||||
class Letter {
|
||||
private final StringBuilder letter;
|
||||
|
||||
public Letter(StringBuilder letter) {
|
||||
this.letter = letter;
|
||||
}
|
||||
|
||||
public StringBuilder getLetter() {
|
||||
return letter;
|
||||
}
|
||||
}
|
||||
|
||||
class Punctuation {
|
||||
private final StringBuilder punctuation;
|
||||
|
||||
public Punctuation(StringBuilder punctuation) {
|
||||
this.punctuation = punctuation;
|
||||
}
|
||||
|
||||
public StringBuilder getPunctuation() {
|
||||
return punctuation;
|
||||
}
|
||||
}
|
||||
@@ -1,30 +0,0 @@
|
||||
public class Students {
|
||||
private String name;
|
||||
private int age;
|
||||
private String nameOfFaculty;
|
||||
private int numberOfGroup;
|
||||
private int lvlOfKnowledge;
|
||||
|
||||
public Students(String name, int age, String nameOfFaculty, int numberOfGroup, int lvlOfKnowledge) {
|
||||
this.name = name;
|
||||
this.age = age;
|
||||
this.nameOfFaculty = nameOfFaculty;
|
||||
this.numberOfGroup = numberOfGroup;
|
||||
this.lvlOfKnowledge = lvlOfKnowledge;
|
||||
}
|
||||
public String getName() {
|
||||
return name;
|
||||
}
|
||||
public int getAge() {
|
||||
return age;
|
||||
}
|
||||
public String getNameOfFaculty() {
|
||||
return nameOfFaculty;
|
||||
}
|
||||
public int getNumberOfGroup() {
|
||||
return numberOfGroup;
|
||||
}
|
||||
public int getLvlOfKnowledge() {
|
||||
return lvlOfKnowledge;
|
||||
}
|
||||
}
|
||||
@@ -1,29 +0,0 @@
|
||||
import java.util.Scanner;
|
||||
|
||||
public class lab1 {
|
||||
public static void main(String[] args) {
|
||||
float S = 0, i, j;
|
||||
int C = 1;
|
||||
Scanner scan = new Scanner(System.in);
|
||||
System.out.println("Введіть значення a (a>1):");
|
||||
int a = scan.nextInt();
|
||||
System.out.println("Введіть значення b:");
|
||||
int b = scan.nextInt();
|
||||
System.out.println("Введіть значення n:");
|
||||
int n = scan.nextInt();
|
||||
System.out.println("Введіть значення m:");
|
||||
int m = scan.nextInt();
|
||||
for (i = a; i <= n; i++) {
|
||||
if (i - C == 0) {
|
||||
System.out.println("Ділення на 0");
|
||||
return;
|
||||
}
|
||||
for (j = b; j <= m; j++) {
|
||||
S += (i - j) / (i - C);
|
||||
|
||||
}
|
||||
}
|
||||
System.out.println(S);
|
||||
|
||||
}
|
||||
}
|
||||
@@ -1,78 +0,0 @@
|
||||
import java.util.Scanner;
|
||||
import java.util.Random;
|
||||
|
||||
public class lab2 {
|
||||
public static void main(String[] args) {
|
||||
Scanner scan = new Scanner(System.in);
|
||||
|
||||
System.out.println("Введіть кількість рядків матриці А:");
|
||||
int mA = scan.nextInt();
|
||||
System.out.println("Введіть кількість стовпців матриці А:");
|
||||
int nA = scan.nextInt();
|
||||
System.out.println("Введіть кількість рядків матриці B:");
|
||||
int mB = scan.nextInt();
|
||||
if (nA != mB) {
|
||||
System.out.println("Щоб помножити матриці, потрібно, щоб кількість стовпців матриці А == кількості рядків матриці B");
|
||||
return;
|
||||
}
|
||||
System.out.println("Введіть кількість стовпців матриці B:");
|
||||
int nB = scan.nextInt();
|
||||
System.out.println("Границя значень у матрицях:");
|
||||
int upperbound = scan.nextShort();
|
||||
int[][] matrixA = new int[mA][nA];
|
||||
int[][] matrixB = new int[mB][nB];
|
||||
int[][] matrixC = new int[mA][nB];
|
||||
generationMatrixes(matrixA, matrixB, upperbound);
|
||||
printMatrixC(matrixA, matrixB, matrixC);
|
||||
AverageValueofElementsofEachColumn(matrixC);
|
||||
}
|
||||
|
||||
private static void AverageValueofElementsofEachColumn(int[][] matrixC) {
|
||||
System.out.println("Середнє значення елементів кожного стовпчика матриці:");
|
||||
System.out.print("||");
|
||||
for (int i = 0; i < matrixC.length; i++) {
|
||||
double sum = 0;
|
||||
for (int j = 0; j < matrixC[i].length; j++) {
|
||||
sum += matrixC[j][i];
|
||||
}
|
||||
System.out.printf(" %.2f ||", (sum) / matrixC.length);
|
||||
}
|
||||
}
|
||||
|
||||
private static void printMatrixC(int[][] matrixA, int[][] matrixB, int[][] matrixC) {
|
||||
for (int i = 0; i < matrixC.length; i++) {
|
||||
for (int j = 0; j < matrixC[i].length; j++) {
|
||||
for (int k = 0; k < matrixA[j].length; k++) {
|
||||
matrixC[i][j] += matrixA[i][k] * matrixB[k][j];
|
||||
}
|
||||
}
|
||||
}
|
||||
System.out.println("Матриця С:");
|
||||
for (int i = 0; i < matrixC.length; i++) {
|
||||
for (int j = 0; j < matrixC[i].length; j++) {
|
||||
System.out.printf("|%4d", matrixC[i][j]);
|
||||
}
|
||||
System.out.println("|");
|
||||
}
|
||||
}
|
||||
|
||||
private static void generationMatrixes(int[][] matrixA, int[][] matrixB, int upperbound) {
|
||||
Random rand = new Random();
|
||||
System.out.println("Матриця А:");
|
||||
for (short i = 0; i < matrixA.length; i++) {
|
||||
for (int j = 0; j < matrixA[i].length; j++) {
|
||||
matrixA[i][j] = rand.nextInt(upperbound);
|
||||
System.out.printf("|%4d", matrixA[i][j]);
|
||||
}
|
||||
System.out.println("|");
|
||||
}
|
||||
System.out.println("Матриця B:");
|
||||
for (short i = 0; i < matrixB.length; i++) {
|
||||
for (int j = 0; j < matrixB[i].length; j++) {
|
||||
matrixB[i][j] = rand.nextInt(upperbound);
|
||||
System.out.printf("|%4d", matrixB[i][j]);
|
||||
}
|
||||
System.out.println("|");
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -1,21 +0,0 @@
|
||||
public class lab3 {
|
||||
public static void main(String[] args) {
|
||||
StringBuilder txt = new StringBuilder("— соціальна мережа, яка є мережею мікроблогів, дає змогу користувачам надсилати короткі текстові повідомлення (до 2802 символів, до 2017 року — до 140 символів), використовуючи SMS,");
|
||||
System.out.println(txt);
|
||||
String[] words = txt.toString().split("\\s+");
|
||||
StringBuilder result = new StringBuilder();
|
||||
for (int i = 0; i < words.length; i++) {
|
||||
StringBuilder word = new StringBuilder(words[i]);
|
||||
StringBuilder firstLetter = new StringBuilder(word.substring(0, 1));
|
||||
if (word.substring(1).contains(firstLetter.toString().toLowerCase()) || word.substring(1).contains(firstLetter)) {
|
||||
String changedWord = firstLetter + word.substring(1).replaceAll(firstLetter.toString().toLowerCase(), "").replaceAll(firstLetter.toString(), "");
|
||||
result.append(changedWord);
|
||||
result.append(" ");
|
||||
} else {
|
||||
result.append(word);
|
||||
result.append(" ");
|
||||
}
|
||||
}
|
||||
System.out.println(result);
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,43 @@
|
||||
package IO_24._02_Бондаренко_Тарас_Андрійович.lab1;
|
||||
|
||||
import java.util.Scanner;
|
||||
|
||||
public class Lab1 {
|
||||
public static void main(String[] args) {
|
||||
// O1 = +
|
||||
// C = 2
|
||||
// O2 = %
|
||||
// i, j = short(-32.768 to 32.768)
|
||||
final int c = 2;
|
||||
double result = 0;
|
||||
Scanner scan = new Scanner(System.in);
|
||||
System.out.print("Enter a: ");
|
||||
int a = scan.nextInt();// Entering a
|
||||
System.out.print("Enter b: ");
|
||||
int b = scan.nextInt();// Entering b
|
||||
System.out.print("Enter n: ");
|
||||
int n = scan.nextInt();// Entering n
|
||||
System.out.print("Enter m: ");
|
||||
int m = scan.nextInt();// Entering m
|
||||
scan.close();
|
||||
|
||||
if (a <= -c && n >= -c || b <= 0 && m >= 0) {
|
||||
System.out.println("Error! Division by zero");
|
||||
return;
|
||||
}
|
||||
else if(a > n || b > m){
|
||||
result = 0;
|
||||
System.out.println(result);
|
||||
return;
|
||||
}
|
||||
|
||||
for (short i = (short) a; i <= n; i++) {
|
||||
for (short j = (short) b; j <= m; j++) {
|
||||
result += (double) (i % j) / (i + c); //Calculation of the result
|
||||
}
|
||||
}
|
||||
System.out.println("\ns = " + result); // Outputting the result
|
||||
|
||||
}
|
||||
}
|
||||
|
||||
@@ -0,0 +1,84 @@
|
||||
package IO_24._02_Бондаренко_Тарас_Андрійович.lab2;
|
||||
|
||||
import java.util.Scanner;
|
||||
|
||||
public class Lab2 {
|
||||
public static void main(String[] args) {
|
||||
// C5 = 2
|
||||
// C7 = 1
|
||||
// C11 = 4
|
||||
Scanner scan = new Scanner(System.in);
|
||||
System.out.print("Enter the number of matrix rows: ");
|
||||
int m = scan.nextInt();
|
||||
System.out.print("Enter the number of matrix columns: ");
|
||||
int n = scan.nextInt();
|
||||
|
||||
System.out.println("\nFilling matrix A:");
|
||||
byte[][] matrixA = new byte[m][n]; // Creating MxN matrix A
|
||||
scanMatrix(matrixA, scan);
|
||||
|
||||
System.out.println("\nMatrix A"); // Printing matrix A
|
||||
printMatrix(matrixA);
|
||||
|
||||
System.out.println("\nFilling matrix B:");
|
||||
byte[][] matrixB = new byte[m][n];// Creating MxN matrix B
|
||||
scanMatrix(matrixB, scan);
|
||||
|
||||
scan.close();
|
||||
|
||||
System.out.println("\nMatrix B:");// Printing matrix B
|
||||
printMatrix(matrixB);
|
||||
|
||||
System.out.println("\nMatrix C:");
|
||||
byte[][] matrixC = new byte[m][n];// Creating matrix C
|
||||
for (byte i = 0; i < m; i++) {
|
||||
for (byte j = 0; j < n; j++) {
|
||||
matrixC[i][j] = (byte) (matrixA[i][j] + matrixB[i][j]);
|
||||
System.out.print(matrixC[i][j] + "\t ");
|
||||
}
|
||||
System.out.println();
|
||||
}
|
||||
|
||||
byte evenSum = 0; // Sum for the largest numbers in even rows
|
||||
byte oddSum = 0;// Sum for the smallest numbers in even rows
|
||||
|
||||
for (byte i = 0; i < matrixC.length; i++) {
|
||||
byte largest = Byte.MIN_VALUE; // variable for largest element
|
||||
byte smallest = Byte.MAX_VALUE;// variable for smallest element
|
||||
for (byte j = 0; j < matrixC[i].length; j++) {
|
||||
if (i % 2 == 0) {
|
||||
smallest = (byte) Math.min(smallest, matrixC[i][j]);
|
||||
} else {
|
||||
largest = (byte) Math.max(largest, matrixC[i][j]);
|
||||
}
|
||||
}
|
||||
if (i % 2 == 0) {
|
||||
oddSum += smallest;
|
||||
} else {
|
||||
evenSum += largest;
|
||||
}
|
||||
}
|
||||
|
||||
System.out.println("\nSum of the biggest elements: " + evenSum);
|
||||
System.out.println("Sum of the smallest elements: " + oddSum);
|
||||
}
|
||||
|
||||
private static void scanMatrix(byte[][] matrix, Scanner scan) { //Method for filling matrix
|
||||
for (byte i = 0; i < matrix.length; i++) {
|
||||
for (byte j = 0; j < matrix[i].length; j++) {
|
||||
System.out.printf("Enter element [%d][%d]", i, i);
|
||||
matrix[i][j] = scan.nextByte();
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
private static void printMatrix(byte[][] matrix) {//Method for printing matrix
|
||||
for (byte[] row : matrix) {
|
||||
for (byte el : row) {
|
||||
System.out.print(el + "\t ");
|
||||
}
|
||||
System.out.println();
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
@@ -0,0 +1,24 @@
|
||||
package IO_24._02_Бондаренко_Тарас_Андрійович.lab3;
|
||||
|
||||
import java.util.*;
|
||||
|
||||
public class Lab3 {
|
||||
// String
|
||||
// Надрукувати слова без повторень заданого тексту в алфавітному порядку за першою літерою.
|
||||
|
||||
public static void main(String[] args) {
|
||||
String text = "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Mauris a diam maecenas sed enim ut sem viverra. Amet est placerat in egestas erat imperdiet. Sed turpis tincidunt id aliquet risus. Amet porttitor eget dolor morbi non arcu risus quis. Elementum nibh tellus molestie nunc non blandit massa. Feugiat scelerisque varius morbi enim nunc faucibus. Ipsum faucibus vitae aliquet nec ullamcorper sit amet risus nullam. Quis enim lobortis scelerisque fermentum dui faucibus in. Sem viverra aliquet eget sit amet tellus cras adipiscing enim. Sed ullamcorper morbi tincidunt ornare. Sodales ut eu sem integer vitae justo eget magna. Mi ipsum faucibus vitae aliquet nec ullamcorper.";
|
||||
String[] words = text.split("[\\p{Punct}\\s]+");
|
||||
List<String> wordList = new ArrayList<>(Arrays.asList(words));//Class ArrayList implements interface List
|
||||
// asList returns immutable list
|
||||
Set<String> wordSet = new HashSet<>(wordList);// Class HashSet implements interface Set
|
||||
wordList.clear();
|
||||
wordList.addAll(wordSet);
|
||||
wordList.sort(String::compareToIgnoreCase);
|
||||
|
||||
for (String element : wordList) {
|
||||
System.out.println(element);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
@@ -0,0 +1,34 @@
|
||||
package IO_24._02_Бондаренко_Тарас_Андрійович.lab4;
|
||||
|
||||
/**
|
||||
* Class that represents a boat with different characteristics.
|
||||
*/
|
||||
public class Boat {
|
||||
private String name;
|
||||
private int price;
|
||||
private int mass;
|
||||
private int age;
|
||||
private String type;
|
||||
|
||||
public Boat(String name, int price, int mass, int age, String type) {
|
||||
this.name = name;
|
||||
this.price = price;
|
||||
this.mass = mass;
|
||||
this.age = age;
|
||||
this.type = type;
|
||||
}
|
||||
|
||||
public String getName() {
|
||||
return name;
|
||||
}
|
||||
|
||||
public int getPrice() {
|
||||
return price;
|
||||
}
|
||||
|
||||
@Override
|
||||
public String toString() {
|
||||
return String.format("%s - %s, which was built %d years ago, with mass - %d kg, has price - %d$;",
|
||||
type, name, age, mass, price);
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,35 @@
|
||||
package IO_24._02_Бондаренко_Тарас_Андрійович.lab4;
|
||||
|
||||
import java.util.Arrays;
|
||||
import java.util.Comparator;
|
||||
import java.util.List;
|
||||
|
||||
public class Lab4 {
|
||||
public static void main(String[] args) {
|
||||
List<Boat> boatList = Arrays.asList(
|
||||
new Boat("Row V. Wave", 150000, 50000, 25, "cutter"),
|
||||
new Boat("Dirty Oar", 250000, 40000, 15, "cutter"),
|
||||
new Boat("Tumeric", 450000, 100000, 45, "cutter"),
|
||||
new Boat("Life is Good", 350000, 20000, 5, "cutter")
|
||||
);
|
||||
|
||||
boatList.sort(Comparator.comparing(Boat::getName));// comparing - method of Comparator interface
|
||||
System.out.println("Sorted by name:");
|
||||
printed(boatList);
|
||||
|
||||
boatList.sort(Comparator.comparing(Boat::getPrice).reversed());
|
||||
System.out.println("\nSorted by price in reverse order:");
|
||||
printed(boatList);
|
||||
}
|
||||
|
||||
/**
|
||||
* Print all characteristics of boats.
|
||||
*
|
||||
* @param boatList List of boats.
|
||||
*/
|
||||
public static void printed(List<Boat> boatList) {
|
||||
for (Boat boat : boatList) {
|
||||
System.out.println(boat);
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -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);
|
||||
// }
|
||||
}
|
||||
}
|
||||
-102
@@ -1,102 +0,0 @@
|
||||
public class Lab2 {
|
||||
public static void main(String[] args) {
|
||||
final int A = 2;
|
||||
final int[][] MATRIX_B = {
|
||||
{1, 202, 1, 1, 202, 3, 1, 202, 3,},
|
||||
{1, 202, 1, 1, 202, 3, 1, 202, 3,},
|
||||
{1, 1, 3, 1, 202, 3, 1, 202, 3,},
|
||||
// {4, 5, 6,},
|
||||
};
|
||||
|
||||
int[][] MATRIX_C = multiplication(A, MATRIX_B);
|
||||
|
||||
print(MATRIX_C);
|
||||
|
||||
System.out.println("Sum of smallest elements in every column: " + sumOfSmallestElementsInEveryColumn(MATRIX_C));
|
||||
|
||||
/*int[] array = {1, 2, 3};
|
||||
int[] array2 = new int[3];
|
||||
Object[] array3 = new String[3];
|
||||
System.out.println(array3[0]); //nothing, trash from the memory, null || null
|
||||
System.out.println(array2[0]); //nothing, trash from the memory, null || 0
|
||||
System.out.println(array[0]); // || 1
|
||||
|
||||
int[][] matrix2 = new int[2][3];
|
||||
matrix2[0] = new int[2];
|
||||
matrix2[1] = new int[1];
|
||||
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}
|
||||
};
|
||||
|
||||
// C=a×B, a - const
|
||||
|
||||
|
||||
// final int[][] MATRIX_C = int;
|
||||
|
||||
|
||||
MATRIX_B[0][0] = 2;
|
||||
MATRIX_B[0] = new int[]{1, 2};
|
||||
System.out.println(MATRIX_B[0][0]);
|
||||
MATRIX_B = new int[][]{
|
||||
{1, 2},
|
||||
{3}
|
||||
};*/
|
||||
}
|
||||
|
||||
private static int sumOfSmallestElementsInEveryColumn(final int[][] MATRIX_C) {
|
||||
// todo check different length of rows
|
||||
// todo try to change i and j
|
||||
// todo check repetition of minimal elements
|
||||
int sum = 0;
|
||||
for (int i = 0; i < MATRIX_C[0].length; i++) {
|
||||
int tmpSmallest = MATRIX_C[0][i];
|
||||
for (int j = 1; j < MATRIX_C.length; j++) {
|
||||
if (MATRIX_C[j][i] < tmpSmallest) {
|
||||
tmpSmallest = MATRIX_C[j][i];
|
||||
}
|
||||
}
|
||||
sum += tmpSmallest;
|
||||
}
|
||||
return sum;
|
||||
}
|
||||
|
||||
private static void print(final int[][] MATRIX_C) {
|
||||
for (int i = 0; i < MATRIX_C.length; i++) {
|
||||
for (int j = 0; j < MATRIX_C[i].length; j++) {
|
||||
// System.out.print(MATRIX_C[i][j] + "\t");//printf("%4d",
|
||||
System.out.printf("%4d ", MATRIX_C[i][j]);//printf("%4d",
|
||||
}
|
||||
System.out.println();
|
||||
}
|
||||
}
|
||||
|
||||
private static int[][] multiplication(int A, final int[][] MATRIX_B) {
|
||||
final int[][] MATRIX_C = new int[MATRIX_B.length][/*MATRIX_B[0].length*/]; // todo !!!DANGER different lengths of rows
|
||||
// final int[][] MATRIX_C = MATRIX_B;
|
||||
for (int i = 0; i < MATRIX_B.length; i++) {
|
||||
MATRIX_C[i] = new int[MATRIX_B[i].length];
|
||||
for (int j = 0; j < MATRIX_B[i].length; j++) {
|
||||
MATRIX_C[i][j] = MATRIX_B[i][j] * A;
|
||||
}
|
||||
}
|
||||
return MATRIX_C;
|
||||
}
|
||||
}
|
||||
+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() {
|
||||
|
||||
@@ -1,9 +0,0 @@
|
||||
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 Engine {
|
||||
private int power;
|
||||
}
|
||||
@@ -1,5 +0,0 @@
|
||||
package encapsulationInheritancePolymorphism.inheritance;
|
||||
|
||||
public class FuelEngine extends Engine {
|
||||
private String fuelType;
|
||||
}
|
||||
@@ -1,8 +0,0 @@
|
||||
package encapsulationInheritancePolymorphism.inheritance;
|
||||
|
||||
public class Main {
|
||||
public static void main(String[] args) {
|
||||
ElectricEngine electricEngine = new ElectricEngine(); // створення нового об'єкту (екземпляру) класу ElectricEngine
|
||||
FuelEngine fuelEngine = new FuelEngine();
|
||||
}
|
||||
}
|
||||
@@ -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