Deploying to gh-pages from @ 04a491b 🚀

Author: Ainevsia

day3/lc203.html

@@ -195,8 +195,10 @@ <h2 id="解题思路"><a class="header" href="#解题思路">解题思路</a></h
 impl Solution {
     pub fn remove_elements(head: Option&lt;Box&lt;ListNode&gt;&gt;, val: i32) -&gt; Option&lt;Box&lt;ListNode&gt;&gt; {
         let mut head = Some(Box::new(ListNode { val: 0, next: head }));
-        let mut a = &amp;mut head;
+        let mut a: &amp;mut Option&lt;Box&lt;ListNode&gt;&gt; = &amp;mut head;
         while a.as_deref_mut().unwrap().next.is_some() {
+            //         ^  Option&lt;&amp;mut ListNode&gt;
+            //    
             let v = a.as_deref_mut().unwrap().next.as_deref().unwrap().val;
             if v == val {
                 let mut b = a.as_deref_mut().unwrap().next.take();
@@ -211,7 +213,7 @@ <h2 id="解题思路"><a class="header" href="#解题思路">解题思路</a></h
     }
 }
 <span class="boring">}</span></code></pre></pre>
-<p>属实有点恶心了</p>
+<p>属实有点恶心了，看着太复杂了，这就是不用take的后果</p>
 <h2 id="学习感想"><a class="header" href="#学习感想">学习感想</a></h2>
 <pre><pre class="playground"><code class="language-rust"><span class="boring">#![allow(unused)]
 </span>
@@ -296,6 +298,8 @@ <h2 id="学习感想"><a class="header" href="#学习感想">学习感想</a></h
     }
 }
 <span class="boring">}</span></code></pre></pre>
+<p>链表的ownership还是非常容易理清楚的</p>
+<p>一个Option不是owner没法直接unwrap，但是as_mut了之后可以随意unwrap，这也是容器穿透</p>
 
                     </main>
 

day3/lc206.html

@@ -210,6 +210,41 @@ <h2 id="解题思路"><a class="header" href="#解题思路">解题思路</a></h
 <span class="boring">}</span></code></pre></pre>
 <h2 id="学习感想"><a class="header" href="#学习感想">学习感想</a></h2>
 <p>所以我这个算是什么方式</p>
+<pre><pre class="playground"><code class="language-rust"><span class="boring">#![allow(unused)]
+</span>
+
+<span class="boring">fn main() {
+</span>struct Solution {}
+
+// Definition for singly-linked list.
+#[derive(PartialEq, Eq, Clone, Debug)]
+pub struct ListNode {
+  pub val: i32,
+  pub next: Option&lt;Box&lt;ListNode&gt;&gt;
+}
+
+impl ListNode {
+  #[inline]
+  fn new(val: i32) -&gt; Self {
+    ListNode {
+      next: None,
+      val
+    }
+  }
+}
+
+impl Solution {
+    pub fn reverse_list(mut head: Option&lt;Box&lt;ListNode&gt;&gt;) -&gt; Option&lt;Box&lt;ListNode&gt;&gt; {
+        let mut res: Option&lt;Box&lt;ListNode&gt;&gt; = None;
+        while let Some(mut x) = head {
+            head = x.next.take();
+            x.next = res;
+            res = Some(x);
+        }
+        res
+    }
+}
+<span class="boring">}</span></code></pre></pre>
 
                     </main>
 

day3/lc707.html

@@ -274,6 +274,74 @@ <h2 id="解题思路"><a class="header" href="#解题思路">解题思路</a></h
 <span class="boring">}</span></code></pre></pre>
 <h2 id="学习感想"><a class="header" href="#学习感想">学习感想</a></h2>
 <p>也没啥好说的，rust只要写出来，基本是对的，没有用take的形式，而是全部去除了option用ref</p>
+<pre><pre class="playground"><code class="language-rust"><span class="boring">#![allow(unused)]
+</span><span class="boring">fn main() {
+</span>struct MyLinkedList {
+    head: Option&lt;Box&lt;ListNode&gt;&gt;,
+    cnt: i32,
+}
+
+struct ListNode {
+    val: i32,
+    next: Option&lt;Box&lt;ListNode&gt;&gt;,
+}
+
+/** 
+ * `&amp;self` means the method takes an immutable reference.
+ * If you need a mutable reference, change it to `&amp;mut self` instead.
+ */
+impl MyLinkedList {
+
+    fn new() -&gt; Self {
+        Self {
+            head: None,
+            cnt: 0i32,
+        }
+    }
+    
+    fn get(&amp;self, mut index: i32) -&gt; i32 {
+        if index &gt;= self.cnt { return -1i32 }
+        let mut ptr: &amp; Box&lt;ListNode&gt; = self.head.as_ref().unwrap();
+        while index &gt; 0i32 {
+            ptr = ptr.next.as_ref().unwrap();
+            index -= 1i32;
+        }
+        ptr.val
+    }
+    
+    fn add_at_head(&amp;mut self, val: i32) {
+        self.add_at_index(0i32, val);
+    }
+    
+    fn add_at_tail(&amp;mut self, val: i32) {
+        self.add_at_index(self.cnt, val);
+    }
+    
+    fn add_at_index(&amp;mut self, mut index: i32, val: i32) {
+        if index &gt; self.cnt { return }
+        let mut ptr: &amp;mut Option&lt;Box&lt;ListNode&gt;&gt; = &amp;mut self.head;
+        while index &gt; 0i32 {
+            ptr = &amp;mut ptr.as_mut().unwrap().next;
+            index -= 1i32;
+        }
+        self.cnt += 1i32;
+        *ptr = Some(Box::new(ListNode { val: val, next: ptr.take() }))
+    }
+    
+    fn delete_at_index(&amp;mut self, mut index: i32) {
+        if index &gt;= self.cnt { return }
+        let mut ptr: &amp;mut Option&lt;Box&lt;ListNode&gt;&gt; = &amp;mut self.head;
+        while index &gt; 0i32 {
+            ptr = &amp;mut ptr.as_mut().unwrap().next;
+            index -= 1i32;
+        }
+        let nxt: Option&lt;Box&lt;ListNode&gt;&gt; = ptr.take().unwrap().next.take();
+        *ptr = nxt;
+        self.cnt -= 1i32;
+    }
+}
+
+<span class="boring">}</span></code></pre></pre>
 
                     </main>
 

print.html

@@ -808,8 +808,10 @@ <h2 id="解题思路-5"><a class="header" href="#解题思路-5">解题思路</a
 impl Solution {
     pub fn remove_elements(head: Option&lt;Box&lt;ListNode&gt;&gt;, val: i32) -&gt; Option&lt;Box&lt;ListNode&gt;&gt; {
         let mut head = Some(Box::new(ListNode { val: 0, next: head }));
-        let mut a = &amp;mut head;
+        let mut a: &amp;mut Option&lt;Box&lt;ListNode&gt;&gt; = &amp;mut head;
         while a.as_deref_mut().unwrap().next.is_some() {
+            //         ^  Option&lt;&amp;mut ListNode&gt;
+            //    
             let v = a.as_deref_mut().unwrap().next.as_deref().unwrap().val;
             if v == val {
                 let mut b = a.as_deref_mut().unwrap().next.take();
@@ -824,7 +826,7 @@ <h2 id="解题思路-5"><a class="header" href="#解题思路-5">解题思路</a
     }
 }
 <span class="boring">}</span></code></pre></pre>
-<p>属实有点恶心了</p>
+<p>属实有点恶心了，看着太复杂了，这就是不用take的后果</p>
 <h2 id="学习感想-5"><a class="header" href="#学习感想-5">学习感想</a></h2>
 <pre><pre class="playground"><code class="language-rust"><span class="boring">#![allow(unused)]
 </span>
@@ -909,6 +911,8 @@ <h2 id="学习感想-5"><a class="header" href="#学习感想-5">学习感想</a
     }
 }
 <span class="boring">}</span></code></pre></pre>
+<p>链表的ownership还是非常容易理清楚的</p>
+<p>一个Option不是owner没法直接unwrap，但是as_mut了之后可以随意unwrap，这也是容器穿透</p>
 <div style="break-before: page; page-break-before: always;"></div><h1 id="707-设计链表"><a class="header" href="#707-设计链表">707. 设计链表</a></h1>
 <h2 id="题目描述-6"><a class="header" href="#题目描述-6">题目描述</a></h2>
 <p>你可以选择使用单链表或者双链表，设计并实现自己的链表。</p>
@@ -1017,6 +1021,74 @@ <h2 id="解题思路-6"><a class="header" href="#解题思路-6">解题思路</a
 <span class="boring">}</span></code></pre></pre>
 <h2 id="学习感想-6"><a class="header" href="#学习感想-6">学习感想</a></h2>
 <p>也没啥好说的，rust只要写出来，基本是对的，没有用take的形式，而是全部去除了option用ref</p>
+<pre><pre class="playground"><code class="language-rust"><span class="boring">#![allow(unused)]
+</span><span class="boring">fn main() {
+</span>struct MyLinkedList {
+    head: Option&lt;Box&lt;ListNode&gt;&gt;,
+    cnt: i32,
+}
+
+struct ListNode {
+    val: i32,
+    next: Option&lt;Box&lt;ListNode&gt;&gt;,
+}
+
+/** 
+ * `&amp;self` means the method takes an immutable reference.
+ * If you need a mutable reference, change it to `&amp;mut self` instead.
+ */
+impl MyLinkedList {
+
+    fn new() -&gt; Self {
+        Self {
+            head: None,
+            cnt: 0i32,
+        }
+    }
+    
+    fn get(&amp;self, mut index: i32) -&gt; i32 {
+        if index &gt;= self.cnt { return -1i32 }
+        let mut ptr: &amp; Box&lt;ListNode&gt; = self.head.as_ref().unwrap();
+        while index &gt; 0i32 {
+            ptr = ptr.next.as_ref().unwrap();
+            index -= 1i32;
+        }
+        ptr.val
+    }
+    
+    fn add_at_head(&amp;mut self, val: i32) {
+        self.add_at_index(0i32, val);
+    }
+    
+    fn add_at_tail(&amp;mut self, val: i32) {
+        self.add_at_index(self.cnt, val);
+    }
+    
+    fn add_at_index(&amp;mut self, mut index: i32, val: i32) {
+        if index &gt; self.cnt { return }
+        let mut ptr: &amp;mut Option&lt;Box&lt;ListNode&gt;&gt; = &amp;mut self.head;
+        while index &gt; 0i32 {
+            ptr = &amp;mut ptr.as_mut().unwrap().next;
+            index -= 1i32;
+        }
+        self.cnt += 1i32;
+        *ptr = Some(Box::new(ListNode { val: val, next: ptr.take() }))
+    }
+    
+    fn delete_at_index(&amp;mut self, mut index: i32) {
+        if index &gt;= self.cnt { return }
+        let mut ptr: &amp;mut Option&lt;Box&lt;ListNode&gt;&gt; = &amp;mut self.head;
+        while index &gt; 0i32 {
+            ptr = &amp;mut ptr.as_mut().unwrap().next;
+            index -= 1i32;
+        }
+        let nxt: Option&lt;Box&lt;ListNode&gt;&gt; = ptr.take().unwrap().next.take();
+        *ptr = nxt;
+        self.cnt -= 1i32;
+    }
+}
+
+<span class="boring">}</span></code></pre></pre>
 <div style="break-before: page; page-break-before: always;"></div><h1 id="206-反转链表"><a class="header" href="#206-反转链表">206. 反转链表</a></h1>
 <h2 id="题目描述-7"><a class="header" href="#题目描述-7">题目描述</a></h2>
 <p>给你单链表的头节点 head ，请你反转链表，并返回反转后的链表。</p>
@@ -1061,6 +1133,41 @@ <h2 id="解题思路-7"><a class="header" href="#解题思路-7">解题思路</a
 <span class="boring">}</span></code></pre></pre>
 <h2 id="学习感想-7"><a class="header" href="#学习感想-7">学习感想</a></h2>
 <p>所以我这个算是什么方式</p>
+<pre><pre class="playground"><code class="language-rust"><span class="boring">#![allow(unused)]
+</span>
+
+<span class="boring">fn main() {
+</span>struct Solution {}
+
+// Definition for singly-linked list.
+#[derive(PartialEq, Eq, Clone, Debug)]
+pub struct ListNode {
+  pub val: i32,
+  pub next: Option&lt;Box&lt;ListNode&gt;&gt;
+}
+
+impl ListNode {
+  #[inline]
+  fn new(val: i32) -&gt; Self {
+    ListNode {
+      next: None,
+      val
+    }
+  }
+}
+
+impl Solution {
+    pub fn reverse_list(mut head: Option&lt;Box&lt;ListNode&gt;&gt;) -&gt; Option&lt;Box&lt;ListNode&gt;&gt; {
+        let mut res: Option&lt;Box&lt;ListNode&gt;&gt; = None;
+        while let Some(mut x) = head {
+            head = x.next.take();
+            x.next = res;
+            res = Some(x);
+        }
+        res
+    }
+}
+<span class="boring">}</span></code></pre></pre>
 <div style="break-before: page; page-break-before: always;"></div><h1 id="第二章-链表part02"><a class="header" href="#第二章-链表part02">第二章 链表part02</a></h1>
 <p>● day 1 任务以及具体安排：https://docs.qq.com/doc/DUG9UR2ZUc3BjRUdY 
 ● day 2 任务以及具体安排：https://docs.qq.com/doc/DUGRwWXNOVEpyaVpG