Merge remote-tracking branch 'origin/main' into main

Author: BGMer7

src/com/gatsby/_1302DeepestLeavesSum.java

@@ -0,0 +1,37 @@
+package com.gatsby;
+
+
+
+/**
+ * @ClassName: _1302DeepestLeavesSum
+ * @Description:
+ * @author: Gatsby
+ * @date: 2022/7/21 13:35
+ */
+
+public class _1302DeepestLeavesSum {
+    private int maxDepth = 0;
+    private int sum;
+
+    private void dfs(TreeNode root, int depth) {
+        if (root == null) {
+            return;
+        }
+        ++depth;
+        if (depth > maxDepth) {
+            maxDepth = depth;
+            sum = root.val;
+        } else if (depth == maxDepth) {
+            sum += root.val;
+        }
+        dfs(root.left, depth);
+        dfs(root.right, depth);
+    }
+
+    public int deepestLeavesSum(TreeNode root) {
+        dfs(root, 0);
+        return sum;
+    }
+}
+
+

src/com/gatsby/_452MinimumNumberOfArrowsToBurstBalloons.java

@@ -0,0 +1,34 @@
+package com.gatsby;
+
+import java.util.Arrays;
+
+/**
+ * @ClassName: _452MinimumNumberOfArrowsToBurstBalloons
+ * @Description: 452. 用最少数量的箭引爆气球
+ * @author: Gatsby
+ * @date: 2022/7/25 14:10
+ */
+
+public class _452MinimumNumberOfArrowsToBurstBalloons {
+    public int findMinArrowShots(int[][] points) {
+        Arrays.sort(points, (int[] point1, int[] point2) -> {
+            // case [[-2147483646,-2147483645],[2147483646,2147483647]]
+            // 如果使用a-b的话会导致溢出
+            return Integer.compare(point1[1], point2[1]);
+        });
+        int res = 1; // 至少要有一只箭
+        int maxCover = points[0][1]; // 以最右端为箭的最远端，判断下一个气球的最左边能不能被cover
+
+        for (int[] point : points) {
+            if (point[0] <= maxCover) {
+                continue;
+            } else {
+                res++;
+                maxCover = point[1];
+            }
+        }
+        return res;
+    }
+}
+
+

src/com/gatsby/_455AssignCookies.java

@@ -0,0 +1,28 @@
+package com.gatsby;
+
+import java.util.Arrays;
+
+/**
+ * @ClassName: _455AssignCookies
+ * @Description:
+ * @author: Gatsby
+ * @date: 2022/7/25 13:34
+ */
+
+public class _455AssignCookies {
+    public int findContentChildren(int[] appetite, int[] biscuits) {
+        Arrays.sort(appetite);
+        Arrays.sort(appetite);
+        Arrays.sort(biscuits);
+        int children = 0;
+        int a = appetite.length;
+        int b = biscuits.length;
+        for (int i = 0, j = 0; i < a && j < b; ++i, ++j) {
+            while (j < b && biscuits[j] < appetite[i]) ++j;
+            if (j < b) children++;
+        }
+        return children;
+    }
+}
+
+

src/com/gatsby/_81SearchInRotatedSortedArrayII.java

@@ -0,0 +1,32 @@
+package com.gatsby;
+
+/**
+ * @ClassName: _81SearchInRotatedSortedArrayII
+ * @Description:
+ * @author: Gatsby
+ * @date: 2022/7/25 14:26
+ */
+
+public class _81SearchInRotatedSortedArrayII {
+    public boolean search(int[] nums, int target) {
+        int left = 0;
+        int right = nums.length;
+        while (left < right) {
+            int mid = (right - left) / 2;
+            if (nums[mid] == target)
+                return true;
+            else if (nums[left] == nums[mid]) {
+                ++left;
+            } else if (nums[left] < nums[mid]) {
+                if (nums[left] <= target && target < nums[mid]) right = mid - 1;
+                else left = mid + 1;
+            } else {
+                if (nums[mid] < target && target <= nums[right]) left = mid + 1;
+                else right = mid - 1;
+            }
+        }
+        return false;
+    }
+}
+
+