Feat: Modified two files of lesson12 by Hummad Tanweer

Author: htanweer244

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

@@ -6,7 +6,24 @@ public class 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 Lesson12() {}
+
   public String gameResult(ListNode head) {
-    return null;
+    int evenPoints = 0;
+    int oddPoints = 0;
+    while (head != null) {
+
+      if (head.val > head.next.val) {
+        evenPoints++;
+      } else if (head.val < head.next.val) {
+        oddPoints++;
+      }
+      head = head.next.next;
+    }
+    if (evenPoints > oddPoints) {
+      return "Even";
+    } else if (oddPoints > evenPoints) {
+      return "Odd";
+    } else return "Tie";
   }
-}
+}

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

@@ -9,18 +9,23 @@ public Stack() {
   }
 
   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;
   }
 }