Solved 0169 & 0343

Author: guangsheng.li01

src/a0169_majority_element.rs

@@ -0,0 +1,43 @@
+/*
+ * [0169] majority-element
+ */
+
+pub struct Solution {}
+
+// solution impl starts here
+
+impl Solution {
+    pub fn majority_element(nums: Vec<i32>) -> i32 {
+        let mut i = 0;
+        let mut count = 0;
+        for j in nums {
+            if count == 0 {
+                i = j;
+            }
+            count += if j == i { 1 } else { -1 }
+        }
+        i
+    }
+}
+
+// solution impl ends here
+
+// solution tests starts here
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_case0() {
+        assert_eq!(Solution::majority_element(vec![3, 2, 3]), 3);
+        assert_eq!(Solution::majority_element(vec![3, 3, 4]), 3);
+    }
+
+    #[test]
+    fn test_case1() {
+        assert_eq!(Solution::majority_element(vec![2, 2, 1, 1, 1, 2, 2]), 2);
+    }
+}
+
+// solution tests ends here

src/a0343_integer_break.rs

@@ -0,0 +1,44 @@
+/*
+ * [0343] integer-break
+ */
+
+pub struct Solution {}
+
+// solution impl starts here
+
+impl Solution {
+    pub fn integer_break(n: i32) -> i32 {
+        if n <= 3 {
+            return n - 1;
+        }
+
+        let a = n / 3;
+        let b = n % 3;
+        if b == 0 {
+            return 3i32.pow(a as u32);
+        }
+
+        if b == 1 {
+            return 3i32.pow(a as u32 - 1) * 4;
+        }
+
+        3i32.pow(a as u32) * 2
+    }
+}
+
+// solution impl ends here
+
+// solution tests starts here
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_case0() {
+        assert_eq!(Solution::integer_break(2), 1);
+        assert_eq!(Solution::integer_break(10), 36);
+    }
+}
+
+// solution tests ends here

src/lib.rs

@@ -19,8 +19,10 @@ mod a0103_binary_tree_zigzag_level_order_traversal;
 mod a0118_pascals_triangle;
 mod a0119_pascals_triangle_ii;
 mod a0145_binary_tree_postorder_traversal;
+mod a0169_majority_element;
 mod a0172_factorial_trailing_zeroes;
 mod a0322_coin_change;
+mod a0343_integer_break;
 mod a0392_is_subsequence;
 mod a0400_nth_digit;
 mod a0404_sum_of_left_leaves;