Jump Game III LeetCode solution in C++

1
class Solution {
2
 public:
3
  bool ff(vector<int> &arr, vector<bool> &visited, int i) {
4
    if (i < 0 || i >= arr.size() || visited[i]) return false;
5
    if (arr[i] == 0) return true;
6
    visited[i] = true;
7
    return ff(arr, visited, i + arr[i]) || ff(arr, visited, i - arr[i]);
8
  }
9

10
  bool canReach(vector<int> &arr, int start) {
11
    vector<bool> visited(arr.size(), false);
12
    return ff(arr, visited, start);
13
  }
14
};