@@ -0,0 +1,802 @@
+// Given an array of non-negative integers, you are initially positioned at the first index of the array.%0A%0A// Each element in the array represents your maximum jump length at that position.%0A%0A// Determine if you are able to reach the last index.%0A%0A// For example:%0A// A = %5B2,3,1,1,4%5D, return true.%0A%0A// A = %5B3,2,1,0,4%5D, return false.%0A%0Apublic class Solution %7B%0A    public boolean canJump(int%5B%5D A) %7B%0A %09%09int len = A.length;%0A%0A        if(len %3C= 1) return true;%0A%0A        int maxReachedIndex = 0;%0A%0A        for(int i = 0; i %3C len; i++)%7B%0A        %09// means if max reached indexed calculated so far is smaller than i, then something is wrong.%0A            if(maxReachedIndex %3C i) return false;%0A            maxReachedIndex = maxReachedIndex %3E i + A%5Bi%5D? maxReachedIndex : i + A%5Bi%5D;%0A        %7D%0A%0A        return true;%0A    %7D%0A%7D

add jump game solution.