chore(collection): merge custom list dependency

2026-08-27 22:59:48 +03:00
parent 4794f03f3c f855a76092
commit ef81c4abe1
2 changed files with 139 additions and 0 deletions
@@ -0,0 +1,123 @@
+import java.util.Arrays;
+public class MyLinkedList<T> implements MyList<T>
+{
+    private Node<T> head;
+    private int size;
+    public void add(T value) {
+        if (head == null) {
+            this.head = new Node<>(value);
+        } else {
+            Node<T> temp = head;
+            while (temp.getNext() != null) {
+                temp = temp.getNext();
+            }
+            temp.setNext(new Node<>(value));
+        }
+        size++;
+    }
+    public T get(int index)
+    {
+        int currentIndex = 0;
+        Node<T> temp = head;
+        while(temp != null)
+        {
+            if (currentIndex == index)
+            {
+                return temp.getValue();
+
+            }
+            else {
+                temp = temp.getNext();
+                currentIndex++;
+            }
+
+        }
+        throw new IllegalArgumentException();
+    }
+    public void remove(int index)
+    {
+        if (index < 0 || index >= size) {
+            throw new IndexOutOfBoundsException();
+        }
+        if (index == 0)
+        {
+            head = head.getNext();
+            size--;
+            return;
+
+        }
+        int currentIndex = 0;
+        Node<T> temp = head;
+        while (temp != null)
+        {
+            if (currentIndex == index-1)
+            {
+                temp.setNext(temp.getNext().getNext());
+                size--;
+                return;
+            }
+            else {
+                temp = temp.getNext();
+                currentIndex++;
+            }
+        }
+    }
+    public T set(int index, T value) {
+        if (index < 0 || index >= size) {
+            throw new IllegalArgumentException();
+        }
+
+        Node<T> temp = head;
+        for (int i = 0; i < index; i++) {
+            temp = temp.getNext();
+        }
+
+        T oldValue = temp.getValue();
+        temp.setValue(value);
+        return oldValue;
+    }
+    public int size() {
+        return size;
+    }
+    public boolean isEmpty()
+    {
+        return size == 0;
+    }
+    @Override
+    public String toString() {
+        Object[] res = new Object[size];
+        int index = 0;
+        Node<T> temp = head;
+        while (temp != null) {
+            res[index] = temp.getValue();
+            index++;
+            temp = temp.getNext();
+        }
+        return Arrays.toString(res);
+    }
+
+    private static class Node<T> {
+        private T value;
+        private Node<T> next;
+
+        public Node(T value) {
+            this.value = value;
+        }
+
+        public void setValue(T value) {
+            this.value = value;
+        }
+
+        public void setNext(Node<T> next) {
+            this.next = next;
+        }
+
+        public T getValue() {
+            return value;
+        }
+
+        public Node<T> getNext() {
+            return next;
+        }
+    }
+}
@@ -0,0 +1,16 @@
+package ru.project.collection;
+
+public interface MyList<T> {
+
+  void add(T element);
+
+  T get(int index);
+
+  T set(int index, T element);
+
+  void remove(int index);
+
+  int size();
+
+  boolean isEmpty();
+}