[java]跳跃最大长度

import java.util.Scanner;

public class T52 {
	public static void printColor (int mapArray[], int arr[], int currPos) {
		int minIndex = currPos - arr[currPos] >= 0 ? currPos - arr[currPos] : 0;
		int maxIndex = currPos + arr[currPos] <= arr.length - 1 ? currPos + arr[currPos] : arr.length - 1;
		for (int i = minIndex ; i <= maxIndex ; i++) {
			if(mapArray[i] == 0) {
				mapArray[i] = 1;
				printColor(mapArray, arr, i);
			}
		}
	}
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int n;
		Scanner sc = new Scanner(System.in);
		n = sc.nextInt();
		int arr[] = new int[n];
		int mapArray[] = new int[n];
		int min = 0, max = 0;
		for (int i = 0 ; i < n ; i++) {
			arr[i] = sc.nextInt();
			mapArray[i] = 0;
		}
		printColor(mapArray, arr, 0);
		if (mapArray[n-1] == 1) {
			System.out.print("true");
		}
		else {
			System.out.print("false");
		}
	}

}

使用了染色+递归解决问题