feat: Lesson 12 Game Result / Stack by Dwight Blue

Author: cdbluejr

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

@@ -2,11 +2,34 @@
 
 public class Lesson12 {
 
+    public Lesson12() {
+      
+    }
+
   /**
    * 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;
-  }
-}
+      var o = 0;
+      var e = 0;   
+      while (head != null){
+        if (head.val > head.next.val){
+          e++;
+          }
+        else{
+          o++;
+        }
+      head = head.next.next;
+      }
+      if ( e > o) {
+        return "Even";
+      } else if ( e<o) {
+        return "Odd";
+      }
+        else
+        return "Tie";
+        
+}       
+
+  }

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

@@ -1,26 +1,32 @@
 package com.codedifferently.lesson12;
 
+
 /** Implement the below Stack by providing code for the class methods. */
 public class Stack {
   private ListNode top;
 
   public Stack() {
     this.top = null;
   }
-
   public void push(int value) {
-    // Your code here
+    ListNode newTop = new ListNode (value);
+    newTop.next = top;
+    top = newTop;
   }
 
   public int pop() {
-    return 0;
+    var oldTop = top.val;
+    top = top.next;
+    return oldTop;
   }
 
   public int peek() {
-    return 0;
+    var headVal = top.val;
+    return headVal;
   }
 
   public boolean isEmpty() {
-    return true;
+    return top == null;
   }
 }
+