solution: 0055. Jump Game

Author: flynnpark

src/0055/index.test.ts

@@ -21,8 +21,8 @@ describe('0055. Jump Game', () => {
     },
   ];
 
-  test.each(testCases)('Case %#', ({ input: { prices }, output }) => {
-    const result = canJump(prices);
+  test.each(testCases)('Case %#', ({ input: { nums }, output }) => {
+    const result = canJump(nums);
     expect(result).toBe(output);
   });
 });

src/0055/index.ts

@@ -1,3 +1,12 @@
-function canJump(nums: number[]): boolean {}
+function canJump(nums: number[]): boolean {
+  let maximumJump = nums[0];
+  for (let i = 1; i < nums.length; i++) {
+    if (maximumJump === 0) {
+      return false;
+    }
+    maximumJump = Math.max(maximumJump - 1, nums[i]);
+  }
+  return true;
+}
 
 export { canJump };