solve #167

Author: aylei

Diff for: src/lib.rs

@@ -153,3 +153,5 @@ mod n0155_min_stack;
 mod n0162_find_peak_element;
 mod n0164_maximum_gap;
 mod n0165_compare_version_numbers;
+mod n0166_fraction_to_recurring_decimal;
+mod n0167_two_sum_ii_input_array_is_sorted;

Diff for: src/n0166_fraction_to_recurring_decimal.rs

@@ -0,0 +1,49 @@
+/**
+ * [166] Fraction to Recurring Decimal
+ *
+ * Given two integers representing the numerator and denominator of a fraction, return the fraction in string format.
+ * 
+ * If the fractional part is repeating, enclose the repeating part in parentheses.
+ * 
+ * Example 1:
+ * 
+ * 
+ * Input: numerator = 1, denominator = 2
+ * Output: "0.5"
+ * 
+ * 
+ * Example 2:
+ * 
+ * 
+ * Input: numerator = 2, denominator = 1
+ * Output: "2"
+ * 
+ * Example 3:
+ * 
+ * 
+ * Input: numerator = 2, denominator = 3
+ * Output: "0.(6)"
+ * 
+ * 
+ */
+pub struct Solution {}
+
+// submission codes start here
+
+// TODO
+impl Solution {
+    pub fn fraction_to_decimal(numerator: i32, denominator: i32) -> String {
+        "".to_owned()
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_166() {
+    }
+}

Diff for: src/n0167_two_sum_ii_input_array_is_sorted.rs

@@ -0,0 +1,55 @@
+/**
+ * [167] Two Sum II - Input array is sorted
+ *
+ * Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.
+ * 
+ * The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2.
+ * 
+ * Note:
+ * 
+ * 
+ * 	Your returned answers (both index1 and index2) are not zero-based.
+ * 	You may assume that each input would have exactly one solution and you may not use the same element twice.
+ * 
+ * 
+ * Example:
+ * 
+ * 
+ * Input: numbers = [2,7,11,15], target = 9
+ * Output: [1,2]
+ * Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.
+ * 
+ */
+pub struct Solution {}
+
+// submission codes start here
+
+impl Solution {
+    pub fn two_sum(numbers: Vec<i32>, target: i32) -> Vec<i32> {
+        let mut i = 0_usize;
+        let mut j = numbers.len() - 1;
+        while i < j {
+            let sum = numbers[i] + numbers[j];
+            if sum > target {
+                j -= 1;
+            } else if sum < target {
+                i += 1;
+            } else {
+                break;
+            }
+        }
+        return vec![i as i32 + 1, j as i32 + 1]
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_167() {
+        assert_eq!(Solution::two_sum(vec![2,7,11,15], 9), vec![1,2]);
+    }
+}