Update 55.jump-game.md

azl397985856 · web-flow · commit 9936c26f712a · 2020-04-17T18:09:49.000+08:00
diff --git a/problems/55.jump-game.md b/problems/55.jump-game.md
@@ -39,47 +39,6 @@ Explanation: You will always arrive at index 3 no matter what. Its maximum
 
 ```js
 
-/*
- * @lc app=leetcode id=55 lang=javascript
- *
- * [55] Jump Game
- *
- * https://leetcode.com/problems/jump-game/description/
- *
- * algorithms
- * Medium (31.38%)
- * Total Accepted:    252.4K
- * Total Submissions: 797.2K
- * Testcase Example:  '[2,3,1,1,4]'
- *
- * Given an array of non-negative integers, you are initially positioned at the
- * first index of the array.
- *
- * Each element in the array represents your maximum jump length at that
- * position.
- *
- * Determine if you are able to reach the last index.
- *
- * Example 1:
- *
- *
- * Input: [2,3,1,1,4]
- * Output: true
- * Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last
- * index.
- *
- *
- * Example 2:
- *
- *
- * Input: [3,2,1,0,4]
- * Output: false
- * Explanation: You will always arrive at index 3 no matter what. Its
- * maximum
- * jump length is 0, which makes it impossible to reach the last index.
- *
- *
- */
 /**
  * @param {number[]} nums
  * @return {boolean}
