7-20-2020

Author: safrannn

src/_0724_find_pivot_index.rs

@@ -0,0 +1,21 @@
+struct Solution;
+
+impl Solution {
+    pub fn pivot_index(nums: Vec<i32>) -> i32 {
+        let sum_all: i32 = nums.iter().sum();
+        let mut sum: i32 = 0;
+        for (i, v) in nums.iter().enumerate() {
+            if sum == sum_all - v - sum {
+                return i as i32;
+            }
+            sum += v;
+        }
+        -1
+    }
+}
+
+#[test]
+fn test() {
+    assert_eq!(Solution::pivot_index(vec![1, 7, 3, 6, 5, 6]), 3);
+    assert_eq!(Solution::pivot_index(vec![1, 2, 3]), -1);
+}

src/_1029_two_city_scheduling.rs

@@ -0,0 +1,20 @@
+struct Solution;
+
+impl Solution {
+    pub fn two_city_sched_cost(costs: Vec<Vec<i32>>) -> i32 {
+        let n: usize = costs.len();
+        let mut diff: Vec<i32> = costs.iter().map(|v| v[0] - v[1]).collect();
+        diff.sort_unstable();
+        let sum_cityb: i32 = costs.iter().map(|v| v[1]).sum();
+        let sum_diff: i32 = diff.iter().take(n / 2).sum();
+        sum_cityb + sum_diff
+    }
+}
+
+#[test]
+fn test() {
+    assert_eq!(
+        Solution::two_city_sched_cost(vec_vec_i32![[10, 20], [30, 200], [400, 50], [30, 20]]),
+        110
+    );
+}

src/lib.rs

@@ -110,6 +110,8 @@ mod _0605_can_place_flowers;
 //
 mod _0680_valid_palindrome_ii;
 //
+mod _0724_find_pivot_index;
+//
 mod _0735_asteroid_collision;
 //
 mod _0771_jewels_and_stones;
@@ -122,6 +124,8 @@ mod _0953_verifying_an_alien_dictionary;
 //
 mod _0977_squares_of_a_sorted_array;
 //
+mod _1029_two_city_scheduling;
+//
 mod _1281_subtract_the_product_and_sum_of_digits_of_an_integer;
 //
 mod _1287_element_appearing_more_than_25_in_sorted_array;