fix

Author: 0xmountaintop

kamyu104/src/binary_watch.rs

@@ -1,14 +1,16 @@
 use std::collections::BTreeSet;
 
+// Time:  O(1)
+// Space: O(1)
+
 pub struct Solution {}
 impl Solution {
     pub fn read_binary_watch(num: i32) -> Vec<String> {
         let mut result: Vec<String> = Vec::new();
         (0..12).for_each(|h| {
             (0..60).for_each(|m| {
                 if (Solution::bit_count(h) + Solution::bit_count(m)) == num {
-                    let elem = format!("{}:{:02}", h, m);
-                    result.push(elem);
+                    result.push(format!("{}:{:02}", h, m));
                 }
             });
         });

kamyu104/src/single_number_iii.rs

@@ -1,3 +1,5 @@
+use std::collections::BTreeSet;
+
 // Time:  O(n)
 // Space: O(1)
 
@@ -49,8 +51,18 @@ mod tests {
 
     #[test]
     fn test_single_number() {
-        assert_eq!(Solution1::single_number(vec![1, 2, 1, 3, 2, 5]), vec![5, 3]);
+        assert_eq!(
+            Solution1::single_number(vec![1, 2, 1, 3, 2, 5])
+                .into_iter()
+                .collect::<BTreeSet<i32>>(),
+            vec![3, 5].into_iter().collect::<BTreeSet<i32>>()
+        );
 
-        assert_eq!(Solution2::single_number(vec![1, 2, 1, 3, 2, 5]), vec![3, 5]);
+        assert_eq!(
+            Solution2::single_number(vec![1, 2, 1, 3, 2, 5])
+                .into_iter()
+                .collect::<BTreeSet<i32>>(),
+            vec![3, 5].into_iter().collect::<BTreeSet<i32>>()
+        );
     }
 }