Solve #219 and #220

Author: aylei

src/lib.rs

@@ -184,3 +184,7 @@ mod n0213_house_robber_ii;
 mod n0214_shortest_palindrome;
 mod n0215_kth_largest_element_in_an_array;
 mod n0216_combination_sum_iii;
+mod n0217_contains_duplicate;
+mod n0218_the_skyline_problem;
+mod n0220_contains_duplicate_iii;
+mod n0219_contains_duplicate_ii;

src/n0217_contains_duplicate.rs

@@ -0,0 +1,60 @@
+/**
+ * [217] Contains Duplicate
+ *
+ * Given an array of integers, find if the array contains any duplicates.
+ *
+ * Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.
+ *
+ * Example 1:
+ *
+ *
+ * Input: [1,2,3,1]
+ * Output: true
+ *
+ * Example 2:
+ *
+ *
+ * Input: [1,2,3,4]
+ * Output: false
+ *
+ * Example 3:
+ *
+ *
+ * Input: [1,1,1,3,3,4,3,2,4,2]
+ * Output: true
+ *
+ */
+pub struct Solution {}
+
+// submission codes start here
+
+impl Solution {
+    pub fn contains_duplicate(nums: Vec<i32>) -> bool {
+        if nums.is_empty() { return false }
+        let mut nums = nums;
+        nums.sort_unstable();
+        let mut prev = nums[0];
+        for i in 1..nums.len() {
+            if nums[i] == prev {
+                return true
+            }
+            prev = nums[i]
+        }
+        false
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_217() {
+        assert_eq!(Solution::contains_duplicate(vec![1]), false);
+        assert_eq!(Solution::contains_duplicate(vec![]), false);
+        assert_eq!(Solution::contains_duplicate(vec![1,2,3,4]), false);
+        assert_eq!(Solution::contains_duplicate(vec![1,2,3,1]), true);
+    }
+}

src/n0218_the_skyline_problem.rs

@@ -0,0 +1,43 @@
+/**
+ * [218] The Skyline Problem
+ *
+ * A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose you are given the locations and height of all the buildings as shown on a cityscape photo (Figure A), write a program to output the skyline formed by these buildings collectively (Figure B).
+ * <a href="/static/images/problemset/skyline1.jpg" target="_blank"><img alt="Buildings" src="https://assets.leetcode.com/uploads/2018/10/22/skyline1.png" style="max-width: 45%; border-width: 0px; border-style: solid;" /> </a> <a href="/static/images/problemset/skyline2.jpg" target="_blank"> <img alt="Skyline Contour" src="https://assets.leetcode.com/uploads/2018/10/22/skyline2.png" style="max-width: 45%; border-width: 0px; border-style: solid;" /> </a>
+ *
+ * The geometric information of each building is represented by a triplet of integers [Li, Ri, Hi], where Li and Ri are the x coordinates of the left and right edge of the ith building, respectively, and Hi is its height. It is guaranteed that 0 &le; Li, Ri &le; INT_MAX, 0 < Hi &le; INT_MAX, and Ri - Li > 0. You may assume all buildings are perfect rectangles grounded on an absolutely flat surface at height 0.
+ *
+ * For instance, the dimensions of all buildings in Figure A are recorded as: [ [2 9 10], [3 7 15], [5 12 12], [15 20 10], [19 24 8] ] .
+ *
+ * The output is a list of "key points" (red dots in Figure B) in the format of [ [x1,y1], [x2, y2], [x3, y3], ... ] that uniquely defines a skyline. A key point is the left endpoint of a horizontal line segment. Note that the last key point, where the rightmost building ends, is merely used to mark the termination of the skyline, and always has zero height. Also, the ground in between any two adjacent buildings should be considered part of the skyline contour.
+ *
+ * For instance, the skyline in Figure B should be represented as:[ [2 10], [3 15], [7 12], [12 0], [15 10], [20 8], [24, 0] ].
+ *
+ * Notes:
+ *
+ *
+ * 	The number of buildings in any input list is guaranteed to be in the range [0, 10000].
+ * 	The input list is already sorted in ascending order by the left x position Li.
+ * 	The output list must be sorted by the x position.
+ * 	There must be no consecutive horizontal lines of equal height in the output skyline. For instance, [...[2 3], [4 5], [7 5], [11 5], [12 7]...] is not acceptable; the three lines of height 5 should be merged into one in the final output as such: [...[2 3], [4 5], [12 7], ...]
+ *
+ *
+ */
+pub struct Solution {}
+
+// submission codes start here
+
+impl Solution {
+    pub fn get_skyline(buildings: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
+        vec![]
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_218() {}
+}

src/n0219_contains_duplicate_ii.rs

@@ -0,0 +1,68 @@
+/**
+ * [219] Contains Duplicate II
+ *
+ * Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at most k.
+ *
+ * <div>
+ * Example 1:
+ *
+ *
+ * Input: nums = <span id="example-input-1-1">[1,2,3,1]</span>, k = <span id="example-input-1-2">3</span>
+ * Output: <span id="example-output-1">true</span>
+ *
+ *
+ * <div>
+ * Example 2:
+ *
+ *
+ * Input: nums = <span id="example-input-2-1">[1,0,1,1]</span>, k = <span id="example-input-2-2">1</span>
+ * Output: <span id="example-output-2">true</span>
+ *
+ *
+ * <div>
+ * Example 3:
+ *
+ *
+ * Input: nums = <span id="example-input-3-1">[1,2,3,1,2,3]</span>, k = <span id="example-input-3-2">2</span>
+ * Output: <span id="example-output-3">false</span>
+ *
+ * </div>
+ * </div>
+ * </div>
+ *
+ */
+pub struct Solution {}
+
+// submission codes start here
+
+use std::collections::HashMap;
+impl Solution {
+    pub fn contains_nearby_duplicate(nums: Vec<i32>, k: i32) -> bool {
+        let mut map = HashMap::new();
+        for (idx, &num) in nums.iter().enumerate() {
+            match map.get(&num) {
+                Some(v) => {
+                    if idx - v <= k as usize {
+                        return true;
+                    }
+                    map.insert(num, idx);
+                },
+                None => { map.insert(num, idx); },
+            }
+        }
+        false
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_219() {
+        assert_eq!(Solution::contains_nearby_duplicate(vec![1,2,3,1,2,3], 2), false);
+        assert_eq!(Solution::contains_nearby_duplicate(vec![1,2,3,1,2,3], 3), true);
+    }
+}

src/n0220_contains_duplicate_iii.rs

@@ -0,0 +1,73 @@
+/**
+ * [220] Contains Duplicate III
+ *
+ * Given an array of integers, find out whether there are two distinct indices i and j in the array such that the absolute difference between nums[i] and nums[j] is at most t and the absolute difference between i and j is at most k.
+ *
+ * <div>
+ * Example 1:
+ *
+ *
+ * Input: nums = <span id="example-input-1-1">[1,2,3,1]</span>, k = <span id="example-input-1-2">3</span>, t = <span id="example-input-1-3">0</span>
+ * Output: <span id="example-output-1">true</span>
+ *
+ *
+ * <div>
+ * Example 2:
+ *
+ *
+ * Input: nums = <span id="example-input-2-1">[1,0,1,1]</span>, k = <span id="example-input-2-2">1</span>, t = <span id="example-input-2-3">2</span>
+ * Output: <span id="example-output-2">true</span>
+ *
+ *
+ * <div>
+ * Example 3:
+ *
+ *
+ * Input: nums = <span id="example-input-3-1">[1,5,9,1,5,9]</span>, k = <span id="example-input-3-2">2</span>, t = <span id="example-input-3-3">3</span>
+ * Output: <span id="example-output-3">false</span>
+ *
+ * </div>
+ * </div>
+ * </div>
+ *
+ */
+pub struct Solution {}
+
+// submission codes start here
+use std::collections::HashMap;
+impl Solution {
+    pub fn contains_nearby_almost_duplicate(nums: Vec<i32>, k: i32, t: i32) -> bool {
+        if k < 1 || t < 0 { return false }
+        let mut map = HashMap::new();
+        for i in 0..nums.len() {
+            let remap = nums[i] as i64 - i32::min_value() as i64;
+            let bucket = remap / (t as i64 + 1);
+            println!("{} {}", remap, bucket);
+            if map.contains_key(&bucket)
+                || map.get(&(bucket-1)).map_or(false, |v| { remap - v <= t as i64})
+                || map.get(&(bucket+1)).map_or(false, |v| { v - remap <= t as i64}) {
+                    return true
+            }
+            if i >= k as usize {
+                let last_bucket = (nums[i - k as usize] as i64 - i32::min_value() as i64) / (t as i64 + 1);
+                map.remove(&last_bucket);
+            }
+            map.insert(bucket, remap);
+        }
+        false
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_220() {
+        // assert_eq!(Solution::contains_nearby_almost_duplicate(vec![1,5,9,1,5,9], 2, 3), false);
+        // assert_eq!(Solution::contains_nearby_almost_duplicate(vec![1,2,3,1], 3, 0), true);
+        assert_eq!(Solution::contains_nearby_almost_duplicate(vec![-1,2147483647], 1 ,2147483647), false);
+    }
+}