2150. Find All Lonely Numbers in the Array: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1625,3 +1625,4 @@ mod s2146_k_highest_ranked_items_within_a_price_range;
 mod s2147_number_of_ways_to_divide_a_long_corridor;
 mod s2148_count_elements_with_strictly_smaller_and_greater_elements;
 mod s2149_rearrange_array_elements_by_sign;
+mod s2150_find_all_lonely_numbers_in_the_array;

src/solution/s2150_find_all_lonely_numbers_in_the_array.rs

@@ -0,0 +1,74 @@
+/**
+ * [2150] Find All Lonely Numbers in the Array
+ *
+ * You are given an integer array nums. A number x is lonely when it appears only once, and no adjacent numbers (i.e. x + 1 and x - 1) appear in the array.
+ * Return all lonely numbers in nums. You may return the answer in any order.
+ *  
+ * Example 1:
+ *
+ * Input: nums = [10,6,5,8]
+ * Output: [10,8]
+ * Explanation:
+ * - 10 is a lonely number since it appears exactly once and 9 and 11 does not appear in nums.
+ * - 8 is a lonely number since it appears exactly once and 7 and 9 does not appear in nums.
+ * - 5 is not a lonely number since 6 appears in nums and vice versa.
+ * Hence, the lonely numbers in nums are [10, 8].
+ * Note that [8, 10] may also be returned.
+ *
+ * Example 2:
+ *
+ * Input: nums = [1,3,5,3]
+ * Output: [1,5]
+ * Explanation:
+ * - 1 is a lonely number since it appears exactly once and 0 and 2 does not appear in nums.
+ * - 5 is a lonely number since it appears exactly once and 4 and 6 does not appear in nums.
+ * - 3 is not a lonely number since it appears twice.
+ * Hence, the lonely numbers in nums are [1, 5].
+ * Note that [5, 1] may also be returned.
+ *
+ *  
+ * Constraints:
+ *
+ * 	1 <= nums.length <= 10^5
+ * 	0 <= nums[i] <= 10^6
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/find-all-lonely-numbers-in-the-array/
+// discuss: https://leetcode.com/problems/find-all-lonely-numbers-in-the-array/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn find_lonely(nums: Vec<i32>) -> Vec<i32> {
+        vec![]
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_2150_example_1() {
+        let nums = vec![10, 6, 5, 8];
+
+        let result = vec![10, 8];
+
+        assert_eq!(Solution::find_lonely(nums), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_2150_example_2() {
+        let nums = vec![1, 3, 5, 3];
+
+        let result = vec![1, 5];
+
+        assert_eq!(Solution::find_lonely(nums), result);
+    }
+}