feat: implement gameResult method and create Stack operations

Author: Dlafferty251

lesson_12/structs_java/structs_app/src/main/java/com/codedifferently/lesson12/Lesson12.java

@@ -2,11 +2,59 @@
 
 public class Lesson12 {
 
+  // public static Node {
+  //   public int data;
+  //   public Node next;
+
+  //   public Node(int data) {
+  //     this.data = data;
+  //   }
+  // }
   /**
    * Provide the solution to LeetCode 3062 here:
    * https://github.com/yang-su2000/Leetcode-algorithm-practice/tree/master/3062-winner-of-the-linked-list-game
    */
-  public String gameResult(ListNode head) {
-    return null;
+  public static String gameResult(ListNode head) {
+    int[] scoreBoard = {0, 0};
+
+    while (head.next != null) {
+      if (head.val != head.next.val && head.val % 2 == 0) {
+        if (head.val > head.next.val) {
+          scoreBoard[head.val % 2] += 1;
+        } else {
+          scoreBoard[head.next.val % 2] += 1;
+        }
+      }
+      head = head.next; // Moves to the next Node
+    }
+
+    if (scoreBoard[0] == scoreBoard[1]) {
+      return "Tie";
+    } else if (scoreBoard[0] > scoreBoard[1]) {
+      return "Even";
+    } else {
+      return "Odd";
+    }
   }
 }
+
+  // public static Node createLinkedList(int[] arr) {
+  //   if (arr.length == 0) return null;
+
+  //   Node head = new Node(arr[0]); //Creates the first node and names it head
+  //   Node current = head; //Tracks the current head inside the loop
+
+  //   for(int i = 1; i < arr.length; ++i) { //Starts a for loop that is at the second element
+  //     current.next = new Node(arr[i]); //creates a new node and links it
+  //     current = current.next;
+  //   }
+  //       return head;
+
+  // }
+
+  // public static void main(String[] args) {
+  //     int[] arr = {2, 5, 4, 7, 20, 5};
+
+  //     System.out.println(createLinkedList(arr));
+  // }
+// }

lesson_12/structs_java/structs_app/src/main/java/com/codedifferently/lesson12/ListNode.java

@@ -3,6 +3,7 @@
 public class ListNode {
   int val;
   ListNode next;
+  int data;
 
   ListNode() {}
 

lesson_12/structs_java/structs_app/src/main/java/com/codedifferently/lesson12/Stack.java

@@ -9,18 +9,24 @@ public Stack() {
   }
 
   public void push(int value) {
-    // Your code here
+    ListNode newNode = new ListNode(value); // Will create a new node
+    newNode.next = top; // Point the new node to the top of the Stack
+    top = newNode; // Changes the top node to become newNode
   }
 
   public int pop() {
-    return 0;
+    int value = top.val; // gets the value of top and creating it as a variable value that will temporarily
+    // store it
+    top = top.next; // Move top to the next position in the stack this instance it would be whatever
+    // is below the top node.
+    return value; // returns that temporary saved val varaible and removes from the stack
   }
 
   public int peek() {
-    return 0;
+    return top.val; // Will return the top val of the stack "peeking in"
   }
 
   public boolean isEmpty() {
-    return true;
+    return top == null; // returns true is the top of the stack is empty aka null
   }
 }