Feat: Adds Shawn Dunsmore Jr Added spotlessapply

Author: Djtheman1

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

@@ -2,29 +2,30 @@
 
 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
-     */
+  /**
+   * 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) {
+    int oddPoints = 0;
+    int evenPoints = 0;
 
-    public String gameResult(ListNode head) {
-        int oddPoints = 0;
-        int evenPoints = 0;
-
-        for (ListNode current = head; current != null && current.next != null; current = current.next.next) {
-            if (current.val < current.next.val) {
-                oddPoints++;
-            } else if (current.val > current.next.val) {
-                evenPoints++;
-            }
-        }
+    for (ListNode current = head;
+        current != null && current.next != null;
+        current = current.next.next) {
+      if (current.val < current.next.val) {
+        oddPoints++;
+      } else if (current.val > current.next.val) {
+        evenPoints++;
+      }
+    }
 
-        if (oddPoints > evenPoints) {
-            return "Odd";
-        } else if (evenPoints > oddPoints) {
-            return "Even";
-        } else {
-            return "Tie";
-        }
+    if (oddPoints > evenPoints) {
+      return "Odd";
+    } else if (evenPoints > oddPoints) {
+      return "Even";
+    } else {
+      return "Tie";
     }
-}
+  }
+}

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

@@ -1,36 +1,36 @@
 package com.codedifferently.lesson12;
 
 /** Implement the below Stack by providing code for the class methods. */
-  public class Stack {
-    private ListNode top;
+public class Stack {
+  private ListNode top;
 
-    public Stack() {
-        this.top = null;
-    }
+  public Stack() {
+    this.top = null;
+  }
 
-    public void push(int value) {
-        ListNode newNode = new ListNode(value);
-        newNode.next = top;
-        top = newNode;
-    }
+  public void push(int value) {
+    ListNode newNode = new ListNode(value);
+    newNode.next = top;
+    top = newNode;
+  }
 
-    public int pop() {
-        if (isEmpty()) {
-            throw new IllegalStateException("Stack is empty");
-        }
-        int value = top.val;
-        top = top.next;
-        return value;
+  public int pop() {
+    if (isEmpty()) {
+      throw new IllegalStateException("Stack is empty");
     }
+    int value = top.val;
+    top = top.next;
+    return value;
+  }
 
-    public int peek() {
-        if (isEmpty()) {
-            throw new IllegalStateException("Stack is empty");
-        }
-        return top.val;
+  public int peek() {
+    if (isEmpty()) {
+      throw new IllegalStateException("Stack is empty");
     }
+    return top.val;
+  }
 
-    public boolean isEmpty() {
-        return top == null;
-    }
+  public boolean isEmpty() {
+    return top == null;
+  }
 }