update

Author: OneCodeMonkey

leetcode_solved/leetcode_3487_Maximum_Unique_Subarray_Sum_After_Deletion.java

@@ -0,0 +1,27 @@
+// Runtime 2 ms Beats 100.00% 
+// Memory 42.04 MB Beats 100.00%
+// .
+// T:O(n), S:O(n)
+// 
+class Solution {
+    public int maxSum(int[] nums) {
+        int ret = 0, maxNonPosi = Integer.MIN_VALUE;
+        HashSet<Integer> record = new HashSet<>();
+        for (int num : nums) {
+            if (num > 0) {
+                record.add(num);
+            } else {
+                maxNonPosi = Math.max(maxNonPosi, num);
+            }
+        }
+        if (record.size() == 0) {
+            return maxNonPosi;
+        }
+
+        for (int i : record) {
+            ret += i;
+        }
+
+        return ret;
+    }
+}

leetcode_solved/leetcode_3492_Maximum_Containers_on_a_Ship.java

@@ -0,0 +1,10 @@
+// Runtime 0 ms Beats 100.00% 
+// Memory 40.98 MB Beats 65.69%
+// .
+// T:O(1), S:O(1)
+// 
+class Solution {
+    public int maxContainers(int n, int w, int maxWeight) {
+        return Math.min(n * n, maxWeight / w);
+    }
+}