feat: add solutions to lcof problem: No.42

面试题42. 连续子数组的最大和

Author: YangFong

lcof/面试题42. 连续子数组的最大和/README.md

@@ -110,6 +110,34 @@ func maxSubArray(nums []int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function maxSubArray(nums: number[]): number {
+    let res = nums[0];
+    for (let i = 1; i < nums.length; i++) {
+        nums[i] = Math.max(nums[i], nums[i - 1] + nums[i]);
+        res = Math.max(res, nums[i]);
+    }
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn max_sub_array(mut nums: Vec<i32>) -> i32 {
+        let mut res = nums[0];
+        for i in 1..nums.len() {
+            nums[i] = nums[i].max(nums[i - 1] + nums[i]);
+            res = res.max(nums[i]);
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

lcof/面试题42. 连续子数组的最大和/Solution.rs

@@ -0,0 +1,10 @@
+impl Solution {
+    pub fn max_sub_array(mut nums: Vec<i32>) -> i32 {
+        let mut res = nums[0];
+        for i in 1..nums.len() {
+            nums[i] = nums[i].max(nums[i - 1] + nums[i]);
+            res = res.max(nums[i]);
+        }
+        res
+    }
+}

lcof/面试题42. 连续子数组的最大和/Solution.ts

@@ -0,0 +1,8 @@
+function maxSubArray(nums: number[]): number {
+    let res = nums[0];
+    for (let i = 1; i < nums.length; i++) {
+        nums[i] = Math.max(nums[i], nums[i - 1] + nums[i]);
+        res = Math.max(res, nums[i]);
+    }
+    return res;
+}