update

OneCodeMonkey · OneCodeMonkey · commit 96bf6c784567 · 2024-09-07T15:13:05.000+08:00
diff --git a/codeForces/Codeforces_1979A_Guess_the_Maximum.java b/codeForces/Codeforces_1979A_Guess_the_Maximum.java
@@ -0,0 +1,28 @@
+// AC: 406 ms 
+// Memory: 1000 KB
+// Greedy, implementation.
+// T:O(sum(ni)), S:O(1)
+// 
+import java.util.Scanner;
+
+public class Codeforces_1979A_Guess_the_Maximum {
+    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(), ret = Integer.MAX_VALUE, prev = -1;
+            for (int j = 0; j < n; j++) {
+                int a = sc.nextInt();
+                if (prev == -1) {
+                    prev = a;
+                    continue;
+                }
+                int tempMax = Math.max(a, prev);
+                ret = Math.min(ret, tempMax);
+                prev = a;
+            }
+
+            System.out.println(ret - 1);
+        }
+    }
+}
diff --git a/codeForces/Codeforces_1983A_Array_Divisibility.java b/codeForces/Codeforces_1983A_Array_Divisibility.java
@@ -0,0 +1,25 @@
+// AC: 234 ms 
+// Memory: 900 KB
+// Constructive.
+// T:O(sum(ni)), S:O(max(ni))
+// 
+import java.util.Scanner;
+
+public class Codeforces_1983A_Array_Divisibility {
+    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();
+            StringBuilder ret = new StringBuilder();
+            for (int j = 0; j < n; j++) {
+                ret.append(j + 1);
+                if (j != n - 1) {
+                    ret.append(" ");
+                }
+            }
+
+            System.out.println(ret);
+        }
+    }
+}
diff --git a/codeForces/Codeforces_1985A_Creating_Words.java b/codeForces/Codeforces_1985A_Creating_Words.java
@@ -0,0 +1,18 @@
+// AC: 249 ms
+// Memory: 1200 KB
+// .
+// T:O(t), S:O(1)
+//
+import java.util.Scanner;
+
+public class Codeforces_1985A_Creating_Words {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        for (int i = 0; i < t; i++) {
+            String a = sc.next(), b = sc.next();
+
+            System.out.println(b.charAt(0) + a.substring(1, 3) + " " + a.charAt(0) + b.substring(1, 3));
+        }
+    }
+}
diff --git a/codeForces/Codeforces_1989A_Catch_the_Coin.java b/codeForces/Codeforces_1989A_Catch_the_Coin.java
@@ -0,0 +1,18 @@
+// AC: 358 ms 
+// Memory: 300 KB
+// .
+// T:O(n), S:O(1)
+// 
+import java.util.Scanner;
+
+public class Codeforces_1989A_Catch_the_Coin {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();
+        for (int i = 0; i < n; i++) {
+            int x = sc.nextInt(), y = sc.nextInt();
+
+            System.out.println(y >= -1 ? "YES" : "NO");
+        }
+    }
+}
diff --git a/leetcode_solved/leetcode_3270_Find_the_Key_of_the_Numbers.java b/leetcode_solved/leetcode_3270_Find_the_Key_of_the_Numbers.java
@@ -0,0 +1,20 @@
+// Runtime 1 ms Beats 100.00%
+// Memory 40.91 MB Beats 100.00%
+// .
+// T:O(logn), S:O(1)
+// 
+class Solution {
+    public int generateKey(int num1, int num2, int num3) {
+        int ret = 0, base = 1;
+        while (num1 > 0 || num2 > 0 || num3 > 0) {
+            int digit1 = num1 > 0 ? num1 % 10 : 0, digit2 = num2 > 0 ? num2 % 10 : 0, digit3 = num3 > 0 ? num3 % 10 : 0;
+            ret += Math.min(digit1, Math.min(digit2, digit3)) * base;
+            base *= 10;
+            num1 /= 10;
+            num2 /= 10;
+            num3 /= 10;
+        }
+
+        return ret;
+    }
+}
diff --git a/leetcode_solved/leetcode_3271_Hash_Divided_String.java b/leetcode_solved/leetcode_3271_Hash_Divided_String.java
@@ -0,0 +1,21 @@
+// Runtime 2 ms Beats 100.00%
+// Memory 44.45 MB Beats 100.00%
+// .
+// T:O(n), S:O(n / k)
+// 
+class Solution {
+    public String stringHash(String s, int k) {
+        StringBuilder ret = new StringBuilder();
+        int len = s.length(), gap = len / k;
+        for (int i = 0; i < gap; i++) {
+            int count = 0;
+            for (int j = k * i; j < k * i + k; j++) {
+                count += s.charAt(j) - 'a';
+            }
+            count %= 26;
+            ret.append((char) ('a' + count));
+        }
+
+        return ret.toString();
+    }
+}
diff --git a/leetcode_solved/leetcode_3274_Check_if_Two_Chessboard_Squares_Have_the_Same_Color.java b/leetcode_solved/leetcode_3274_Check_if_Two_Chessboard_Squares_Have_the_Same_Color.java
@@ -0,0 +1,13 @@
+// Runtime 0 ms Beats 100.00%
+// Memory 41.46 MB Beats 100.00%
+// .
+// T:O(1), S:O(1)
+// 
+class Solution {
+    public boolean checkTwoChessboards(String coordinate1, String coordinate2) {
+        int c1 = coordinate1.charAt(0) - 'a', c2 = coordinate1.charAt(1) - '1', c3 = coordinate2.charAt(0) - 'a',
+                c4 = coordinate2.charAt(1) - '1';
+        int diff1 = Math.abs(c1 - c3), diff2 = Math.abs(c2 - c4);
+        return Math.abs(diff1 - diff2) % 2 == 0;
+    }
+}
