Лабораторная работа №21-30

Author: busind

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

@@ -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>23K9006</artifactId>
+        <groupId>ru.mirea.practice</groupId>
+        <version>2024.1</version>
+        <relativePath>../pom.xml</relativePath>
+    </parent>
+    <artifactId>23K9006-p21</artifactId>
+    <description>двадцать первое задание</description>
+</project>

students/23K9006/23K9006-p21/src/main/java/ru/mirea/practice/s0000001/1/GenericArray.java

@@ -0,0 +1,29 @@
+package ru.mirea.practice.s0000001;
+
+//второй main
+
+public class GenericArray<T> {
+    private T[] array;
+
+    public GenericArray(T[] array) {
+        this.array = array;
+    }
+
+    public T get(int index) {
+        if (index < 0 || index >= array.length) {
+            throw new IndexOutOfBoundsException("Invalid index: " + index);
+        }
+        return array[index];
+    }
+
+    public void set(int index, T value) {
+        if (index < 0 || index >= array.length) {
+            throw new IndexOutOfBoundsException("Invalid index: " + index);
+        }
+        array[index] = value;
+    }
+
+    public int size() {
+        return array.length;
+    }
+}

students/23K9006/23K9006-p21/src/main/java/ru/mirea/practice/s0000001/1/Main1.java

@@ -0,0 +1,21 @@
+package ru.mirea.practice.s0000001;
+
+import java.util.Arrays;
+import java.util.List;
+
+abstract class Main1 {
+    public static <T> List<T> convertArrayToList(T[] array) {
+        return Arrays.asList(array);
+    }
+
+    public static void main(String[] args) {
+        String[] stringArray = {"one", "two", "three"};
+        Integer[] intArray = {1, 2, 3};
+
+        List<String> stringList = convertArrayToList(stringArray);
+        List<Integer> intList = convertArrayToList(intArray);
+
+        System.out.println(stringList);
+        System.out.println(intList);
+    }
+}

students/23K9006/23K9006-p21/src/main/java/ru/mirea/practice/s0000001/1/Main2.java

@@ -0,0 +1,21 @@
+package ru.mirea.practice.s0000001;
+
+abstract class Main2 {
+    public static void main(String[] args) {
+        Integer[] intArray = {1, 2, 3, 4, 5};
+        GenericArray<Integer> genericIntArray = new GenericArray<>(intArray);
+
+        System.out.println("Элемент по индексу 2: " + genericIntArray.get(2));
+        genericIntArray.set(2, 10);
+        System.out.println("Обновленный элемент по индексу 2: " + genericIntArray.get(2));
+        System.out.println("Размер массива: " + genericIntArray.size());
+
+        String[] stringArray = {"A", "B", "C"};
+        GenericArray<String> genericStringArray = new GenericArray<>(stringArray);
+
+        System.out.println("Элемент по индексу 0: " + genericStringArray.get(0));
+        genericStringArray.set(0, "Z");
+        System.out.println("Обновленный элемент по индексу 0: " + genericStringArray.get(0));
+        System.out.println("Размер массива: " + genericStringArray.size());
+    }
+}

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

@@ -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>23K9006</artifactId>
+        <groupId>ru.mirea.practice</groupId>
+        <version>2024.1</version>
+        <relativePath>../pom.xml</relativePath>
+    </parent>
+    <artifactId>23K9006-p22</artifactId>
+    <description>двадцать второе задание</description>
+</project>

students/23K9006/23K9006-p22/src/main/java/ru/mirea/practice/s0000001/1/Main1.java

@@ -0,0 +1,9 @@
+package ru.mirea.practice.s0000001;
+
+abstract class Main1 {
+    public static void main(String[] args) {
+        String rpnExpression = "3 4 + 2 * 7 /";
+        double result = RPnCalculator.calculate(rpnExpression);
+        System.out.println("Результат: " + result);
+    }
+}

students/23K9006/23K9006-p22/src/main/java/ru/mirea/practice/s0000001/1/RPnCalculator.java

@@ -0,0 +1,44 @@
+package ru.mirea.practice.s0000001;
+
+import java.util.Stack;
+
+abstract class RPnCalculator {
+    public static double calculate(String expression) {
+        Stack<Double> stack = new Stack<>();
+        String[] tokens = expression.split("\\s+");
+
+        for (String token : tokens) {
+            if (isOperator(token)) {
+                double b = stack.pop();
+                double a = stack.pop();
+                stack.push(applyOperation(a, b, token));
+            } else {
+                stack.push(Double.parseDouble(token));
+            }
+        }
+
+        return stack.pop();
+    }
+
+    private static boolean isOperator(String token) {
+        return "+".equals(token) || "-".equals(token) || "*".equals(token) || "/".equals(token);
+    }
+
+    private static double applyOperation(double a, double b, String operator) {
+        switch (operator) {
+            case "+":
+                return a + b;
+            case "-":
+                return a - b;
+            case "*":
+                return a * b;
+            case "/":
+                if (b == 0) {
+                    throw new ArithmeticException("Деление на ноль");
+                }
+                return a / b;
+            default:
+                throw new IllegalArgumentException("Недопустимый оператор: " + operator);
+        }
+    }
+}

students/23K9006/23K9006-p23/pom.xml

@@ -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>23K9006</artifactId>
+        <groupId>ru.mirea.practice</groupId>
+        <version>2024.1</version>
+        <relativePath>../pom.xml</relativePath>
+    </parent>
+    <artifactId>23K9006-p23</artifactId>
+    <description>двадцать третье задание</description>
+</project>

students/23K9006/23K9006-p23/src/main/java/ru/mirea/practice/s0000001/1/ArrayQueue.java

@@ -0,0 +1,60 @@
+package ru.mirea.practice.s0000001;
+
+public class ArrayQueue {
+    private Object[] elements = new Object[10];
+    private int head = 0;
+    private int tail = 0;
+    private int size = 0;
+
+    public void enqueue(Object element) {
+        ensureCapacity(size + 1);
+        elements[tail] = element;
+        tail = (tail + 1) % elements.length;
+        size++;
+    }
+
+    public Object element() {
+        if (isEmpty()) {
+            throw new IllegalStateException("Queue is empty");
+        }
+        return elements[head];
+    }
+
+    public Object dequeue() {
+        if (isEmpty()) {
+            throw new IllegalStateException("Queue is empty");
+        }
+        final Object result = elements[head];
+        elements[head] = null;
+        head = (head + 1) % elements.length;
+        size--;
+        return result;
+    }
+
+    public int size() {
+        return size;
+    }
+
+    public boolean isEmpty() {
+        return size == 0;
+    }
+
+    public void clear() {
+        elements = new Object[10];
+        head = 0;
+        tail = 0;
+        size = 0;
+    }
+
+    private void ensureCapacity(int capacity) {
+        if (capacity > elements.length) {
+            Object[] newArray = new Object[2 * elements.length];
+            for (int i = 0; i < size; i++) {
+                newArray[i] = elements[(head + i) % elements.length];
+            }
+            elements = newArray;
+            head = 0;
+            tail = size;
+        }
+    }
+}

students/23K9006/23K9006-p23/src/main/java/ru/mirea/practice/s0000001/1/ArrayQueueAdt.java

@@ -0,0 +1,60 @@
+package ru.mirea.practice.s0000001;
+
+public class ArrayQueueAdt {
+    private Object[] elements = new Object[10];
+    private int head = 0;
+    private int tail = 0;
+    private int size = 0;
+
+    public static void enqueue(ArrayQueueAdt queue, Object element) {
+        ensureCapacity(queue, queue.size + 1);
+        queue.elements[queue.tail] = element;
+        queue.tail = (queue.tail + 1) % queue.elements.length;
+        queue.size++;
+    }
+
+    public static Object element(ArrayQueueAdt queue) {
+        if (isEmpty(queue)) {
+            throw new IllegalStateException("Queue is empty");
+        }
+        return queue.elements[queue.head];
+    }
+
+    public static Object dequeue(ArrayQueueAdt queue) {
+        if (isEmpty(queue)) {
+            throw new IllegalStateException("Queue is empty");
+        }
+        final Object result = queue.elements[queue.head];
+        queue.elements[queue.head] = null;
+        queue.head = (queue.head + 1) % queue.elements.length;
+        queue.size--;
+        return result;
+    }
+
+    public static int size(ArrayQueueAdt queue) {
+        return queue.size;
+    }
+
+    public static boolean isEmpty(ArrayQueueAdt queue) {
+        return queue.size == 0;
+    }
+
+    public static void clear(ArrayQueueAdt queue) {
+        queue.elements = new Object[10];
+        queue.head = 0;
+        queue.tail = 0;
+        queue.size = 0;
+    }
+
+    private static void ensureCapacity(ArrayQueueAdt queue, int capacity) {
+        if (capacity > queue.elements.length) {
+            Object[] newArray = new Object[2 * queue.elements.length];
+            for (int i = 0; i < queue.size; i++) {
+                newArray[i] = queue.elements[(queue.head + i) % queue.elements.length];
+            }
+            queue.elements = newArray;
+            queue.head = 0;
+            queue.tail = queue.size;
+        }
+    }
+}