2172. Maximum AND Sum of Array: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1642,3 +1642,4 @@ mod s2167_minimum_time_to_remove_all_cars_containing_illegal_goods;
 mod s2169_count_operations_to_obtain_zero;
 mod s2170_minimum_operations_to_make_the_array_alternating;
 mod s2171_removing_minimum_number_of_magic_beans;
+mod s2172_maximum_and_sum_of_array;

src/solution/s2172_maximum_and_sum_of_array.rs

@@ -0,0 +1,75 @@
+/**
+ * [2172] Maximum AND Sum of Array
+ *
+ * You are given an integer array nums of length n and an integer numSlots such that 2 * numSlots >= n. There are numSlots slots numbered from 1 to numSlots.
+ * You have to place all n integers into the slots such that each slot contains at most two numbers. The AND sum of a given placement is the sum of the bitwise AND of every number with its respective slot number.
+ *
+ * 	For example, the AND sum of placing the numbers [1, 3] into slot <u>1</u> and [4, 6] into slot <u>2</u> is equal to (1 AND <u>1</u>) + (3 AND <u>1</u>) + (4 AND <u>2</u>) + (6 AND <u>2</u>) = 1 + 1 + 0 + 2 = 4.
+ *
+ * Return the maximum possible AND sum of nums given numSlots slots.
+ *  
+ * Example 1:
+ *
+ * Input: nums = [1,2,3,4,5,6], numSlots = 3
+ * Output: 9
+ * Explanation: One possible placement is [1, 4] into slot <u>1</u>, [2, 6] into slot <u>2</u>, and [3, 5] into slot <u>3</u>.
+ * This gives the maximum AND sum of (1 AND <u>1</u>) + (4 AND <u>1</u>) + (2 AND <u>2</u>) + (6 AND <u>2</u>) + (3 AND <u>3</u>) + (5 AND <u>3</u>) = 1 + 0 + 2 + 2 + 3 + 1 = 9.
+ *
+ * Example 2:
+ *
+ * Input: nums = [1,3,10,4,7,1], numSlots = 9
+ * Output: 24
+ * Explanation: One possible placement is [1, 1] into slot <u>1</u>, [3] into slot <u>3</u>, [4] into slot <u>4</u>, [7] into slot <u>7</u>, and [10] into slot <u>9</u>.
+ * This gives the maximum AND sum of (1 AND <u>1</u>) + (1 AND <u>1</u>) + (3 AND <u>3</u>) + (4 AND <u>4</u>) + (7 AND <u>7</u>) + (10 AND <u>9</u>) = 1 + 1 + 3 + 4 + 7 + 8 = 24.
+ * Note that slots 2, 5, 6, and 8 are empty which is permitted.
+ *
+ *  
+ * Constraints:
+ *
+ * 	n == nums.length
+ * 	1 <= numSlots <= 9
+ * 	1 <= n <= 2 * numSlots
+ * 	1 <= nums[i] <= 15
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/maximum-and-sum-of-array/
+// discuss: https://leetcode.com/problems/maximum-and-sum-of-array/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn maximum_and_sum(nums: Vec<i32>, num_slots: i32) -> i32 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_2172_example_1() {
+        let nums = vec![1, 2, 3, 4, 5, 6];
+        let num_slots = 3;
+
+        let result = 9;
+
+        assert_eq!(Solution::maximum_and_sum(nums, num_slots), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_2172_example_2() {
+        let nums = vec![1, 3, 10, 4, 7, 1];
+        let num_slots = 9;
+
+        let result = 24;
+
+        assert_eq!(Solution::maximum_and_sum(nums, num_slots), result);
+    }
+}