【java】457. Circular Array Loop

问题原文https://leetcode-cn.com/problems/circular-array-loop/description/

public boolean circularArrayLoop(int[] nums) {
        if(nums.length<2) return false;
        int size = nums.length;
        int pos = 0;
        while(true) {
        	int tmp = (pos+nums[pos]+size)%size;
        	if(tmp == 0) return true;
        	if(nums[pos]*nums[tmp]<0) return false;
        	if(tmp == pos) return false;
        	pos = tmp;
        }
    }