2149. Rearrange Array Elements by Sign: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1624,3 +1624,4 @@ mod s2145_count_the_hidden_sequences;
 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;

src/solution/s2149_rearrange_array_elements_by_sign.rs

@@ -0,0 +1,79 @@
+/**
+ * [2149] Rearrange Array Elements by Sign
+ *
+ * You are given a 0-indexed integer array nums of even length consisting of an equal number of positive and negative integers.
+ * You should return the array of nums such that the the array follows the given conditions:
+ * <ol>
+ * 	Every consecutive pair of integers have opposite signs.
+ * 	For all integers with the same sign, the order in which they were present in nums is preserved.
+ * 	The rearranged array begins with a positive integer.
+ * </ol>
+ * Return the modified array after rearranging the elements to satisfy the aforementioned conditions.
+ *  
+ * Example 1:
+ *
+ * Input: nums = [3,1,-2,-5,2,-4]
+ * Output: [3,-2,1,-5,2,-4]
+ * Explanation:
+ * The positive integers in nums are [3,1,2]. The negative integers are [-2,-5,-4].
+ * The only possible way to rearrange them such that they satisfy all conditions is [3,-2,1,-5,2,-4].
+ * Other ways such as [1,-2,2,-5,3,-4], [3,1,2,-2,-5,-4], [-2,3,-5,1,-4,2] are incorrect because they do not satisfy one or more conditions.  
+ *
+ * Example 2:
+ *
+ * Input: nums = [-1,1]
+ * Output: [1,-1]
+ * Explanation:
+ * 1 is the only positive integer and -1 the only negative integer in nums.
+ * So nums is rearranged to [1,-1].
+ *
+ *  
+ * Constraints:
+ *
+ * 	2 <= nums.length <= 2 * 10^5
+ * 	nums.length is even
+ * 	1 <= |nums[i]| <= 10^5
+ * 	nums consists of equal number of positive and negative integers.
+ *
+ *  
+ * It is not required to do the modifications in-place.
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/rearrange-array-elements-by-sign/
+// discuss: https://leetcode.com/problems/rearrange-array-elements-by-sign/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn rearrange_array(nums: Vec<i32>) -> Vec<i32> {
+        vec![]
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_2149_example_1() {
+        let nums = vec![3, 1, -2, -5, 2, -4];
+
+        let result = vec![3, -2, 1, -5, 2, -4];
+
+        assert_eq!(Solution::rearrange_array(nums), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_2149_example_2() {
+        let nums = vec![-1, 1];
+
+        let result = vec![1, -1];
+
+        assert_eq!(Solution::rearrange_array(nums), result);
+    }
+}