No.256 - LeetCode[457] Circular Array Loop - 模拟题

ShellDawn

于 2021-02-20 22:48:13 发布

阅读量131

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/ShellDawn/article/details/113900886

leetcode 专栏收录该内容

251 篇文章

订阅专栏

/*
 * @lc app=leetcode id=457 lang=cpp
 *
 * [457] Circular Array Loop
 */

// @lc code=start
class Solution {
public:
    bool circularArrayLoop(vector<int>& nums) {
        int N = nums.size();
        if(N < 2) return false;
        int V[N];
        int loc;
        int cnt;

        // forward
        memset(V, 0, sizeof(V));
        cnt = 0;
        for(int i=0; i<N; i++){
            if(V[i] == 0 && nums[i] > 0 ) {
                cnt++;
                loc = i;
                while( V[loc] == 0 && nums[loc] > 0 ){
                    V[loc] = cnt;
                    loc = (loc + nums[loc]) % N;
                }

                if( nums[loc] < 0 || nums[loc]%N == 0 || V[i] != V[loc] ){
                    continue;
                }

                return true;
            }
        }

        // backward
        memset(V, 0, sizeof(V));
        cnt = 0;
        for(int i=0; i<N; i++){
            if(V[i] == 0 && nums[i] < 0 ) {
                loc = i;
                cnt ++;
                while( V[loc] == 0 && nums[loc] < 0 ){
                    V[loc] = cnt;
                    loc = (loc + nums[loc] + 1000*N) % N;
                }

                if( nums[loc] > 0 || (-nums[loc])%N == 0 || V[i] != V[loc] ){
                    continue;
                }

                return true;
            }
        }
        return false;
    }
};
// @lc code=end