Merge remote-tracking branch 'origin/practiks-6-10' into practiks-6-10

# Conflicts:
#	pom.xml

Author: juliavlv

students/23K0362/23K0362-p20/src/main/java/mirea/lab20/task4/Calculator.java renamed to PROCS.TXT

@@ -0,0 +1,13 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://maven.apache.org/POM/4.0.0"
+         xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
+    <modelVersion>4.0.0</modelVersion>
+    <parent>
+        <artifactId>23F0011</artifactId>
+        <groupId>ru.mirea.practice</groupId>
+        <version>2024.1</version>
+        <relativePath>../pom.xml</relativePath>
+    </parent>
+    <artifactId>23F0011-p21</artifactId>
+    <description>Массивы</description>
+</project>

students/23F0011/23F0011-p21/pom.xml

@@ -0,0 +1,14 @@
+package ru.mirea.practice.s23f0011.task1;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public abstract class Example {
+    public static <E> List<E> convertArrayToList(E[] elements) {
+        List<E> resultList = new ArrayList<>(elements.length);
+        for (E element : elements) {
+            resultList.add(element);
+        }
+        return resultList;
+    }
+}

students/23F0011/23F0011-p21/src/main/java/ru/mirea/practice/s23f0011/task1/Example.java

@@ -0,0 +1,15 @@
+package ru.mirea.practice.s23f0011.task1;
+
+import java.util.List;
+
+import static ru.mirea.practice.s23f0011.task1.Example.convertArrayToList;
+
+public abstract class Tester {
+    public static void main(String[] args) {
+        Integer[] numbers = {1, 2, 3, 4, 5};
+        List<Integer> numberList = convertArrayToList(numbers);
+        System.out.println(numberList);
+
+        Integer[] emptyArray = new Integer[10];
+    }
+}

students/23F0011/23F0011-p21/src/main/java/ru/mirea/practice/s23f0011/task1/Tester.java

@@ -0,0 +1,26 @@
+package ru.mirea.practice.s23f0011.task2andtask3;
+
+import java.util.Arrays;
+
+public class Example<T> {
+    private final T[] array;
+    private final int length;
+
+    Example(T[] array) {
+        this.array = array;
+        this.length = array.length;
+    }
+
+    public T get(int index) {
+        return array[index];
+    }
+
+    public int getLength() {
+        return length;
+    }
+
+    @Override
+    public String toString() {
+        return Arrays.toString(array);
+    }
+}

students/23F0011/23F0011-p21/src/main/java/ru/mirea/practice/s23f0011/task2andtask3/Example.java

@@ -0,0 +1,10 @@
+package ru.mirea.practice.s23f0011.task2andtask3;
+
+public abstract class Tester {
+    public static void main(String[] args) {
+        Integer[] arr = {5, 4, 3, 2, 1};
+        Example<Integer> array = new Example<>(arr);
+        System.out.println(array);
+    }
+}
+

students/23F0011/23F0011-p21/src/main/java/ru/mirea/practice/s23f0011/task2andtask3/Tester.java

@@ -0,0 +1,13 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://maven.apache.org/POM/4.0.0"
+         xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
+    <modelVersion>4.0.0</modelVersion>
+    <parent>
+        <artifactId>23F0011</artifactId>
+        <groupId>ru.mirea.practice</groupId>
+        <version>2024.1</version>
+        <relativePath>../pom.xml</relativePath>
+    </parent>
+    <artifactId>23F0011-p22</artifactId>
+    <description>Массивы</description>
+</project>

students/23F0011/23F0011-p22/pom.xml

@@ -0,0 +1,62 @@
+package ru.mirea.practice.s23f0011;
+
+import java.util.StringTokenizer;
+
+public class RpnCalc {
+    private Stack stack;
+
+    public RpnCalc(int size) {
+        stack = new Stack(size);
+    }
+
+    public double evaluate(String expression) {
+        StringTokenizer tokenizer = new StringTokenizer(expression);
+
+        while (tokenizer.hasMoreTokens()) {
+            String token = tokenizer.nextToken();
+
+            if (isNumeric(token)) {
+                stack.push(Double.parseDouble(token));
+            } else {
+                performOperation(token);
+            }
+        }
+
+        return stack.pop();
+    }
+
+    private void performOperation(String operator) {
+        double secondOperand = stack.pop();
+        double firstOperand = stack.pop();
+
+        switch (operator) {
+            case "+":
+                stack.push(firstOperand + secondOperand);
+                break;
+            case "-":
+                stack.push(firstOperand - secondOperand);
+                break;
+            case "*":
+                stack.push(firstOperand * secondOperand);
+                break;
+            case "/":
+                if (secondOperand == 0) {
+                    throw new ArithmeticException("Ошибка: Деление на ноль");
+                }
+                stack.push(firstOperand / secondOperand);
+                break;
+            default:
+                throw new IllegalArgumentException("Недопустимый оператор: " + operator);
+        }
+    }
+
+    private boolean isNumeric(String str) {
+        try {
+            Double.parseDouble(str);
+            return true;
+        } catch (NumberFormatException e) {
+            return false;
+        }
+    }
+}
+

students/23F0011/23F0011-p22/src/main/java/ru/mirea/practice/s23f0011/RpnCalc.java

@@ -0,0 +1,40 @@
+package ru.mirea.practice.s23f0011;
+
+import java.util.EmptyStackException;
+
+public class Stack {
+    private int maxSize;
+    private double[] stackArray;
+    private int top;
+
+    public Stack(int size) {
+        this.maxSize = size;
+        this.stackArray = new double[maxSize];
+        this.top = -1;
+    }
+
+    public void push(double value) {
+        if (top >= maxSize - 1) {
+            throw new StackOverflowError("Стек переполнен");
+        }
+        stackArray[++top] = value;
+    }
+
+    public double pop() {
+        if (isEmpty()) {
+            throw new EmptyStackException();
+        }
+        return stackArray[top--];
+    }
+
+    public double peek() {
+        if (isEmpty()) {
+            throw new EmptyStackException();
+        }
+        return stackArray[top];
+    }
+
+    public boolean isEmpty() {
+        return top == -1;
+    }
+}

students/23F0011/23F0011-p22/src/main/java/ru/mirea/practice/s23f0011/Stack.java

@@ -0,0 +1,33 @@
+package ru.mirea.practice.s23f0011;
+
+import java.util.EmptyStackException;
+
+public abstract class Tester {
+    public static void main(String[] args) {
+        RpnCalc calculator = new RpnCalc(10);
+
+        System.out.println("5 2 + = " + calculator.evaluate("5 2 +"));
+        System.out.println("3 7 - = " + calculator.evaluate("3 7 -"));
+        System.out.println("5 7 * = " + calculator.evaluate("5 7 *"));
+        System.out.println("1 5 / = " + calculator.evaluate("1 5 /"));
+        System.out.println("8 3 + 1 * = " + calculator.evaluate("8 3 + 1 *"));
+
+        try {
+            System.out.println("5 0 / = " + calculator.evaluate("10 0 /"));
+        } catch (ArithmeticException e) {
+            System.out.println(e.getMessage());
+        }
+
+        try {
+            System.out.println("1 + = " + calculator.evaluate("1 +"));
+        } catch (EmptyStackException e) {
+            System.out.println("Невозможно убрать элемент из начала у пустого стека");
+        }
+
+        try {
+            System.out.println("6 2 % = " + calculator.evaluate("6 2 %"));
+        } catch (IllegalArgumentException e) {
+            System.out.println(e.getMessage());
+        }
+    }
+}