biweekly-52

Signed-off-by: ashKIK <[email protected]>

Author: px100

biweekly-52/IncrementalMemoryLeak.java

@@ -0,0 +1,17 @@
+
+// https://leetcode.com/contest/biweekly-contest-52/problems/incremental-memory-leak/
+
+public class IncrementalMemoryLeak {
+
+  public int[] memLeak(int memory1, int memory2) {
+    int second;
+    for (second = 1; memory1 >= second || memory2 >= second; second++) {
+      if (memory2 > memory1) {
+        memory2 -= second;
+      } else {
+        memory1 -= second;
+      }
+    }
+    return new int[]{second, memory1, memory2};
+  }
+}

biweekly-52/RotatingTheBox.java

@@ -0,0 +1,31 @@
+
+// https://leetcode.com/contest/biweekly-contest-52/problems/rotating-the-box/
+
+public class RotatingTheBox {
+
+  public char[][] rotateTheBox(char[][] box) {
+    int m = box.length;
+    int n = box[0].length;
+    char[][] res = new char[n][m];
+    for (int i = 0; i < m; i++) {
+      int pos = n - 1;
+      for (int j = n - 1; j >= 0; j--) {
+        if (box[i][j] == '.') {
+          res[j][m - i - 1] = '.';
+        } else if (box[i][j] == '*') {
+          res[j][m - i - 1] = '*';
+          if (j > 0) {
+            pos = j - 1;
+          }
+        } else {
+          res[pos][m - i - 1] = '#';
+          if (pos != j) {
+            res[j][m - i - 1] = '.';
+          }
+          pos--;
+        }
+      }
+    }
+    return res;
+  }
+}

biweekly-52/SortingTheSentence.java

@@ -2,6 +2,8 @@
 import java.util.Comparator;
 import java.util.StringJoiner;
 
+// https://leetcode.com/contest/biweekly-contest-52/problems/sorting-the-sentence/
+
 public class SortingTheSentence {
 
   public String sortSentence(String s) {

biweekly-52/SumOfFlooredPairs.java

@@ -0,0 +1,29 @@
+
+// https://leetcode.com/contest/biweekly-contest-52/problems/sum-of-floored-pairs/
+
+import java.util.Arrays;
+
+public class SumOfFlooredPairs {
+
+  // sweep
+  public int sumOfFlooredPairs(int[] nums) {
+    int max = Arrays.stream(nums).max().orElse(-1);
+    int[] vals = new int[max + 1];
+    for (int num : nums) {
+      vals[num]++;
+    }
+    for (int i = max; i > 0; i--) {
+      for (int j = 2 * i; j <= max; j += i) {
+        vals[j] += vals[i];
+      }
+    }
+    for (int i = 1; i < vals.length; i++) {
+      vals[i] += vals[i - 1];
+    }
+    int res = 0;
+    for (int num : nums) {
+      res = (res + vals[num]) % 1000000007;
+    }
+    return res;
+  }
+}