some code

Author: mengli

Jump Game.java

@@ -0,0 +1,27 @@
+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.
+
+For example:
+A = [2,3,1,1,4], return true.
+
+A = [3,2,1,0,4], return false.
+
+public class Solution {
+    public boolean canJump(int[] A) {
+        if (A.length <= 1) return true;
+        int curMax = 0;
+        int max = 0;
+        for (int i = 0; i < A.length - 1; i++) {
+        	if (i > max) break;
+        	curMax = A[i] + i;
+        	if (curMax > max) {
+        		max = curMax;
+        	}
+        	if (max >= A.length - 1) return true;
+        }
+	return false;
+    }
+}