Merge pull request #656 from SpooderWeld/Lab21-32

Practics 21-32

Author: Pastor

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

@@ -0,0 +1,13 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         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>23K0563</artifactId>
+        <groupId>ru.mirea.practice</groupId>
+        <version>2024.1</version>
+        <relativePath>../pom.xml</relativePath>
+    </parent>
+    <artifactId>23K0563-p21</artifactId>
+    <description>21</description>
+</project>

students/23K0563/23K0563-p21/src/main/java/mirea/lab21/p1/ArrayConvert.java

@@ -0,0 +1,13 @@
+package mirea.lab21.p1;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
+public class ArrayConvert {
+    public <T> List<T> convert(T[] a) {
+        List<T> l = new ArrayList<>();
+        l.addAll(Arrays.asList(a));
+        return l;
+    }
+}

students/23K0563/23K0563-p21/src/main/java/mirea/lab21/p1/Prac21p1.java

@@ -0,0 +1,14 @@
+package mirea.lab21.p1;
+
+/* 1 Написать метод для конвертации массива строк/чисел в список. */
+
+import java.util.List;
+
+public abstract class Prac21p1 {
+    public static void main(String[] args) {
+        ArrayConvert ar = new ArrayConvert();
+        String[] s = {"abc", "def", "aaaaaa", "cbcbcb"};
+        List list = ar.convert(s);
+        System.out.println(list.toString());
+    }
+}

students/23K0563/23K0563-p21/src/main/java/mirea/lab21/p2/Anyarr.java

@@ -0,0 +1,26 @@
+package mirea.lab21.p2;
+
+import java.util.Arrays;
+
+public class Anyarr<T> {
+    private T[] array;
+
+    public Anyarr(T[] array) {
+        this.array = array;
+    }
+
+    public T[] getArray() {
+        return array;
+    }
+
+    public void setElement(int i, T e) {
+        if (i >= 0 && i < array.length) {
+            array[i] = e;
+        }
+    }
+
+    @Override
+    public String toString() {
+        return Arrays.toString(array);
+    }
+}

students/23K0563/23K0563-p21/src/main/java/mirea/lab21/p2/Prac21p2.java

@@ -0,0 +1,13 @@
+package mirea.lab21.p2;
+
+import java.util.Arrays;
+
+public abstract class Prac21p2 {
+    public static void main(String[] args) {
+        String[] s = {"abc","def","aaaaaaa"};
+        System.out.println(Arrays.toString(s));
+        Anyarr<String> arr = new Anyarr<String>(s);
+        arr.setElement(1,"changed");
+        System.out.println(arr.toString());
+    }
+}

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

@@ -0,0 +1,13 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         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>23K0563</artifactId>
+        <groupId>ru.mirea.practice</groupId>
+        <version>2024.1</version>
+        <relativePath>../pom.xml</relativePath>
+    </parent>
+    <artifactId>23K0563-p22</artifactId>
+    <description>22</description>
+</project>

students/23K0563/23K0563-p22/src/main/java/mirea/lab22/Prac22p1p2.java

@@ -0,0 +1,49 @@
+package mirea.lab22;
+
+import java.util.Scanner;
+import java.util.Stack;
+
+public abstract class Prac22p1p2 {
+    public static void main(String[] args) {
+        try (Scanner sc = new Scanner(System.in)) {
+            System.out.println("Введите выражение в польской нотации: ");
+            String[] exp = null;
+            try {
+                exp = sc.nextLine().split(" ");
+            } catch (Exception e) {
+                System.out.println("Ошибка ввода!");
+            }
+            Stack<Double> s = new Stack<Double>();
+            if (exp != null) {
+                try {
+                    for (String i : exp) {
+                        switch (i) {
+                            case "+":
+                                s.push(s.pop() + s.pop());
+                                break;
+                            case "-":
+                                s.push(-(s.pop() - s.pop()));
+                                break;
+                            case "*":
+                                s.push(s.pop() * s.pop());
+                                break;
+                            case "/":
+                                double delit = s.pop();
+                                double delim = s.pop();
+                                s.push(delim / delit);
+                                break;
+                            default:
+                                double n = Double.parseDouble(i);
+                                s.push(n);
+                                break;
+                        }
+                    }
+                } catch (Exception e) {
+                    System.out.println("Ошибка счета: " + e.getMessage());
+                }
+            }
+            System.out.println(s.pop());
+        }
+
+    }
+}

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

@@ -0,0 +1,13 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         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>23K0563</artifactId>
+        <groupId>ru.mirea.practice</groupId>
+        <version>2024.1</version>
+        <relativePath>../pom.xml</relativePath>
+    </parent>
+    <artifactId>23K0563-p23</artifactId>
+    <description>23</description>
+</project>

students/23K0563/23K0563-p23/src/main/java/mirea/lab23/p1/ArrayQueue.java

@@ -0,0 +1,46 @@
+package mirea.lab23.p1;
+
+public class ArrayQueue<T> {
+    private T[] q;
+    private int front;
+    private int back;
+    private int am;
+    private int size;
+
+    public ArrayQueue(int size) {
+        front = 0;
+        back = 0;
+        am = 0;
+        this.size = size;
+    }
+
+    public void enqueue(T t) {
+        if (am < size) {
+            q[back] = t;
+            am++;
+            back = (back + 1) % size;
+        }
+    }
+
+    public T dequeue() {
+        T t = q[front];
+        front = (front + 1) % size;
+        am--;
+        return t;
+    }
+
+    public T peek() {
+        if (am >= 0) {
+            return q[front];
+        }
+        return null;
+    }
+
+    public boolean isFull() {
+        return am == size;
+    }
+
+    public boolean isEmpty() {
+        return am == 0;
+    }
+}

students/23K0563/23K0563-p23/src/main/java/mirea/lab23/p1/ArrayQueueModule.java

@@ -0,0 +1,46 @@
+package mirea.lab23.p1;
+
+public class ArrayQueueModule<T> {
+    private T[] q;
+    private int front;
+    private int back;
+    private int am;
+    private int size;
+
+    public ArrayQueueModule(int size) {
+        front = 0;
+        back = 0;
+        am = 0;
+        this.size = size;
+    }
+
+    public void enqueue(T t) {
+        if (am < size) {
+            q[back] = t;
+            am++;
+            back = (back + 1) % size;
+        }
+    }
+
+    public T dequeue() {
+        T t = q[front];
+        front = (front + 1) % size;
+        am--;
+        return t;
+    }
+
+    public boolean isFull() {
+        return am == size;
+    }
+
+    public T peek() {
+        if (am >= 0) {
+            return q[front];
+        }
+        return null;
+    }
+
+    public boolean isEmpty() {
+        return am == 0;
+    }
+}