feat: update solutions to lc problems: No.2678~2683 (#3121)

Author: yanglbme

solution/2600-2699/2678.Number of Senior Citizens/README.md

@@ -135,52 +135,7 @@ func countSeniors(details []string) (ans int) {
 
 ```ts
 function countSeniors(details: string[]): number {
-    let ans = 0;
-    for (const x of details) {
-        const age = parseInt(x.slice(11, 13));
-        if (age > 60) {
-            ++ans;
-        }
-    }
-    return ans;
-}
-```
-
-#### Rust
-
-```rust
-impl Solution {
-    pub fn count_seniors(details: Vec<String>) -> i32 {
-        let mut ans = 0;
-
-        for s in details.iter() {
-            if let Ok(age) = s[11..13].parse::<i32>() {
-                if age > 60 {
-                    ans += 1;
-                }
-            }
-        }
-
-        ans
-    }
-}
-```
-
-<!-- tabs:end -->
-
-<!-- solution:end -->
-
-<!-- solution:start -->
-
-### 方法二
-
-<!-- tabs:start -->
-
-#### TypeScript
-
-```ts
-function countSeniors(details: string[]): number {
-    return details.filter(v => parseInt(v.slice(11, 13)) > 60).length;
+    return details.filter(x => +x.slice(11, 13) > 60).length;
 }
 ```
 

solution/2600-2699/2678.Number of Senior Citizens/README_EN.md

@@ -133,52 +133,7 @@ func countSeniors(details []string) (ans int) {
 
 ```ts
 function countSeniors(details: string[]): number {
-    let ans = 0;
-    for (const x of details) {
-        const age = parseInt(x.slice(11, 13));
-        if (age > 60) {
-            ++ans;
-        }
-    }
-    return ans;
-}
-```
-
-#### Rust
-
-```rust
-impl Solution {
-    pub fn count_seniors(details: Vec<String>) -> i32 {
-        let mut ans = 0;
-
-        for s in details.iter() {
-            if let Ok(age) = s[11..13].parse::<i32>() {
-                if age > 60 {
-                    ans += 1;
-                }
-            }
-        }
-
-        ans
-    }
-}
-```
-
-<!-- tabs:end -->
-
-<!-- solution:end -->
-
-<!-- solution:start -->
-
-### Solution 2
-
-<!-- tabs:start -->
-
-#### TypeScript
-
-```ts
-function countSeniors(details: string[]): number {
-    return details.filter(v => parseInt(v.slice(11, 13)) > 60).length;
+    return details.filter(x => +x.slice(11, 13) > 60).length;
 }
 ```
 

solution/2600-2699/2678.Number of Senior Citizens/Solution.rs

@@ -1,15 +1,9 @@
 impl Solution {
     pub fn count_seniors(details: Vec<String>) -> i32 {
-        let mut ans = 0;
-
-        for s in details.iter() {
-            if let Ok(age) = s[11..13].parse::<i32>() {
-                if age > 60 {
-                    ans += 1;
-                }
-            }
-        }
-
-        ans
+        details
+            .iter()
+            .filter_map(|s| s[11..13].parse::<i32>().ok())
+            .filter(|&age| age > 60)
+            .count() as i32
     }
 }

solution/2600-2699/2678.Number of Senior Citizens/Solution.ts

@@ -1,10 +1,3 @@
 function countSeniors(details: string[]): number {
-    let ans = 0;
-    for (const x of details) {
-        const age = parseInt(x.slice(11, 13));
-        if (age > 60) {
-            ++ans;
-        }
-    }
-    return ans;
+    return details.filter(x => +x.slice(11, 13) > 60).length;
 }

solution/2600-2699/2678.Number of Senior Citizens/Solution2.rs

@@ -168,22 +168,18 @@ function matrixSum(nums: number[][]): number {
 
 ```rust
 impl Solution {
-    pub fn matrix_sum(nums: Vec<Vec<i32>>) -> i32 {
-        let mut nums = nums;
-        for row in nums.iter_mut() {
+    pub fn matrix_sum(mut nums: Vec<Vec<i32>>) -> i32 {
+        for row in &mut nums {
             row.sort();
         }
-        let transposed: Vec<Vec<i32>> = (0..nums[0].len())
-            .map(|i| {
-                nums.iter()
-                    .map(|row| row[i])
-                    .collect()
-            })
-            .collect();
-
-        transposed
-            .iter()
-            .map(|row| row.iter().max().unwrap())
+        (0..nums[0].len())
+            .map(|col|
+                nums
+                    .iter()
+                    .map(|row| row[col])
+                    .max()
+                    .unwrap()
+            )
             .sum()
     }
 }
@@ -193,38 +189,4 @@ impl Solution {
 
 <!-- solution:end -->
 
-<!-- solution:start -->
-
-### 方法二
-
-<!-- tabs:start -->
-
-#### Rust
-
-```rust
-impl Solution {
-    pub fn matrix_sum(nums: Vec<Vec<i32>>) -> i32 {
-        let mut nums = nums.clone();
-        for row in nums.iter_mut() {
-            row.sort();
-        }
-
-        let mut ans = 0;
-        for j in 0..nums[0].len() {
-            let mut mx = 0;
-            for row in &nums {
-                mx = mx.max(row[j]);
-            }
-            ans += mx;
-        }
-
-        ans
-    }
-}
-```
-
-<!-- tabs:end -->
-
-<!-- solution:end -->
-
 <!-- problem:end -->

solution/2600-2699/2678.Number of Senior Citizens/Solution2.ts

@@ -159,22 +159,18 @@ function matrixSum(nums: number[][]): number {
 
 ```rust
 impl Solution {
-    pub fn matrix_sum(nums: Vec<Vec<i32>>) -> i32 {
-        let mut nums = nums;
-        for row in nums.iter_mut() {
+    pub fn matrix_sum(mut nums: Vec<Vec<i32>>) -> i32 {
+        for row in &mut nums {
             row.sort();
         }
-        let transposed: Vec<Vec<i32>> = (0..nums[0].len())
-            .map(|i| {
-                nums.iter()
-                    .map(|row| row[i])
-                    .collect()
-            })
-            .collect();
-
-        transposed
-            .iter()
-            .map(|row| row.iter().max().unwrap())
+        (0..nums[0].len())
+            .map(|col|
+                nums
+                    .iter()
+                    .map(|row| row[col])
+                    .max()
+                    .unwrap()
+            )
             .sum()
     }
 }
@@ -184,38 +180,4 @@ impl Solution {
 
 <!-- solution:end -->
 
-<!-- solution:start -->
-
-### Solution 2
-
-<!-- tabs:start -->
-
-#### Rust
-
-```rust
-impl Solution {
-    pub fn matrix_sum(nums: Vec<Vec<i32>>) -> i32 {
-        let mut nums = nums.clone();
-        for row in nums.iter_mut() {
-            row.sort();
-        }
-
-        let mut ans = 0;
-        for j in 0..nums[0].len() {
-            let mut mx = 0;
-            for row in &nums {
-                mx = mx.max(row[j]);
-            }
-            ans += mx;
-        }
-
-        ans
-    }
-}
-```
-
-<!-- tabs:end -->
-
-<!-- solution:end -->
-
 <!-- problem:end -->

solution/2600-2699/2679.Sum in a Matrix/README.md

@@ -1,20 +1,16 @@
 impl Solution {
-    pub fn matrix_sum(nums: Vec<Vec<i32>>) -> i32 {
-        let mut nums = nums;
-        for row in nums.iter_mut() {
+    pub fn matrix_sum(mut nums: Vec<Vec<i32>>) -> i32 {
+        for row in &mut nums {
             row.sort();
         }
-        let transposed: Vec<Vec<i32>> = (0..nums[0].len())
-            .map(|i| {
-                nums.iter()
-                    .map(|row| row[i])
-                    .collect()
-            })
-            .collect();
-
-        transposed
-            .iter()
-            .map(|row| row.iter().max().unwrap())
+        (0..nums[0].len())
+            .map(|col|
+                nums
+                    .iter()
+                    .map(|row| row[col])
+                    .max()
+                    .unwrap()
+            )
             .sum()
     }
 }