From c265c9220c62a78109c1f6033d47f9bc8b3f47bd Mon Sep 17 00:00:00 2001
From: BaoTaoqi <464115280@qq.com>
Date: Mon, 11 Jul 2022 14:50:03 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200203.=E7=A7=BB=E9=99=A4?=
 =?UTF-8?q?=E9=93=BE=E8=A1=A8=E5=85=83=E7=B4=A0=200344.=E5=8F=8D=E8=BD=AC?=
 =?UTF-8?q?=E5=AD=97=E7=AC=A6=E4=B8=B2=200376.=E6=91=86=E5=8A=A8=E5=BA=8F?=
 =?UTF-8?q?=E5=88=97=200541.=E5=8F=8D=E8=BD=AC=E5=AD=97=E7=AC=A6=E4=B8=B2I?=
 =?UTF-8?q?I=20=E5=89=91=E6=8C=87Offer05.=E6=9B=BF=E6=8D=A2=E7=A9=BA?=
 =?UTF-8?q?=E6=A0=BC=20Rust=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

添加 0203.移除链表元素 0344.反转字符串 0376.摆动序列 0541.反转字符串II 剑指Offer05.替换空格 Rust版本
---
 problems/0203.移除链表元素.md    | 18 ++++++++-------
 problems/0344.反转字符串.md       | 16 +++++++++++++
 problems/0376.摆动序列.md          | 23 +++++++++++++++++++
 problems/0541.反转字符串II.md     | 31 ++++++++++++++++++++++++++
 problems/剑指Offer05.替换空格.md | 31 ++++++++++++++++++++++++++
 5 files changed, 111 insertions(+), 8 deletions(-)

diff --git a/problems/0203.移除链表元素.md b/problems/0203.移除链表元素.md
index b79d29a5..cb46dc70 100644
--- a/problems/0203.移除链表元素.md
+++ b/problems/0203.移除链表元素.md
@@ -487,17 +487,19 @@ RUST:
 // }
 impl Solution {
     pub fn remove_elements(head: Option<Box<ListNode>>, val: i32) -> Option<Box<ListNode>> {
-        let mut head = head;
-        let mut dummy_head = ListNode::new(0);
-        let mut cur = &mut dummy_head;
-        while let Some(mut node) = head {
-            head = std::mem::replace(&mut node.next, None);
-            if node.val != val {
-                cur.next = Some(node);
+        let mut dummyHead = Box::new(ListNode::new(0));
+        dummyHead.next = head;
+        let mut cur = dummyHead.as_mut();
+	// 使用take()替换std::men::replace(&mut node.next, None)达到相同的效果，并且更普遍易读
+        while let Some(nxt) = cur.next.take() {
+            if nxt.val == val {
+                cur.next = nxt.next;
+            } else {
+                cur.next = Some(nxt);
                 cur = cur.next.as_mut().unwrap();
             }
         }
-        dummy_head.next
+        dummyHead.next
     }
 }
 ```
diff --git a/problems/0344.反转字符串.md b/problems/0344.反转字符串.md
index aba6e2f3..3138f60f 100644
--- a/problems/0344.反转字符串.md
+++ b/problems/0344.反转字符串.md
@@ -238,6 +238,22 @@ func reverseString(_ s: inout [Character]) {
 
 ```
 
+Rust:
+```Rust
+impl Solution {
+    pub fn reverse_string(s: &mut Vec<char>) {
+        let (mut left, mut right) = (0, s.len()-1);
+        while left < right {
+            let temp = s[left];
+            s[left] = s[right];
+            s[right] = temp;
+            left += 1;
+            right -= 1;
+        }
+    }
+}
+```
+
 C:
 ```c
 void reverseString(char* s, int sSize){
diff --git a/problems/0376.摆动序列.md b/problems/0376.摆动序列.md
index 00f8f70c..33a5282d 100644
--- a/problems/0376.摆动序列.md
+++ b/problems/0376.摆动序列.md
@@ -298,6 +298,29 @@ var wiggleMaxLength = function(nums) {
 };
 ```
 
+### Rust
+**贪心**
+```Rust
+impl Solution {
+    pub fn wiggle_max_length(nums: Vec<i32>) -> i32 {
+        let len = nums.len() as usize;
+        if len <= 1 {
+            return len as i32;
+        }
+        let mut preDiff = 0;
+        let mut curDiff = 0;
+        let mut result = 1;
+        for i in 0..len-1 {
+            curDiff = nums[i+1] - nums[i];
+            if (preDiff <= 0 && curDiff > 0) || (preDiff >= 0 && curDiff < 0) {
+                result += 1;
+                preDiff = curDiff;
+            }
+        }
+        result
+    }
+}
+```
 
 ### C
 **贪心**
diff --git a/problems/0541.反转字符串II.md b/problems/0541.反转字符串II.md
index 84061ef5..7ef6463e 100644
--- a/problems/0541.反转字符串II.md
+++ b/problems/0541.反转字符串II.md
@@ -389,5 +389,36 @@ object Solution {
   }
 }
 ```
+
+Rust:
+
+```Rust
+impl Solution {
+    pub fn reverse(s: &mut Vec<char>, mut begin: usize, mut end: usize){
+        while begin < end {
+            let temp = s[begin];
+            s[begin] = s[end];
+            s[end] = temp;
+            begin += 1;
+            end -= 1;
+        }
+    }
+    pub fn reverse_str(s: String, k: i32) -> String {
+        let len = s.len();
+        let k = k as usize;
+        let mut s = s.chars().collect::<Vec<_>>();
+        for i in (0..len).step_by(2 * k) {
+            if i + k < len {
+                Self::reverse(&mut s, i, i + k - 1);
+            }
+            else {
+                Self::reverse(&mut s, i, len - 1);
+            }
+        }
+        s.iter().collect::<String>()
+    }
+}
+```
+
 -----------------------
 <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>
diff --git a/problems/剑指Offer05.替换空格.md b/problems/剑指Offer05.替换空格.md
index 78b03b17..e1ccc458 100644
--- a/problems/剑指Offer05.替换空格.md
+++ b/problems/剑指Offer05.替换空格.md
@@ -506,6 +506,37 @@ function spaceLen($s){
 }
 ```
 
+Rust
+
+```Rust
+impl Solution {
+    pub fn replace_space(s: String) -> String {
+        let mut len: usize = s.len();
+        let mut s = s.chars().collect::<Vec<char>>();
+        let mut count = 0;
+        for i in &s {
+            if i.is_ascii_whitespace() {
+                count += 1;
+            }
+        }
+        let mut new_len = len + count * 2;
+        s.resize(new_len, ' ');
+        while len < new_len {
+            len -= 1;
+            new_len -= 1;
+            if s[len].is_ascii_whitespace() {
+                s[new_len] = '0';
+                s[new_len - 1] = '2';
+                s[new_len - 2] = '%';
+                new_len -= 2;
+            }
+            else { s[new_len] = s[len] }
+        }
+        s.iter().collect::<String>()
+    }
+}
+```
+
 
 -----------------------
 <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>