update

Author: OneCodeMonkey

codeForces/Codeforces_1593C_Stable_Groups.java

@@ -0,0 +1,43 @@
+// Time: 890 ms 
+// Memory: 6200 KB
+// Sort & Greedy.
+// T:O(n), S:O(n)
+// 
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.Collections;
+import java.util.List;
+import java.util.Scanner;
+
+public class Codeforces_1593C_Stable_Groups {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();
+        long k = sc.nextLong(), x = sc.nextLong(), ret = 0;
+        long[] arr = new long[n];
+        for (int i = 0; i < n; i++) {
+            arr[i] = sc.nextLong();
+        }
+        Arrays.sort(arr);
+        List<Long> diffs = new ArrayList<>();
+        for (int i = 0; i < n - 1; i++) {
+            long diff = arr[i + 1] - arr[i];
+            if (diff > x) {
+                diffs.add(diff);
+            }
+        }
+        if (diffs.size() > 0) {
+            Collections.sort(diffs);
+            for (long diff : diffs) {
+                long extra = (diff % x == 0 ? diff / x : (diff / x + 1)) - 1;
+                if (extra <= k) {
+                    k -= extra;
+                } else {
+                    ret++;
+                }
+            }
+        }
+
+        System.out.println(ret + 1);
+    }
+}

codeForces/Codeforces_2055A_Two_Frogs.java

@@ -0,0 +1,17 @@
+// Time: 265 ms 
+// Memory: 100 KB
+// Game: 偶数距离，先手必赢。只需先将距离缩小，后跟着对手的方向走即可。
+// T:O(t), S:O(1)
+// 
+import java.util.Scanner;
+
+public class Codeforces_2055A_Two_Frogs {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        for (int i = 0; i < t; i++) {
+            int n = sc.nextInt(), a = sc.nextInt(), b = sc.nextInt();
+            System.out.println((a - b) % 2 == 0 ? "YES" : "NO");
+        }
+    }
+}

codeForces/Codeforces_2063A_Minimal_Coprime.java

@@ -0,0 +1,23 @@
+// Time: 249 ms 
+// Memory: 1000 KB
+// Math.
+// T:O(t), S:O(1)
+// 
+import java.util.Scanner;
+
+public class Codeforces_2063A_Minimal_Coprime {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        for (int i = 0; i < t; i++) {
+            int l = sc.nextInt(), r = sc.nextInt(), ret = 0;
+            if (l == 1 && r == 1) {
+                ret = 1;
+            } else {
+                ret = r - l;
+            }
+
+            System.out.println(ret);
+        }
+    }
+}

leetcode_solved/leetcode_3456_Find_Special_Substring_of_Length_K.java

@@ -0,0 +1,34 @@
+// Runtime 1 ms Beats 100.00% 
+// Memory 42.36 MB Beats 100.00%
+// .
+// T:O(n), S:O(1)
+// 
+class Solution {
+    public boolean hasSpecialSubstring(String s, int k) {
+        char prev = ' ';
+        int len = s.length(), count = 0;
+        for (int i = 0; i < len; i++) {
+            char c = s.charAt(i);
+            if (prev == ' ') {
+                count++;
+                if (k == count && (i + 1 >= len || (i + 1 < len && s.charAt(i + 1) != c))) {
+                    return true;
+                }
+            } else if (prev == c) {
+                count++;
+                if (k == count && (i + 1 >= len || i + 1 < len && s.charAt(i + 1) != c)) {
+                    return true;
+                }
+            } else {
+                count = 1;
+                if (k == count && (i + 1 >= len || i + 1 < len && s.charAt(i + 1) != c)) {
+                    return true;
+                }
+            }
+
+            prev = c;
+        }
+
+        return false;
+    }
+}