Added Jump Game

Author: ryanoneill

src/jump_game.rs

@@ -0,0 +1,51 @@
+/// You are given an integer array `nums`. You are initially positioned at the
+/// array's first index, and each element in the array represents your maximum
+/// jump length at that position.
+///
+/// Return `true` if you can reach the last index, or `false` otherwise.
+struct Solution;
+
+impl Solution {
+
+    pub fn can_jump(nums: Vec<i32>) -> bool {
+        let mut result = false;
+        let mut max_so_far = 0;
+        let n = nums.len();
+
+        for i in 0..n {
+            if i > max_so_far {
+                result = false;
+                break;
+            }
+            let max_from_here = i + nums[i] as usize;
+            max_so_far = max_so_far.max(max_from_here);
+            if max_so_far >= n-1 {
+                result = true;
+                break;
+            }
+        }
+
+        result
+    }
+
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    #[test]
+    fn example_1() {
+        let nums = vec![2,3,1,1,4];
+        let result = Solution::can_jump(nums);
+        assert!(result);
+    }
+
+    #[test]
+    fn example_2() {
+        let nums = vec![3,2,1,0,4];
+        let result = Solution::can_jump(nums);
+        assert!(!result);
+    }
+
+}

src/lib.rs

@@ -19,7 +19,7 @@ pub mod add_two_numbers; // 2
 pub mod length_of_longest_substring; // 3 ✓
 pub mod median_of_two_sorted_arrays; // 4
 pub mod longest_palindromic_substring; // 5
-pub mod zigzag_conversion; // 6
+pub mod zigzag_conversion; // 6 ✓
 pub mod reverse_integer; // 7 ✓
 pub mod string_to_integer; // 8 ✓
 pub mod palindrome_number; // 9 ✓
@@ -41,10 +41,12 @@ pub mod find_the_index_of_the_first_occurrence_in_a_string; // 28
 pub mod range_sum_query_immutable; // 30
 
 pub mod search_insert_position; // 35
-pub mod valid_sudoku; // 36
+pub mod valid_sudoku; // 36 ✓
 
 pub mod rotate_image; // 48
 
+pub mod jump_game; // 55 ✓
+
 pub mod length_of_last_word; // 58
 
 pub mod plus_one; // 66