add 3175

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 | #    | Title                                                                                                                                                                                         | Solutions                                                                                                                                | Video                                                                         | Difficulty                       | Tag                                                                  
 |------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|----------------------------------------------------------------------
+| 3175 | [Find The First Player to win K Games in a Row](https://leetcode.com/problems/find-the-first-player-to-win-k-games-in-a-row/)                                                                                           | [Java](../master/src/main/java/com/fishercoder/solutions/_3175.java)                                                                     |                                                                               | Medium                           |
 | 3174 | [Clear Digits](https://leetcode.com/problems/clear-digits/)                                                                                           | [Java](../master/src/main/java/com/fishercoder/solutions/_3174.java)                                                                     |                                                                               | Easy                             |
 | 3164 | [Find the Number of Good Pairs II](https://leetcode.com/problems/find-the-number-of-good-pairs-ii/)                                                                                           | [Java](../master/src/main/java/com/fishercoder/solutions/_3164.java)                                                                     |                                                                               | Medium                           |
 | 3162 | [Find the Number of Good Pairs I](https://leetcode.com/problems/find-the-number-of-good-pairs-i/)                                                                                             | [Java](../master/src/main/java/com/fishercoder/solutions/_3162.java)                                                                     |                                                                               | Easy                             |

src/main/java/com/fishercoder/solutions/_3175.java

@@ -0,0 +1,40 @@
+package com.fishercoder.solutions;
+
+import java.util.Deque;
+import java.util.LinkedList;
+
+public class _3175 {
+    public static class Solution1 {
+        public int findWinningPlayer(int[] skills, int k) {
+            Deque<int[]> q = new LinkedList<>();
+            int highestSkill = 0;
+            for (int i = 0; i < skills.length; i++) {
+                q.offer(new int[]{i, skills[i], 0});
+                highestSkill = Math.max(highestSkill, skills[i]);
+            }
+            int count = 0;
+            while (true) {
+                int[] first = q.pollFirst();
+                if (first[1] == highestSkill) {
+                    //if the highest skill stands at the head of the queue, then it'll keep standing there
+                    //so it's guaranteed that it'll be the winner
+                    return first[0];
+                }
+                int[] second = q.pollFirst();
+                if (first[2] >= k) {
+                    return first[0];
+                }
+                if (first[1] > second[1]) {
+                    first[2]++;
+                    q.addLast(second);
+                    q.addFirst(first);
+                } else {
+                    second[2]++;
+                    q.addFirst(second);
+                    q.addLast(first);
+                }
+                count++;
+            }
+        }
+    }
+}

src/test/java/com/fishercoder/_3175Test.java

@@ -0,0 +1,26 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._3175;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _3175Test {
+    private static _3175.Solution1 solution1;
+    private static int[] skills;
+    private static int k;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3175.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        skills = new int[]{16, 4, 7, 17};
+        k = 562084119;
+        assertEquals(3, solution1.findWinningPlayer(skills, k));
+    }
+
+}