@@ -0,0 +1,479 @@
+/**%0A * Problem Link: https://leetcode.com/problems/jump-game/%0A * Solution: Greedy to find out if the end could be reached.%0A * Using BFS could find the path with minimum steps to reach the end.%0A */%0Apublic class Solution %7B%0A    public boolean canJump(int%5B%5D nums) %7B%0A        int max = 0;%0A        for(int i=0; i%3Cnums.length; i++) %7B%0A            if(max %3C i) return false;%0A            if(i + nums%5Bi%5D %3E max) max = i + nums%5Bi%5D;%0A        %7D%0A        return max %3E= nums.length - 1;%0A    %7D%0A    %0A%7D%0A

Create Jump_Game.java