update

Author: OneCodeMonkey

contest/leetcode_week_236/leetcode_1822_Sign_of_the_Product_of_an_Array.java

@@ -0,0 +1,16 @@
+// AC
+class Solution {
+    public int arraySign(int[] nums) {
+        int negativeCount = 0;
+        for(int i = 0; i < nums.length; i++) {
+            if (nums[i] == 0) {
+                return 0;
+            }
+            if (nums[i] < 0) {
+                negativeCount++;
+            }
+        }
+
+        return negativeCount % 2 == 0 ? 1 : -1;
+    }
+}

contest/leetcode_week_236/leetcode_1823_Find_the_Winner_of_the_Circular_Game.java

@@ -0,0 +1,40 @@
+// AC: 模拟
+// Runtime: 198 ms, faster than 33.33% of Java online submissions for Find the Winner of the Circular Game.
+// Memory Usage: 38.3 MB, less than 33.33% of Java online submissions for Find the Winner of the Circular Game.
+class Solution {
+    public int findTheWinner(int n, int k) {
+        if (n == 1 || k == 1) {
+            return n;
+        }
+
+        int[] record = new int[n + 1];
+        for(int i = 0; i < n + 1; i++) {
+            record[i] = 0;
+        }
+        Stack<Integer> losed = new Stack<>();
+        int pos = 1;
+        boolean startFirstLoop = false;
+        while(losed.size() < n) {
+            int tempK = k;
+            if (!startFirstLoop) {
+                tempK--;
+                pos = (pos + 1) % (n + 1);
+                startFirstLoop = true;
+            }
+            while (true) {
+                if (pos != 0 && record[pos] != 1) {
+                    if (tempK > 0) {
+                        tempK--;
+                    }
+                    if (tempK == 0) {
+                        break;
+                    }
+                }
+                pos = (pos + 1) % (n + 1);
+            }
+            record[pos] = 1;
+            losed.add(pos);
+        }
+        return losed.peek();
+    }
+}