8-19-2020

Author: safrannn

src/_0215_kth_largest_element_in_an_array.rs

@@ -0,0 +1,44 @@
+struct Solution;
+
+impl Solution {
+    pub fn find_kth_largest(mut nums: Vec<i32>, k: i32) -> i32 {
+        let mut l: usize = 0;
+        let mut r: usize = nums.len() - 1;
+        let k: usize = nums.len() - k as usize;
+        while l < r {
+            let pivot: usize = Self::partition(&mut nums, l, r);
+            // println!("{},{},{}",l,r,pivot);
+            if pivot == k {
+                break;
+            } else if pivot < k {
+                l = pivot + 1;
+            } else {
+                r = pivot - 1
+            }
+        }
+        nums[k]
+    }
+
+    fn partition(nums: &mut Vec<i32>, l: usize, r: usize) -> usize {
+        nums.swap((l + r) / 2, r);
+        let mut j = l;
+        let pivot_value = nums[r];
+        for i in l..r {
+            if nums[i] <= pivot_value {
+                nums.swap(i, j);
+                j += 1;
+            }
+        }
+        nums.swap(j, r);
+        j
+    }
+}
+
+#[test]
+fn test() {
+    assert_eq!(Solution::find_kth_largest(vec![3, 2, 1, 5, 6, 4], 2), 5);
+    assert_eq!(
+        Solution::find_kth_largest(vec![3, 2, 3, 1, 2, 4, 5, 5, 6], 4),
+        4
+    );
+}

src/_0973_k_closest_points_to_origin.rs

@@ -0,0 +1,20 @@
+// struct Solution;
+
+// impl Solution {
+//     pub fn k_closest(mut points: Vec<Vec<i32>>, k: i32) -> Vec<Vec<i32>> {
+//         // sort according to v[0]^2 * v[1]^2
+//         vec![]
+//     }
+// }
+
+// #[test]
+// fn test() {
+//     assert_eq!(
+//         Solution::k_closest(vec_vec_i32![[1, 3], [-2, 2]], 1),
+//         vec_vec_i32![[-2, 2]]
+//     );
+//     assert_eq!(
+//         Solution::k_closest(vec_vec_i32![[3, 3], [5, -1], [-2, 4]], 2),
+//         vec_vec_i32![[3, 3], [-2, 4]]
+//     );
+// }

src/lib.rs

@@ -96,6 +96,8 @@ mod _0206_reverse_linked_list;
 //
 mod _0210_course_schedule_ii;
 //
+mod _0215_kth_largest_element_in_an_array;
+//
 mod _0219_contains_duplicate_ii;
 //
 mod _0234_palindrome_linked_list;
@@ -198,6 +200,8 @@ mod _0938_range_sum_of_bst;
 //
 mod _0953_verifying_an_alien_dictionary;
 //
+mod _0973_k_closest_points_to_origin;
+//
 mod _0977_squares_of_a_sorted_array;
 //
 mod _0994_rotting_oranges;