feat: add rust solution to lc problem: No.0055 (doocs#1293)

Author: xzhseh

solution/0000-0099/0055.Jump Game/README.md

@@ -113,6 +113,43 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    #[allow(dead_code)]
+    pub fn can_jump(nums: Vec<i32>) -> bool {
+        let n = nums.len();
+        let mut i: usize = 0;
+
+        while i < n {
+            if nums[i] as usize + i >= n - 1 {
+                break;
+            }
+            let mut j: usize = 1;
+            let mut max_step = 0;
+            let mut next_i: usize = 0;
+            // Get the next max step
+            while j <= nums[i] as usize {
+                if (i + j) as i32 + nums[i + j] >= max_step {
+                    max_step = (i + j) as i32 + nums[i + j];
+                    next_i = i + j;
+                }
+                j += 1;
+            }
+            if max_step == 0 {
+                // No further max step
+                return false;
+            }
+            // Otherwise, update `i` to `next_i`
+            i = next_i;
+        }
+
+        true
+    }
+}
+```
+
 ### **Go**
 
 ```go

solution/0000-0099/0055.Jump Game/README_EN.md

@@ -95,6 +95,43 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    #[allow(dead_code)]
+    pub fn can_jump(nums: Vec<i32>) -> bool {
+        let n = nums.len();
+        let mut i: usize = 0;
+
+        while i < n {
+            if nums[i] as usize + i >= n - 1 {
+                break;
+            }
+            let mut j: usize = 1;
+            let mut max_step = 0;
+            let mut next_i: usize = 0;
+            // Get the next max step
+            while j <= nums[i] as usize {
+                if (i + j) as i32 + nums[i + j] >= max_step {
+                    max_step = (i + j) as i32 + nums[i + j];
+                    next_i = i + j;
+                }
+                j += 1;
+            }
+            if max_step == 0 {
+                // No further max step
+                return false;
+            }
+            // Otherwise, update `i` to `next_i`
+            i = next_i;
+        }
+
+        true
+    }
+}
+```
+
 ### **Go**
 
 ```go

solution/0000-0099/0055.Jump Game/Solution.rs

@@ -0,0 +1,32 @@
+impl Solution {
+    #[allow(dead_code)]
+    pub fn can_jump(nums: Vec<i32>) -> bool {
+        let n = nums.len();
+        let mut i: usize = 0;
+
+        while i < n {
+            if nums[i] as usize + i >= n - 1 {
+                break;
+            }
+            let mut j: usize = 1;
+            let mut max_step = 0;
+            let mut next_i: usize = 0;
+            // Get the next max step
+            while j <= nums[i] as usize {
+                if (i + j) as i32 + nums[i + j] >= max_step {
+                    max_step = (i + j) as i32 + nums[i + j];
+                    next_i = i + j;
+                }
+                j += 1;
+            }
+            if max_step == 0 {
+                // No further max step
+                return false;
+            }
+            // Otherwise, update `i` to `next_i`
+            i = next_i;
+        }
+
+        true
+    }
+}