task: completed lesson 12

Author: JEKLUND251

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

@@ -7,6 +7,26 @@ public class Lesson12 {
    * https://github.com/yang-su2000/Leetcode-algorithm-practice/tree/master/3062-winner-of-the-linked-list-game
    */
   public String gameResult(ListNode head) {
-    return null;
+    int oddValue = 0;
+    int evenValue = 0;
+
+    while (head != null && head.next != null) {
+      int val1 = head.val;
+      int val2 = head.next.val;
+
+      if (val1 < val2) {
+      oddValue += val1;
+      } else if (val2 < val1) {
+      evenValue += 1;
+      }
+      head = head.next.next;
+    }
+    if (oddValue > evenValue) {
+      return "Odd";
+    } else if (evenValue > oddValue) {
+      return "Even";
+    } else {
+      return "Tie";
+    }
   }
 }

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

@@ -9,18 +9,22 @@ public Stack() {
   }
 
   public void push(int value) {
-    // Your code here
+    ListNode newNode = new ListNode(value);
+    newNode.next = top;
+    top = newNode;
   }
 
   public int pop() {
-    return 0;
+    int value = top.val;
+    top = top.next;
+    return value;
   }
 
   public int peek() {
-    return 0;
+    return top.val;
   }
 
   public boolean isEmpty() {
-    return true;
+    return top == null;
   }
 }