feat: add rust solution to lcci problem: No.02.02

No.02.02.Kth Node From End of List

Author: YangFong

lcci/02.02.Kth Node From End of List/README.md

@@ -150,6 +150,41 @@ func kthToLast(head *ListNode, k int) int {
 }
 ```
 
+### **Rust**
+
+```rust
+// Definition for singly-linked list.
+// #[derive(PartialEq, Eq, Clone, Debug)]
+// pub struct ListNode {
+//   pub val: i32,
+//   pub next: Option<Box<ListNode>>
+// }
+//
+// impl ListNode {
+//   #[inline]
+//   fn new(val: i32) -> Self {
+//     ListNode {
+//       next: None,
+//       val
+//     }
+//   }
+// }
+impl Solution {
+    pub fn kth_to_last(head: Option<Box<ListNode>>, k: i32) -> i32 {
+        let mut fast = &head;
+        for _ in 0..k {
+            fast = &fast.as_ref().unwrap().next;
+        }
+        let mut slow = &head;
+        while let (Some(f), Some(s)) = (fast, slow) {
+            fast = &f.next;
+            slow = &s.next;
+        }
+        slow.as_ref().unwrap().val
+    }
+}
+```
+
 ### **...**
 
 ```

lcci/02.02.Kth Node From End of List/README_EN.md

@@ -142,6 +142,41 @@ func kthToLast(head *ListNode, k int) int {
 }
 ```
 
+### **Rust**
+
+```rust
+// Definition for singly-linked list.
+// #[derive(PartialEq, Eq, Clone, Debug)]
+// pub struct ListNode {
+//   pub val: i32,
+//   pub next: Option<Box<ListNode>>
+// }
+//
+// impl ListNode {
+//   #[inline]
+//   fn new(val: i32) -> Self {
+//     ListNode {
+//       next: None,
+//       val
+//     }
+//   }
+// }
+impl Solution {
+    pub fn kth_to_last(head: Option<Box<ListNode>>, k: i32) -> i32 {
+        let mut fast = &head;
+        for _ in 0..k {
+            fast = &fast.as_ref().unwrap().next;
+        }
+        let mut slow = &head;
+        while let (Some(f), Some(s)) = (fast, slow) {
+            fast = &f.next;
+            slow = &s.next;
+        }
+        slow.as_ref().unwrap().val
+    }
+}
+```
+
 ### **...**
 
 ```

lcci/02.02.Kth Node From End of List/Solution.rs

@@ -0,0 +1,30 @@
+// Definition for singly-linked list.
+// #[derive(PartialEq, Eq, Clone, Debug)]
+// pub struct ListNode {
+//   pub val: i32,
+//   pub next: Option<Box<ListNode>>
+// }
+//
+// impl ListNode {
+//   #[inline]
+//   fn new(val: i32) -> Self {
+//     ListNode {
+//       next: None,
+//       val
+//     }
+//   }
+// }
+impl Solution {
+    pub fn kth_to_last(head: Option<Box<ListNode>>, k: i32) -> i32 {
+        let mut fast = &head;
+        for _ in 0..k {
+            fast = &fast.as_ref().unwrap().next;
+        }
+        let mut slow = &head;
+        while let (Some(f), Some(s)) = (fast, slow) {
+            fast = &f.next;
+            slow = &s.next;
+        }
+        slow.as_ref().unwrap().val
+    }
+}