From f866ee0199f44189c5188a244f9731f685f1b496 Mon Sep 17 00:00:00 2001
From: yanglbme <szuyanglb@outlook.com>
Date: Tue, 8 Jul 2025 06:57:47 +0800
Subject: [PATCH] feat: add rust solution to lc problem: No.1751

No.1751.Maximum Number of Events That Can Be Attended II
---
 .../README.md                                 | 78 +++++++++++++++++++
 .../README_EN.md                              | 78 +++++++++++++++++++
 .../Solution.rs                               | 36 +++++++++
 .../Solution2.rs                              | 32 ++++++++
 4 files changed, 224 insertions(+)
 create mode 100644 solution/1700-1799/1751.Maximum Number of Events That Can Be Attended II/Solution.rs
 create mode 100644 solution/1700-1799/1751.Maximum Number of Events That Can Be Attended II/Solution2.rs

diff --git a/solution/1700-1799/1751.Maximum Number of Events That Can Be Attended II/README.md b/solution/1700-1799/1751.Maximum Number of Events That Can Be Attended II/README.md
index 0ae985fff2bd2..6b6997b781b93 100644
--- a/solution/1700-1799/1751.Maximum Number of Events That Can Be Attended II/README.md	
+++ b/solution/1700-1799/1751.Maximum Number of Events That Can Be Attended II/README.md	
@@ -257,6 +257,47 @@ function maxValue(events: number[][], k: number): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn max_value(mut events: Vec<Vec<i32>>, k: i32) -> i32 {
+        events.sort_by_key(|e| e[0]);
+        let n = events.len();
+        let mut f = vec![vec![0; (k + 1) as usize]; n];
+
+        fn dfs(i: usize, k: i32, events: &Vec<Vec<i32>>, f: &mut Vec<Vec<i32>>, n: usize) -> i32 {
+            if i >= n || k <= 0 {
+                return 0;
+            }
+            if f[i][k as usize] != 0 {
+                return f[i][k as usize];
+            }
+            let j = search(events, events[i][1], i + 1, n);
+            let ans = dfs(i + 1, k, events, f, n).max(dfs(j, k - 1, events, f, n) + events[i][2]);
+            f[i][k as usize] = ans;
+            ans
+        }
+
+        fn search(events: &Vec<Vec<i32>>, x: i32, lo: usize, n: usize) -> usize {
+            let mut l = lo;
+            let mut r = n;
+            while l < r {
+                let mid = (l + r) / 2;
+                if events[mid][0] > x {
+                    r = mid;
+                } else {
+                    l = mid + 1;
+                }
+            }
+            l
+        }
+
+        dfs(0, k, &events, &mut f, n)
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
@@ -409,6 +450,43 @@ function maxValue(events: number[][], k: number): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn max_value(mut events: Vec<Vec<i32>>, k: i32) -> i32 {
+        events.sort_by_key(|e| e[1]);
+        let n = events.len();
+        let mut f = vec![vec![0; (k + 1) as usize]; n + 1];
+
+        for i in 1..=n {
+            let st = events[i - 1][0];
+            let val = events[i - 1][2];
+            let p = search(&events, st, i - 1);
+            for j in 1..=k as usize {
+                f[i][j] = f[i - 1][j].max(f[p][j - 1] + val);
+            }
+        }
+
+        f[n][k as usize]
+    }
+}
+
+fn search(events: &Vec<Vec<i32>>, x: i32, hi: usize) -> usize {
+    let mut l = 0;
+    let mut r = hi;
+    while l < r {
+        let mid = (l + r) / 2;
+        if events[mid][1] >= x {
+            r = mid;
+        } else {
+            l = mid + 1;
+        }
+    }
+    l
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git a/solution/1700-1799/1751.Maximum Number of Events That Can Be Attended II/README_EN.md b/solution/1700-1799/1751.Maximum Number of Events That Can Be Attended II/README_EN.md
index 571eacd071403..6f87bd6062aad 100644
--- a/solution/1700-1799/1751.Maximum Number of Events That Can Be Attended II/README_EN.md	
+++ b/solution/1700-1799/1751.Maximum Number of Events That Can Be Attended II/README_EN.md	
@@ -255,6 +255,47 @@ function maxValue(events: number[][], k: number): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn max_value(mut events: Vec<Vec<i32>>, k: i32) -> i32 {
+        events.sort_by_key(|e| e[0]);
+        let n = events.len();
+        let mut f = vec![vec![0; (k + 1) as usize]; n];
+
+        fn dfs(i: usize, k: i32, events: &Vec<Vec<i32>>, f: &mut Vec<Vec<i32>>, n: usize) -> i32 {
+            if i >= n || k <= 0 {
+                return 0;
+            }
+            if f[i][k as usize] != 0 {
+                return f[i][k as usize];
+            }
+            let j = search(events, events[i][1], i + 1, n);
+            let ans = dfs(i + 1, k, events, f, n).max(dfs(j, k - 1, events, f, n) + events[i][2]);
+            f[i][k as usize] = ans;
+            ans
+        }
+
+        fn search(events: &Vec<Vec<i32>>, x: i32, lo: usize, n: usize) -> usize {
+            let mut l = lo;
+            let mut r = n;
+            while l < r {
+                let mid = (l + r) / 2;
+                if events[mid][0] > x {
+                    r = mid;
+                } else {
+                    l = mid + 1;
+                }
+            }
+            l
+        }
+
+        dfs(0, k, &events, &mut f, n)
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
@@ -407,6 +448,43 @@ function maxValue(events: number[][], k: number): number {
 }
 ```
 
+#### Rust
+
+```rust
+impl Solution {
+    pub fn max_value(mut events: Vec<Vec<i32>>, k: i32) -> i32 {
+        events.sort_by_key(|e| e[1]);
+        let n = events.len();
+        let mut f = vec![vec![0; (k + 1) as usize]; n + 1];
+
+        for i in 1..=n {
+            let st = events[i - 1][0];
+            let val = events[i - 1][2];
+            let p = search(&events, st, i - 1);
+            for j in 1..=k as usize {
+                f[i][j] = f[i - 1][j].max(f[p][j - 1] + val);
+            }
+        }
+
+        f[n][k as usize]
+    }
+}
+
+fn search(events: &Vec<Vec<i32>>, x: i32, hi: usize) -> usize {
+    let mut l = 0;
+    let mut r = hi;
+    while l < r {
+        let mid = (l + r) / 2;
+        if events[mid][1] >= x {
+            r = mid;
+        } else {
+            l = mid + 1;
+        }
+    }
+    l
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git a/solution/1700-1799/1751.Maximum Number of Events That Can Be Attended II/Solution.rs b/solution/1700-1799/1751.Maximum Number of Events That Can Be Attended II/Solution.rs
new file mode 100644
index 0000000000000..d5a8276d68778
--- /dev/null
+++ b/solution/1700-1799/1751.Maximum Number of Events That Can Be Attended II/Solution.rs	
@@ -0,0 +1,36 @@
+impl Solution {
+    pub fn max_value(mut events: Vec<Vec<i32>>, k: i32) -> i32 {
+        events.sort_by_key(|e| e[0]);
+        let n = events.len();
+        let mut f = vec![vec![0; (k + 1) as usize]; n];
+
+        fn dfs(i: usize, k: i32, events: &Vec<Vec<i32>>, f: &mut Vec<Vec<i32>>, n: usize) -> i32 {
+            if i >= n || k <= 0 {
+                return 0;
+            }
+            if f[i][k as usize] != 0 {
+                return f[i][k as usize];
+            }
+            let j = search(events, events[i][1], i + 1, n);
+            let ans = dfs(i + 1, k, events, f, n).max(dfs(j, k - 1, events, f, n) + events[i][2]);
+            f[i][k as usize] = ans;
+            ans
+        }
+
+        fn search(events: &Vec<Vec<i32>>, x: i32, lo: usize, n: usize) -> usize {
+            let mut l = lo;
+            let mut r = n;
+            while l < r {
+                let mid = (l + r) / 2;
+                if events[mid][0] > x {
+                    r = mid;
+                } else {
+                    l = mid + 1;
+                }
+            }
+            l
+        }
+
+        dfs(0, k, &events, &mut f, n)
+    }
+}
diff --git a/solution/1700-1799/1751.Maximum Number of Events That Can Be Attended II/Solution2.rs b/solution/1700-1799/1751.Maximum Number of Events That Can Be Attended II/Solution2.rs
new file mode 100644
index 0000000000000..c908d6ad6baba
--- /dev/null
+++ b/solution/1700-1799/1751.Maximum Number of Events That Can Be Attended II/Solution2.rs	
@@ -0,0 +1,32 @@
+impl Solution {
+    pub fn max_value(mut events: Vec<Vec<i32>>, k: i32) -> i32 {
+        events.sort_by_key(|e| e[1]);
+        let n = events.len();
+        let mut f = vec![vec![0; (k + 1) as usize]; n + 1];
+
+        for i in 1..=n {
+            let st = events[i - 1][0];
+            let val = events[i - 1][2];
+            let p = search(&events, st, i - 1);
+            for j in 1..=k as usize {
+                f[i][j] = f[i - 1][j].max(f[p][j - 1] + val);
+            }
+        }
+
+        f[n][k as usize]
+    }
+}
+
+fn search(events: &Vec<Vec<i32>>, x: i32, hi: usize) -> usize {
+    let mut l = 0;
+    let mut r = hi;
+    while l < r {
+        let mid = (l + r) / 2;
+        if events[mid][1] >= x {
+            r = mid;
+        } else {
+            l = mid + 1;
+        }
+    }
+    l
+}

<!DOCTYPE html PUBLIC '-//W3C//DTD XHTML 1.0 Transitional//EN' 'http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd'>
<html xmlns='http://www.w3.org/1999/xhtml'>
<head>
<title>pFad - Phonifier reborn</title>
<meta http-equiv='Content-Type' content='text/html; charset=utf-8' />
</head>
<body>
<h1>Pfad - The Proxy pFad of &#169; 2024 Garber Painting. All rights reserved.</h1>


<!-- Disclaimer -->
<p>Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.</p>
<br>
<p>Alternative Proxies:</p><p><a href="http://clevelandohioweatherforecast.com/php-proxy/index.php?q=https://patch-diff.githubusercontent.com/raw/doocs/leetcode/pull/4556.patch" target="_blank">Alternative Proxy</a></p><p><a href="http://clevelandohioweatherforecast.com/pFad/index.php?u=https://patch-diff.githubusercontent.com/raw/doocs/leetcode/pull/4556.patch" target="_blank">pFad Proxy</a></p><p><a href="http://clevelandohioweatherforecast.com/pFad/v3index.php?u=https://patch-diff.githubusercontent.com/raw/doocs/leetcode/pull/4556.patch" target="_blank">pFad v3 Proxy</a></p><p><a href="http://clevelandohioweatherforecast.com/pFad/v4index.php?u=https://patch-diff.githubusercontent.com/raw/doocs/leetcode/pull/4556.patch" target="_blank">pFad v4 Proxy</a></p></body>
</html>