LeetCode--457. 环形数组是否存在循环

457. 环形数组是否存在循环

思路：快慢指针
1 需要依次以每一个点作为起点，检查是否符合要求，即从该点出发可以进入一个循环
2 根据题目描述，从起点开始每一次所走的方向必须是一致的，所以我们需要每一次检查到达点的下一步方向是否和当前行进的方向一致
3 需要随时判断下一次点是否是一个自循环的点，如果是，则判断不符合条件
4 在一个点判断完成后，将该点路径上所经过的所有的点的值都设置为0，代表已经走过。

/**
 * 457. 环形数组是否存在循环
 */

public class Solution457 {
	public boolean circularArrayLoop(int[] nums) {
		int length = nums.length;
		for (int i = 0; i < length; i++) {
			if (nums[i] == 0) {
				continue;
			}
			if (lookingForLoopsnd(nums, i, length)) {
				return true;
			}
		}
		return false;
	}


	private boolean lookingForLoopsnd(int[] nums, int num, int length) {
		int slowPointer = num;
		int fastPointer = next(nums, num, length);
		int nextFastPointer = next(nums, fastPointer, length);
		while (nums[slowPointer] * nums[fastPointer] > 0 && nums[slowPointer] * nums[nextFastPointer] > 0) {
			if (slowPointer == fastPointer) {
				if (slowPointer != nextFastPointer) {
					return true;
				} else {
					break;
				}
			}
			slowPointer = next(nums, slowPointer, length);
			fastPointer = next(nums, next(nums, fastPointer, length), length);
			nextFastPointer = next(nums, fastPointer, length);
		}
		int add = num;
		int addNext = next(nums, add, length);
		while (nums[add] * nums[addNext] > 0) {
			int tmp = add;
			add = next(nums, add, length);
			addNext = next(nums, add, length);
			nums[tmp] = 0;
		}
		return false;
	}

	public int next(int[] nums, int num, int length) {
		return ((num + nums[num]) % length + length)% length;
	}
}