Merge pull request #32 from ShehaniHettiarachchi/DataStructure

ThusharaX · web-flow · commit 5fba5ed929c7 · 2022-10-20T07:38:35.000+05:30
Data structure reverse method using stack
diff --git a/Basics/Data Structure/Stack-Reverser/Reverser.java b/Basics/Data Structure/Stack-Reverser/Reverser.java
@@ -0,0 +1,38 @@
+package Stack;
+
+import java.util.Scanner;
+
+public class Reverser {
+	private String input,output;
+
+    Reverser(String input){
+        this.input = input;
+        output = "";
+    }
+
+    public String reverse(){
+        StackX stack = new StackX(input.length());
+
+        for (char letter : input.toCharArray()) {
+            stack.push(letter);
+        }
+
+
+
+        while (!stack.isEmpty()) {
+            output += stack.pop();
+
+        }
+
+        return output;
+    }
+
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        System.out.print("Enter any text : ");
+        String str = sc.nextLine();
+        Reverser obj = new Reverser(str);
+        System.out.println("Reversed  :" + obj.reverse()); 
+        sc.close();
+    }
+}
diff --git a/Basics/Data Structure/Stack-Reverser/StackX.java b/Basics/Data Structure/Stack-Reverser/StackX.java
@@ -0,0 +1,56 @@
+package Stack;
+
+public class StackX {
+	private char[] data; //stack array
+	private int top;  //top of the stack
+	private int size; //size of stack array
+
+    public StackX(int size){
+        this.size = size;
+        data = new char[size];
+        top = -1;
+    }
+
+    //push method
+    public boolean push(char element){
+        if (top < size - 1) {
+            data[++top] = element;
+            return true;
+        }
+
+        return false;
+
+    }
+
+    public char pop(){
+        if (top != -1) {
+            return data[top--];
+        }
+
+        return ' ';
+    }
+
+    public char peek(){
+        if (top != -1) {
+            return data[top];
+        }
+
+        return ' ';
+    }
+
+    public boolean isFull(){
+        if (top == size - 1) {
+            return true;
+        }
+
+        return false;
+    }
+
+    public boolean isEmpty(){
+        if (top == -1) {
+            return true;
+        }
+
+        return false;
+    }
+}
