median of two-sorted array

README.md

@@ -27,4 +27,5 @@
 - [2024-05-16 只出现一次的数字](./single-number)
 - [2024-05-17 多数元素](./majority-element)
 - [2024-05-18 是否存在重复元素距离小于等于k](./check-duplicate-II)
+- [2024-05-19 两个有序数组的中位数](./median-of-two-sorted-arrays)
 

median-of-two-sorted-arrays/Cargo.toml

@@ -0,0 +1,6 @@
+[package]
+name = "median-of-two-sorted-arrays"
+version = "0.1.0"
+edition = "2021"
+
+[dependencies]

median-of-two-sorted-arrays/src/main.rs

@@ -0,0 +1,6 @@
+mod solution;
+use crate::solution::Solution;
+// https://leetcode.cn/problems/median-of-two-sorted-arrays/description/
+fn main() {
+    println!("Hello, world!{}", Solution::find_median_sorted_arrays(vec![1, 3], vec![2]));
+}

median-of-two-sorted-arrays/src/solution.rs

@@ -0,0 +1,39 @@
+pub struct Solution;
+impl Solution {
+    pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
+        // 首先需要排序，其次才能根据位置进行算中位数
+        let total_nums = &nums1.len() + &nums2.len();
+        // 中间位置为奇数
+        let mut is_one = true;
+        if total_nums % 2 == 0 {
+            // =偶数
+            is_one = false;
+        }
+        let mut merged = Vec::with_capacity(nums1.len() + nums2.len());
+        let mut i = 0;
+        let mut j = 0;
+
+        while i < nums1.len() && j < nums2.len() {
+            if nums1[i] < nums2[j] {
+                merged.push(nums1[i]);
+                i += 1;
+            } else {
+                merged.push(nums2[j]);
+                j += 1;
+            }
+        }
+
+        merged.extend_from_slice(&nums1[i..]);
+        merged.extend_from_slice(&nums2[j..]);
+
+        if total_nums > 0 {
+            if is_one {
+                return merged[total_nums /2 ] as f64/ 1.0;
+            }
+
+            return (merged[total_nums/2] + merged[total_nums/2 -1]) as f64/2.0;
+        }
+        0.0
+
+    }
+}

median-of-two-sorted-arrays/title.md

@@ -0,0 +1 @@
+2024-05-19 两个有序数组的中位数