Add files via upload

Author: amadejsky

02_lab_stack.zip

@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>

Lab03_03/Lab03_03.iml

@@ -0,0 +1,11 @@
+package zad1;
+
+public interface InterStack<E> {
+    boolean isEmpty();
+    E top();
+    E pop();
+    int size();
+    int deepLevel(E item);
+    void push(E item);
+
+}

Lab03_03/src/zad1/InterStack.java

@@ -0,0 +1,69 @@
+package zad1;
+
+import java.util.Scanner;
+
+public class Main {
+    Scanner sc = new Scanner(System.in);
+
+
+    public void solution(){
+
+        public static void run(){
+            TStack<String> stackOfBook =
+                    new TStack<>();
+            try{
+                loadData(stackOfBooks,5);
+            }catch(Exception e){
+                System.out.println("Wyjatek "+e.getMessage());
+                e.printStackTrace();
+                return;
+            }
+
+            System.out.println("ksiazki od ostatniej ");
+            while(!stackOfBook.isEmpty()){
+                System.out.println(stackOfBooks.pop()); //zdejmuje elementy
+            }
+        }
+        private static void loadData(TStack<String> stack,int n){
+            if(stack == null){
+                throw new NullPointerException();
+            }
+            Scanner sc = new Scanner(System.in);
+            System.out.println(String.format("Podaj %d ksiazek w kolej liniach",n));
+            String tmp;
+            for(int i=1;i<=n;i++){
+                System.out.println("podaj pozycje ksiazek");
+                tmp = sc.nextLine();
+                stack.push(tmp);
+            }
+
+        }
+
+
+    }
+
+    public static void partA(){
+        TStack<Integer> st =
+                new TStack<~>();
+        int num =23;
+        System.out.println("spradzamy elementy "+ num);
+        System.out.println("stos pusty");
+        System.out.println("glebokosc "+num+st.deepLevel(num));
+        st.push(5);
+        st.push(10);
+        st.push(15);
+        System.out.println("stos niepusty brak leementu "+num+st.deepLevel(num));
+        st.push(23);
+        st.push(100);
+        st.push(-1);
+        System.out.println("stos niepusty szukany");
+
+
+        while(!st.isEmpty()){
+            System.out.println(st.pop());
+        }
+    }
+
+}
+
+

Lab03_03/src/zad1/Main.java

@@ -0,0 +1,96 @@
+package zad1;
+
+import java.util.EmptyStackException;
+
+public class TStack<E> implements InterStack<E> {
+    private TStackNode<E> top; //uchwyt 1 elementu
+
+    public TStack() {
+        top = null;
+    }
+
+    @Override
+    public boolean isEmpty() {
+        if (top == null)
+            return true;
+        else
+            return false;
+    }
+
+    @Override
+    public E top() {
+        if( top == null ){
+            throw new EmptyStackException();
+        } else {
+            return top.getData();
+        }
+    }
+
+    @Override
+    public E pop() {
+        if( top == null ){
+            throw new EmptyStackException();
+        } else {
+            E dataOut = top.getData();
+            top = top.getPrev();
+            return dataOut;
+        }
+    }
+
+    @Override
+    public int size() {
+        if( top == null ){
+            return 0;
+        } else {
+            TStackNode<E> refNode = top;
+            int counter = 0;
+            while (refNode != null) {
+                counter++;
+                refNode = refNode.getPrev();
+            }
+            return counter;
+        }
+    }
+
+    @Override
+    public int deepLevel(E item) {
+       TStackNode<E> tmp = top;
+       int level =0;
+       while(tmp!=null){
+           if(item==tmp.getData()){
+               return level;
+           }
+           tmp = tmp.getPrev();
+           level++;
+       }
+       return -1;
+    }
+
+    public void deleteBottom(){
+        if(top == null){
+            throw new EmptyStackException();
+        }else{
+            TStackNode<E> tmp = top;
+            if(tmp.getPrev()==null){
+                tmp=null;
+                //tylko jeden elemrnt jest na stosie
+            }
+            else
+            {
+                while(tmp.getPrev().getPrev()!=null){
+                    tmp = tmp.getPrev(); //jes twiecej ni z jeden element
+                }
+                tmp.setPrev(null);//pomijany ten na dole i sutawiamy na null
+            }
+        }
+
+    @Override
+    public void push(E item) {
+        if (top == null) {
+            top = new TStackNode<>(item, null);
+        } else {
+            TStackNode<E> refNode = new TStackNode<>(item, top);
+            top = refNode;
+        }
+    }
+}

Lab03_03/src/zad1/TStack.java

@@ -0,0 +1,27 @@
+package zad1;
+
+public class TStackNode<E> {
+    private E data;
+    private TStackNode prev;
+
+    public TStackNode(E data, TStackNode prev) {
+        this.data = data;
+        this.prev = prev;
+    }
+
+    public E getData() {
+        return data;
+    }
+
+    public void setData(E data) {
+        this.data = data;
+    }
+
+    public TStackNode getPrev() {
+        return prev;
+    }
+
+    public void setPrev(TStackNode prev) {
+        this.prev = prev;
+    }
+}