feat: add solutions to lcof problem: No.21

面试题21. 调整数组顺序使奇数位于偶数前面

Author: YangFong

lcof/面试题21. 调整数组顺序使奇数位于偶数前面/README.md

@@ -114,6 +114,49 @@ public:
 };
 ```
 
+### **TypeScript**
+
+```ts
+function exchange(nums: number[]): number[] {
+    let l = 0;
+    let r = nums.length - 1;
+    while (l < r) {
+        if (nums[l] % 2 === 0) {
+            [nums[l], nums[r]] = [nums[r], nums[l]];
+            r--;
+        } else {
+            l++;
+        }
+    }
+    return nums;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn exchange(mut nums: Vec<i32>) -> Vec<i32> {
+        if nums.len() == 0 {
+            return nums;
+        }
+        let mut l = 0;
+        let mut r = nums.len() - 1;
+        while l < r {
+            let num = nums[l];
+            if num % 2 == 0 {
+                nums[l] = nums[r];
+                nums[r] = num;
+                r -= 1;
+            } else {
+                l += 1;
+            }
+        }
+        nums
+    }
+}
+```
+
 ### **...**
 
 ```

lcof/面试题21. 调整数组顺序使奇数位于偶数前面/Solution.rs

@@ -0,0 +1,20 @@
+impl Solution {
+    pub fn exchange(mut nums: Vec<i32>) -> Vec<i32> {
+        if nums.len() == 0 {
+            return nums;
+        }
+        let mut l = 0;
+        let mut r = nums.len() - 1;
+        while l < r {
+            let num = nums[l];
+            if num % 2 == 0 {
+                nums[l] = nums[r];
+                nums[r] = num;
+                r -= 1;
+            } else {
+                l += 1;
+            }
+        }
+        nums
+    }
+}

lcof/面试题21. 调整数组顺序使奇数位于偶数前面/Solution.ts

@@ -0,0 +1,13 @@
+function exchange(nums: number[]): number[] {
+    let l = 0;
+    let r = nums.length - 1;
+    while (l < r) {
+        if (nums[l] % 2 === 0) {
+            [nums[l], nums[r]] = [nums[r], nums[l]];
+            r--;
+        } else {
+            l++;
+        }
+    }
+    return nums;
+}