LeetCode Online Judge 题目C# 练习 - Jump Game

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.

 1         public static bool JumpGame(int[] A)
 2         {
 3             if (A.Length <= 1)
 4                 return true;
 5             if (A[0] == 0)
 6                 return false;
 7 
 8             for (int i = 1; i < A.Length - 1; i++)
 9             {
10                 if (A[i] != 0)
11                     continue;
12 
13                 //Check if the '0' can be jump over. If not, return false
14                 for (int j = i - 1, val = 1; j >= 0; j--, val++)
15                 {
16                     if (A[j] > val) 
17                         break;
18                     else if (j > 0)
19                         continue;
20                     else
21                         return false;
22                 }
23             }
24 
25             return true;
26         }

代码分析：

　　1。找‘0’元素

　　2。往前推，看有没有一个元素能跳过此‘0’元素。

　　O(n2)

posted @ 2012-09-13 22:18  ETCOW  阅读(259)  评论(0)  编辑  收藏  举报