feat: add solutions to lc problem: No.1470

No.1470.Shuffle the Array

Author: YangFong

solution/1400-1499/1470.Shuffle the Array/README.md

@@ -126,6 +126,63 @@ func shuffle(nums []int, n int) []int {
 }
 ```
 
+### **C**
+
+```c
+/**
+ * Note: The returned array must be malloced, assume caller calls free().
+ */
+int *shuffle(int *nums, int numsSize, int n, int *returnSize) {
+    int *res = (int *) malloc(sizeof(int) * n * 2);
+    for (int i = 0; i < n; i++) {
+        res[2 * i] = nums[i];
+        res[2 * i + 1] = nums[i + n];
+    }
+    *returnSize = n * 2;
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn shuffle(nums: Vec<i32>, n: i32) -> Vec<i32> {
+        let n = n as usize;
+        let mut res = Vec::new();
+        for i in 0..n {
+            res.push(nums[i]);
+            res.push(nums[n + i]);
+        }
+        res
+    }
+}
+```
+
+```rust
+impl Solution {
+    pub fn shuffle(mut nums: Vec<i32>, n: i32) -> Vec<i32> {
+        let n = n as usize;
+        for i in 0..n * 2 {
+            let mut j = i;
+            while nums[i] > 0 {
+                j = if j < n {
+                    2 * j
+                } else {
+                    2 * (j - n) + 1
+                };
+                nums.swap(i, j);
+                nums[j] *= -1;
+            }
+        }
+        for i in 0..n * 2 {
+            nums[i] *= -1;
+        }
+        nums
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1400-1499/1470.Shuffle the Array/README_EN.md

@@ -131,6 +131,63 @@ func shuffle(nums []int, n int) []int {
 }
 ```
 
+### **C**
+
+```c
+/**
+ * Note: The returned array must be malloced, assume caller calls free().
+ */
+int *shuffle(int *nums, int numsSize, int n, int *returnSize) {
+    int *res = (int *) malloc(sizeof(int) * n * 2);
+    for (int i = 0; i < n; i++) {
+        res[2 * i] = nums[i];
+        res[2 * i + 1] = nums[i + n];
+    }
+    *returnSize = n * 2;
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn shuffle(nums: Vec<i32>, n: i32) -> Vec<i32> {
+        let n = n as usize;
+        let mut res = Vec::new();
+        for i in 0..n {
+            res.push(nums[i]);
+            res.push(nums[n + i]);
+        }
+        res
+    }
+}
+```
+
+```rust
+impl Solution {
+    pub fn shuffle(mut nums: Vec<i32>, n: i32) -> Vec<i32> {
+        let n = n as usize;
+        for i in 0..n * 2 {
+            let mut j = i;
+            while nums[i] > 0 {
+                j = if j < n {
+                    2 * j
+                } else {
+                    2 * (j - n) + 1
+                };
+                nums.swap(i, j);
+                nums[j] *= -1;
+            }
+        }
+        for i in 0..n * 2 {
+            nums[i] *= -1;
+        }
+        nums
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1400-1499/1470.Shuffle the Array/Solution.c

@@ -0,0 +1,12 @@
+/**
+ * Note: The returned array must be malloced, assume caller calls free().
+ */
+int *shuffle(int *nums, int numsSize, int n, int *returnSize) {
+    int *res = (int *) malloc(sizeof(int) * n * 2);
+    for (int i = 0; i < n; i++) {
+        res[2 * i] = nums[i];
+        res[2 * i + 1] = nums[i + n];
+    }
+    *returnSize = n * 2;
+    return res;
+}

solution/1400-1499/1470.Shuffle the Array/Solution.rs

@@ -0,0 +1,11 @@
+impl Solution {
+    pub fn shuffle(nums: Vec<i32>, n: i32) -> Vec<i32> {
+        let n = n as usize;
+        let mut res = Vec::new();
+        for i in 0..n {
+            res.push(nums[i]);
+            res.push(nums[n + i]);
+        }
+        res
+    }
+}