2081. Sum of k-Mirror Numbers: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1570,3 +1570,4 @@ mod s2076_process_restricted_friend_requests;
 mod s2078_two_furthest_houses_with_different_colors;
 mod s2079_watering_plants;
 mod s2080_range_frequency_queries;
+mod s2081_sum_of_k_mirror_numbers;

src/solution/s2081_sum_of_k_mirror_numbers.rs

@@ -0,0 +1,106 @@
+/**
+ * [2081] Sum of k-Mirror Numbers
+ *
+ * A k-mirror number is a positive integer without leading zeros that reads the same both forward and backward in base-10 as well as in base-k.
+ *
+ * 	For example, 9 is a 2-mirror number. The representation of 9 in base-10 and base-2 are 9 and 1001 respectively, which read the same both forward and backward.
+ * 	On the contrary, 4 is not a 2-mirror number. The representation of 4 in base-2 is 100, which does not read the same both forward and backward.
+ *
+ * Given the base k and the number n, return the sum of the n smallest k-mirror numbers.
+ *  
+ * Example 1:
+ *
+ * Input: k = 2, n = 5
+ * Output: 25
+ * Explanation:
+ * The 5 smallest 2-mirror numbers and their representations in base-2 are listed as follows:
+ *   base-10    base-2
+ *     1          1
+ *     3          11
+ *     5          101
+ *     7          111
+ *     9          1001
+ * Their sum = 1 + 3 + 5 + 7 + 9 = 25.
+ *
+ * Example 2:
+ *
+ * Input: k = 3, n = 7
+ * Output: 499
+ * Explanation:
+ * The 7 smallest 3-mirror numbers are and their representations in base-3 are listed as follows:
+ *   base-10    base-3
+ *     1          1
+ *     2          2
+ *     4          11
+ *     8          22
+ *     121        11111
+ *     151        12121
+ *     212        21212
+ * Their sum = 1 + 2 + 4 + 8 + 121 + 151 + 212 = 499.
+ *
+ * Example 3:
+ *
+ * Input: k = 7, n = 17
+ * Output: 20379000
+ * Explanation: The 17 smallest 7-mirror numbers are:
+ * 1, 2, 3, 4, 5, 6, 8, 121, 171, 242, 292, 16561, 65656, 2137312, 4602064, 6597956, 6958596
+ *
+ *  
+ * Constraints:
+ *
+ * 	2 <= k <= 9
+ * 	1 <= n <= 30
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/sum-of-k-mirror-numbers/
+// discuss: https://leetcode.com/problems/sum-of-k-mirror-numbers/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn k_mirror(k: i32, n: i32) -> i64 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_2081_example_1() {
+        let k = 2;
+        let n = 5;
+
+        let result = 25;
+
+        assert_eq!(Solution::k_mirror(k, n), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_2081_example_2() {
+        let k = 3;
+        let n = 7;
+
+        let result = 499;
+
+        assert_eq!(Solution::k_mirror(k, n), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_2081_example_3() {
+        let k = 7;
+        let n = 17;
+
+        let result = 20379000;
+
+        assert_eq!(Solution::k_mirror(k, n), result);
+    }
+}