feat: content leetcode biweek52

Author: OneCodeMonkey

Diff for: contest/leetcode_biweek_57/[editing]leetcode_1943_Describe_the_Painting.java

@@ -0,0 +1,30 @@
+// TLE:
+// todo-qualify
+class Solution {
+    public int[] canSeePersonsCount(int[] heights) {
+        int size = heights.length;
+        int[] ret = new int[size];
+
+        int[] leftMax = new int[size];
+        leftMax[size - 1] = heights[size - 1];
+        for (int i = size - 2; i >= 0; i--) {
+            leftMax[i] = Math.max(heights[i], leftMax[i + 1]);
+        }
+
+        for (int i = size - 1; i >= 0; i--) {
+            int betweenMax = 0, canSeeCount = 0;
+            for (int j = i + 1; j < size; j++) {
+                if (heights[i] > betweenMax && heights[j] > betweenMax) {
+                    canSeeCount++;
+                    betweenMax = Math.max(betweenMax, heights[j]);
+                    if (heights[j] >= heights[i] || heights[j] >= leftMax[j] || betweenMax >= leftMax[j]) {
+                        break;
+                    }
+                }
+            }
+            ret[i] = canSeeCount;
+        }
+
+        return ret;
+    }
+}

Diff for: contest/leetcode_biweek_57/[editing]leetcode_1944_Number_of_Visible_People_in_a_Queue.java

@@ -0,0 +1,20 @@
+class Solution {
+    public boolean areOccurrencesEqual(String s) {
+        HashMap<Character, Integer> record = new HashMap<>();
+        for (char c: s.toCharArray()) {
+            record.merge(c, 1, Integer::sum);
+        }
+        int time = 0;
+        for (char c: record.keySet()) {
+            if (time == 0) {
+                time = record.get(c);
+            } else {
+                if (record.get(c) != time) {
+                    return false;
+                }
+            }
+        }
+
+        return true;
+    }
+}

Diff for: contest/leetcode_biweek_57/leetcode_1941_Check_if_All_Characters_Have_Equal_Number_of_Occurrences.java

@@ -0,0 +1,48 @@
+class Solution {
+    public int smallestChair(int[][] times, int targetFriend) {
+        int peopleNum = times.length;
+        int targetComeTime = times[targetFriend][0], targetLeaveTime = times[targetFriend][1];
+        Arrays.sort(times, new Comparator<int[]>() {
+            @Override
+            public int compare(int[] o1, int[] o2) {
+                return o1[0] - o2[0];
+            }
+        });
+        List<Integer> chairs = new ArrayList<>();
+
+        for (int i = 0; i < peopleNum; i++) {
+            int comeTime = times[i][0], leaveTime = times[i][1];
+            // 清理 leave
+            List<Integer> toRemoveIndex = new LinkedList<>();
+            for (int j = 0; j < chairs.size(); j++) {
+                if (chairs.get(j) <= comeTime) {
+                    toRemoveIndex.add(j);
+                }
+            }
+            for (int toRemove: toRemoveIndex) {
+                chairs.set(toRemove, 0);
+            }
+
+            int canSitIndex = -1;
+            for (int j = 0; j < chairs.size(); j++) {
+                if (chairs.get(j) == 0) {
+                    canSitIndex = j;
+                    break;
+                }
+            }
+            if (canSitIndex == -1) {
+                chairs.add(leaveTime);
+                if (comeTime == targetComeTime && leaveTime == targetLeaveTime) {
+                    return chairs.size() - 1;
+                }
+            } else {
+                chairs.set(canSitIndex, leaveTime);
+                if (comeTime == targetComeTime && leaveTime == targetLeaveTime) {
+                    return canSitIndex;
+                }
+            }
+        }
+
+        return -1;
+    }
+}