Merge pull request #647 from MiNareee/main

Лаба 21-30, 32

Author: Pastor

students/23K0164/23K0164-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>23K0164</artifactId>
+        <groupId>ru.mirea.practice</groupId>
+        <version>2024.1</version>
+        <relativePath>../pom.xml</relativePath>
+    </parent>
+    <artifactId>23K0164-p21</artifactId>
+    <description>Лаба 21</description>
+</project>

students/23K0164/23K0164-p21/src/main/java/ru/mirea/practice/s23k0164/t1/First.java

@@ -0,0 +1,28 @@
+package ru.mirea.practice.s23k0164.t1;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public final class First {
+    private First() {
+    }
+
+    public static <T> List<T> convertArrayToList(T[] array) {
+        List<T> list = new ArrayList<>();
+        for (T element : array) {
+            list.add(element);
+        }
+        return list;
+    }
+
+    public static void main(String[] args) {
+        String[] stringArray = {"A", "B", "C"};
+        List<String> stringList = convertArrayToList(stringArray);
+        System.out.println(stringList);
+
+        Integer[] intArray = {1, 2, 3};
+        List<Integer> intList = convertArrayToList(intArray);
+        System.out.println(intList);
+    }
+}
+

students/23K0164/23K0164-p21/src/main/java/ru/mirea/practice/s23k0164/t2/GenericArray.java

@@ -0,0 +1,33 @@
+package ru.mirea.practice.s23k0164.t2;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class GenericArray<T> {
+    private List<T> elements;
+
+    public GenericArray() {
+        elements = new ArrayList<>();
+    }
+
+    public void add(T element) {
+        elements.add(element);
+    }
+
+    public T get(int index) {
+        if (index < 0 || index >= elements.size()) {
+            throw new IndexOutOfBoundsException("Index: " + index + ", Size: " + elements.size());
+        }
+        return elements.get(index);
+    }
+
+    public int size() {
+        return elements.size();
+    }
+
+    @Override
+    public String toString() {
+        return elements.toString();
+    }
+
+}

students/23K0164/23K0164-p21/src/main/java/ru/mirea/practice/s23k0164/t2/Two.java

@@ -0,0 +1,35 @@
+package ru.mirea.practice.s23k0164.t2;
+
+public final class Two {
+    private Two() {
+
+    }
+
+    public static void main(String[] args) {
+
+        GenericArray<Integer> intArray = new GenericArray<>();
+        intArray.add(1);
+        intArray.add(2);
+        intArray.add(3);
+        System.out.println("Integer Array: " + intArray);
+
+
+        GenericArray<String> stringArray = new GenericArray<>();
+        stringArray.add("Hello");
+        stringArray.add("World");
+        System.out.println("String Array: " + stringArray);
+
+
+        GenericArray<Double> doubleArray = new GenericArray<>();
+        doubleArray.add(3.14);
+        doubleArray.add(2.71);
+        System.out.println("Double Array: " + doubleArray);
+
+
+        GenericArray<Object> mixedArray = new GenericArray<>();
+        mixedArray.add(100);
+        mixedArray.add("Test");
+        mixedArray.add(3.14159);
+        System.out.println("Mixed Array: " + mixedArray);
+    }
+}

students/23K0164/23K0164-p22_001/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>23K0164</artifactId>
+        <groupId>ru.mirea.practice</groupId>
+        <version>2024.1</version>
+        <relativePath>../pom.xml</relativePath>
+    </parent>
+    <artifactId>23K0164-p22_001</artifactId>
+    <description>Лаба 22</description>
+</project>

students/23K0164/23K0164-p22_001/src/main/java/ru/mirea/practice/s23k0164/t1/RpnCalculator.java

@@ -0,0 +1,71 @@
+package ru.mirea.practice.s23k0164.t1;
+
+import java.util.Stack;
+
+public final class RpnCalculator {
+    private RpnCalculator() {
+
+    }
+
+    public static void main(String[] args) {
+        String expression = "3 4 + 2 * 7 /";
+
+        try {
+            double result = evaluateRpn(expression);
+            System.out.println("Result: " + result);
+        } catch (Exception e) {
+            System.err.println("Error: " + e.getMessage());
+        }
+    }
+
+    public static double evaluateRpn(String expression) throws Exception {
+        Stack<Double> stack = new Stack<>();
+        String[] tokens = expression.split("\\s+");
+
+        for (String token : tokens) {
+            if (isNumeric(token)) {
+                stack.push(Double.parseDouble(token));
+            } else {
+                if (stack.size() < 2) {
+                    throw new Exception("Invalid expression: insufficient values in stack.");
+                }
+                double b = stack.pop();
+                double a = stack.pop();
+                double result = performOperation(a, b, token);
+                stack.push(result);
+            }
+        }
+
+        if (stack.size() != 1) {
+            throw new Exception("Invalid expression: too many values in stack.");
+        }
+        return stack.pop();
+    }
+
+    private static boolean isNumeric(String str) {
+        try {
+            Double.parseDouble(str);
+            return true;
+        } catch (NumberFormatException e) {
+            return false;
+        }
+    }
+
+    private static double performOperation(double a, double b, String operator) throws Exception {
+        switch (operator) {
+            case "+":
+                return a + b;
+            case "-":
+                return a - b;
+            case "*":
+                return a * b;
+            case "/":
+                if (b == 0) {
+                    throw new Exception("Division by zero.");
+                }
+                return a / b;
+            default:
+                throw new Exception("Invalid operator: " + operator);
+        }
+    }
+}

students/23K0164/23K0164-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>23K0164</artifactId>
+        <groupId>ru.mirea.practice</groupId>
+        <version>2024.1</version>
+        <relativePath>../pom.xml</relativePath>
+    </parent>
+    <artifactId>23K0164-p23</artifactId>
+    <description>Лаба 23</description>
+</project>

students/23K0164/23K0164-p23/src/main/java/ru/mirea/practice/s23k0164/t1/AbstractQueue.java

@@ -0,0 +1,16 @@
+package ru.mirea.practice.s23k0164.t1;
+
+public abstract class AbstractQueue<T> implements Queue<T> {
+
+    protected int size;
+
+    @Override
+    public boolean isEmpty() {
+        return size == 0;
+    }
+
+    @Override
+    public int size() {
+        return size;
+    }
+}

students/23K0164/23K0164-p23/src/main/java/ru/mirea/practice/s23k0164/t1/LinkedQueue.java

@@ -0,0 +1,58 @@
+package ru.mirea.practice.s23k0164.t1;
+
+public class LinkedQueue<T> implements Queue<T> {
+    private Node<T> head;
+    private Node<T> tail;
+    private int size;
+
+    public LinkedQueue() {
+        head = null;
+        tail = null;
+        size = 0;
+    }
+
+    @Override
+    public void enqueue(T element) {
+        Node<T> newNode = new Node<>(element);
+        if (tail != null) {
+            tail.next = newNode;
+        }
+        tail = newNode;
+        if (head == null) {
+            head = newNode;
+        }
+        size++;
+    }
+
+    @Override
+    public T dequeue() {
+        if (isEmpty()) {
+            throw new IllegalStateException("Queue is empty");
+        }
+        final T data = head.data;
+        head = head.next;
+        if (head == null) {
+            tail = null;
+        }
+        size--;
+        return data;
+    }
+
+    @Override
+    public T peek() {
+        if (isEmpty()) {
+            throw new IllegalStateException("Queue is empty");
+        }
+        return head.data;
+    }
+
+    @Override
+    public boolean isEmpty() {
+        return size == 0;
+    }
+
+    @Override
+    public int size() {
+        return size;
+    }
+}

students/23K0164/23K0164-p23/src/main/java/ru/mirea/practice/s23k0164/t1/Node.java

@@ -0,0 +1,11 @@
+package ru.mirea.practice.s23k0164.t1;
+
+class Node<T> {
+    T data;
+    Node<T> next;
+
+    Node(T data) {
+        this.data = data;
+        this.next = null;
+    }
+}