leetcode_56 Jump Game III

Given an array of non-negative integers arr, you are initially positioned at start index of the array. When you are at index i, you can jump to i + arr[i] or i - arr[i], check if you can reach to any index with value 0.

Notice that you can not jump outside of the array at any time.

 

Example 1:

Input: arr = [4,2,3,0,3,1,2], start = 5
Output: true
Explanation: 
All possible ways to reach at index 3 with value 0 are: 
index 5 -> index 4 -> index 1 -> index 3 
index 5 -> index 6 -> index 4 -> index 1 -> index 3

Example 2:

Input: arr = [4,2,3,0,3,1,2], start = 0
Output: true 
Explanation: 
One possible way to reach at index 3 with value 0 is: 
index 0 -> index 4 -> index 1 -> index 3

Example 3:

Input: arr = [3,0,2,1,2], start = 2
Output: false
Explanation: There is no way to reach at index 1 with value 0.

Constraints:

• 1 <= arr.length <= 5 * 10^4
• 0 <= arr[i] < arr.length
• 0 <= start < arr.length

 

arr = [0,0], start = 0;

arr = [0,3,0,6,3,3,4], start = 6

本题采用BFS,需要注意的是数组中可能不止一个零，而只要能到达其中一个就可以

class Solution {
public:
    bool canReach(vector<int>& arr, int start) {
        int n = arr.size();
        //int index = -1;
        vector<int> index;
        for(int i = 0; i < n; i++)
        {
            if(arr[i] == 0)
            {
                index.push_back(i);
            }
        }
        if(index.empty() || start < 0 || start >=n )
            return false;

        vector<int> visited(n,0);
        queue<int> Q;
        Q.push(start);
        visited[start] = 1;
        while(!Q.empty()){
            int temp = Q.front();
            Q.pop();
            int ways = temp - arr[temp];
            if(0 != count(index.begin(),index.end(),ways))
                return true;
            else if((ways >=0 && ways < n) && !visited[ways])
            {
                Q.push(ways);
                visited[ways] = 1;   
            }
            ways = temp + arr[temp];
            if(0 != count(index.begin(),index.end(),ways))
                return true;
            else if((ways >= 0 && ways < n) && !visited[ways])
            {
                Q.push(ways);
                visited[ways] = 1;
            }
        }
        return false;
    }
};