Resolve #215

Author: aylei

Cargo.toml

@@ -12,4 +12,4 @@ serde_derive = "1.0"
 
 [lib]
 doctest = false
-test = false
+test = true

src/lib.rs

@@ -181,3 +181,5 @@ mod n0210_course_schedule_ii;
 mod n0211_add_and_search_word_data_structure_design;
 mod n0212_word_search_ii;
 mod n0213_house_robber_ii;
+mod n0214_shortest_palindrome;
+mod n0215_kth_largest_element_in_an_array;

src/n0213_house_robber_ii.rs

@@ -60,7 +60,7 @@ mod tests {
 
     #[test]
     fn test_213() {
-        assert_eq!(Solution::rob(vec![2,3,2], 3));
-        assert_eq!(Solution::rob(vec![1,2,3,1], 4));
+        assert_eq!(Solution::rob(vec![2,3,2]), 3);
+        assert_eq!(Solution::rob(vec![1,2,3,1]), 4);
     }
 }

src/n0214_shortest_palindrome.rs

@@ -0,0 +1,37 @@
+/**
+ * [214] Shortest Palindrome
+ *
+ * Given a string s, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrome you can find by performing this transformation.
+ *
+ * Example 1:
+ *
+ *
+ * Input: "aacecaaa"
+ * Output: "aaacecaaa"
+ *
+ *
+ * Example 2:
+ *
+ *
+ * Input: "abcd"
+ * Output: "dcbabcd"
+ */
+pub struct Solution {}
+
+// submission codes start here
+
+impl Solution {
+    pub fn shortest_palindrome(s: String) -> String {
+        "".to_owned()
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_214() {}
+}

src/n0215_kth_largest_element_in_an_array.rs

@@ -0,0 +1,62 @@
+/**
+ * [215] Kth Largest Element in an Array
+ *
+ * Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.
+ *
+ * Example 1:
+ *
+ *
+ * Input: [3,2,1,5,6,4] and k = 2
+ * Output: 5
+ *
+ *
+ * Example 2:
+ *
+ *
+ * Input: [3,2,3,1,2,4,5,5,6] and k = 4
+ * Output: 4
+ *
+ * Note: <br />
+ * You may assume k is always valid, 1 &le; k &le; array's length.
+ *
+ */
+pub struct Solution {}
+
+// submission codes start here
+
+use std::collections::BinaryHeap;
+use std::cmp::Reverse;
+impl Solution {
+    pub fn find_kth_largest(nums: Vec<i32>, k: i32) -> i32 {
+        let k = k as usize;
+        let mut heap = BinaryHeap::with_capacity(k);
+        for &num in nums.iter() {
+            if heap.len() < k as usize {
+                heap.push(Reverse(num))
+            } else if num >= heap.peek().unwrap().0 {
+                heap.pop();
+                heap.push(Reverse(num));
+            }
+        }
+        heap.peek().unwrap().0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_215() {
+        assert_eq!(Solution::find_kth_largest(
+            vec![3, 2, 3, 1, 2, 4, 5, 5, 6],
+            4
+        ), 4);
+        assert_eq!(Solution::find_kth_largest(
+            vec![3,2,1,5,6,4],
+            2
+        ), 5);
+    }
+}