Add solution #55

Author: JoshCrozier

README.md

@@ -60,6 +60,7 @@
 52|[N-Queens II](./0052-n-queens-ii.js)|Hard|
 53|[Maximum Subarray](./0053-maximum-subarray.js)|Easy|
 54|[Spiral Matrix](./0054-spiral-matrix.js)|Medium|
+55|[Jump Game](./0055-jump-game.js)|Medium|
 57|[Insert Interval](./0057-insert-interval.js)|Medium|
 58|[Length of Last Word](./0058-length-of-last-word.js)|Easy|
 59|[Spiral Matrix II](./0059-spiral-matrix-ii.js)|Medium|

solutions/0055-jump-game.js

@@ -0,0 +1,28 @@
+/**
+ * 55. Jump Game
+ * https://leetcode.com/problems/jump-game/
+ * Difficulty: Medium
+ *
+ * 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.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {boolean}
+ */
+var canJump = function(nums) {
+  let max = nums[0];
+
+  for (let i = 1; i < nums.length; i++) {
+    if (max < i) {
+      return false;
+    }
+    max = Math.max(nums[i] + i, max);
+  }
+
+  return true;
+};