Skip to content

Commit a26ee7d

Browse files
committed
Create readmd.md
1 parent a787e2f commit a26ee7d

File tree

1 file changed

+10
-0
lines changed

1 file changed

+10
-0
lines changed

JumpGameII/readmd.md

Lines changed: 10 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,10 @@
1+
Given an array of non-negative integers, you are initially positioned at the first index of the array.
2+
3+
Each element in the array represents your maximum jump length at that position.
4+
5+
Your goal is to reach the last index in the minimum number of jumps.
6+
7+
For example:
8+
Given array A = [2,3,1,1,4]
9+
10+
The minimum number of jumps to reach the last index is 2. (Jump 1 step from index 0 to 1, then 3 steps to the last index.)

0 commit comments

Comments
 (0)