# Circular Array Loop Problem

## Description

LeetCode Problem 457.

You are playing a game involving a circular array of non-zero integers nums. Each nums[i] denotes the number of indices forward/backward you must move if you are located at index i:

• If nums[i] is positive, move nums[i] steps forward, and
• If nums[i] is negative, move nums[i] steps backward.

Since the array is circular, you may assume that moving forward from the last element puts you on the first element, and moving backwards from the first element puts you on the last element.

A cycle in the array consists of a sequence of indices seq of length k where:

• Following the movement rules above results in the repeating index sequence seq -> seq -> … -> seq[k - 1] -> seq -> …
• Every nums[seq[j]] is either all positive or all negative.
• k > 1

Return true if there is a cycle in nums, or false otherwise.

Example 1:

``````1
2
3
4
5
Input: nums = [2,-1,1,2,2]
Output: true
Explanation:
There is a cycle from index 0 -> 2 -> 3 -> 0 -> ...
The cycle's length is 3.
``````

Example 2:

``````1
2
3
4
5
Input: nums = [-1,2]
Output: false
Explanation:
The sequence from index 1 -> 1 -> 1 -> ... is not a cycle because the sequence's length is 1.
By definition the sequence's length must be strictly greater than 1 to be a cycle.
``````

Example 3:

``````1
2
3
4
5
Input: nums = [-2,1,-1,-2,-2]
Output: false
Explanation:
The sequence from index 1 -> 2 -> 1 -> ... is not a cycle because nums is positive, but nums is negative.
Every nums[seq[j]] must be either all positive or all negative.
``````

Constraints:

• 1 <= nums.length <= 5000
• -1000 <= nums[i] <= 1000
• nums[i] != 0

## Sample C++ Code

``````1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
class Solution {
public:
bool circularArrayLoop(vector<int>& nums) {
int n = nums.size();
for (int j = 0; j < n; ++ j)
nums[j] %= n; // After this, no number is > n or < -n.
for (int j = 0; j < n; ++ j) {
int i = j, last_i = 0;
bool is_forward = nums[i] > 0;
while (nums[i] % n != 0 && nums[i] > 0 == is_forward) {
last_i = i;
i = (i + nums[i] + n) % n;
nums[last_i] = (j + 1) * n;
if (nums[i] == (j + 1) * n) //each round, use a different number as the "visited marker".
return true;
}
}
return false;
}
};
``````