Solved 0405

Author: guangsheng.li01

src/a0405_convert_a_number_to_hexadecimal.rs

@@ -0,0 +1,60 @@
+/*
+ * [0405] convert-a-number-to-hexadecimal
+ */
+
+pub struct Solution {}
+
+// solution impl starts here
+
+impl Solution {
+    pub fn to_hex(num: i32) -> String {
+        if num == 0 {
+            return "0".to_string();
+        }
+        let s = "0123456789abcdef";
+        let m = 0x0000000f;
+        let mut n: i64 = num as i64 & 0xffffffff;
+        let mut r = String::new();
+        while n > 0 {
+            r.push(s.chars().nth((n & m) as usize).unwrap());
+            n >>= 4;
+        }
+        r.chars().rev().collect::<String>()
+    }
+}
+
+// solution impl ends here
+
+// solution tests starts here
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_case0() {
+        assert_eq!(Solution::to_hex(26), "1a");
+    }
+
+    #[test]
+    fn test_case1() {
+        assert_eq!(Solution::to_hex(-1), "ffffffff");
+    }
+
+    #[test]
+    fn test_case2() {
+        assert_eq!(Solution::to_hex(-2), "fffffffe");
+    }
+
+    #[test]
+    fn test_case3() {
+        assert_eq!(Solution::to_hex(0), "0");
+    }
+
+    #[test]
+    fn test_case4() {
+        assert_eq!(Solution::to_hex(111111), "1b207");
+    }
+}
+
+// solution tests ends here

src/lib.rs

@@ -11,6 +11,7 @@ mod a0145_binary_tree_postorder_traversal;
 mod a0172_factorial_trailing_zeroes;
 mod a0400_nth_digit;
 mod a0404_sum_of_left_leaves;
+mod a0405_convert_a_number_to_hexadecimal;
 mod a0617_merge_two_binary_trees;
 mod a0643_maximum_average_subarray_i;
 mod a0929_unique_email_addresses;