feat: add solutions to lcof problem: No.41

面试题41. 数据流中的中位数

Author: YangFong

lcof/面试题41. 数据流中的中位数/README.md

@@ -205,6 +205,97 @@ private:
 };
 ```
 
+### **TypeScript**
+
+```ts
+class MedianFinder {
+    public arr: number[] = [];
+
+    constructor() {}
+
+    addNum(num: number): void {
+        const { arr } = this;
+        let l = 0;
+        let r = arr.length - 1;
+        while (l <= r) {
+            const mid = (l + r) >> 1;
+            if (arr[mid] < num) {
+                l = mid + 1;
+            } else {
+                r = mid - 1;
+            }
+        }
+        arr.splice(l, 0, num);
+    }
+
+    findMedian(): number {
+        const { arr } = this;
+        const n = arr.length;
+        if (n % 2 === 0) {
+            return (arr[n >> 1] + arr[(n >> 1) - 1]) / 2;
+        }
+        return arr[n >> 1];
+    }
+}
+
+/**
+ * Your MedianFinder object will be instantiated and called as such:
+ * var obj = new MedianFinder()
+ * obj.addNum(num)
+ * var param_2 = obj.findMedian()
+ */
+```
+
+### **Rust**
+
+```rust
+struct MedianFinder {
+    arr: Vec<i32>,
+}
+
+/**
+ * `&self` means the method takes an immutable reference.
+ * If you need a mutable reference, change it to `&mut self` instead.
+ */
+impl MedianFinder {
+    /** initialize your data structure here. */
+    fn new() -> Self {
+        MedianFinder {
+            arr: vec![]
+        }
+    }
+
+    fn add_num(&mut self, num: i32) {
+        let mut l = 0;
+        let mut r = self.arr.len();
+        while l < r {
+            let mid = l + r >> 1;
+            if self.arr[mid] < num {
+                l = mid + 1;
+            } else {
+                r = mid;
+            }
+        }
+        self.arr.splice(l..l, [num]);
+    }
+
+    fn find_median(&self) -> f64 {
+        let n = self.arr.len();
+        match n % 2 == 0 {
+            true => f64::from(self.arr[n >> 1] + self.arr[(n >> 1) - 1]) / 2.0,
+            false => f64::from(self.arr[n >> 1]),
+        }
+    }
+}
+
+/**
+ * Your MedianFinder object will be instantiated and called as such:
+ * let obj = MedianFinder::new();
+ * obj.add_num(num);
+ * let ret_2: f64 = obj.find_median();
+ */
+```
+
 ### **...**
 
 ```

lcof/面试题41. 数据流中的中位数/Solution.rs

@@ -0,0 +1,45 @@
+struct MedianFinder {
+    arr: Vec<i32>,
+}
+
+/**
+ * `&self` means the method takes an immutable reference.
+ * If you need a mutable reference, change it to `&mut self` instead.
+ */
+impl MedianFinder {
+    /** initialize your data structure here. */
+    fn new() -> Self {
+        MedianFinder {
+            arr: vec![]
+        }
+    }
+
+    fn add_num(&mut self, num: i32) {
+        let mut l = 0;
+        let mut r = self.arr.len();
+        while l < r {
+            let mid = l + r >> 1;
+            if self.arr[mid] < num {
+                l = mid + 1;
+            } else {
+                r = mid;
+            }
+        }
+        self.arr.splice(l..l, [num]);
+    }
+
+    fn find_median(&self) -> f64 {
+        let n = self.arr.len();
+        match n % 2 == 0 {
+            true => f64::from(self.arr[n >> 1] + self.arr[(n >> 1) - 1]) / 2.0,
+            false => f64::from(self.arr[n >> 1]),
+        }
+    }
+}
+
+/**
+ * Your MedianFinder object will be instantiated and called as such:
+ * let obj = MedianFinder::new();
+ * obj.add_num(num);
+ * let ret_2: f64 = obj.find_median();
+ */

lcof/面试题41. 数据流中的中位数/Solution.ts

@@ -0,0 +1,36 @@
+class MedianFinder {
+    public arr: number[] = [];
+
+    constructor() {}
+
+    addNum(num: number): void {
+        const { arr } = this;
+        let l = 0;
+        let r = arr.length - 1;
+        while (l <= r) {
+            const mid = (l + r) >> 1;
+            if (arr[mid] < num) {
+                l = mid + 1;
+            } else {
+                r = mid - 1;
+            }
+        }
+        arr.splice(l, 0, num);
+    }
+
+    findMedian(): number {
+        const { arr } = this;
+        const n = arr.length;
+        if (n % 2 === 0) {
+            return (arr[n >> 1] + arr[(n >> 1) - 1]) / 2;
+        }
+        return arr[n >> 1];
+    }
+}
+
+/**
+ * Your MedianFinder object will be instantiated and called as such:
+ * var obj = new MedianFinder()
+ * obj.addNum(num)
+ * var param_2 = obj.findMedian()
+ */