LeetCode 189. Rotate Array

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        int len = nums.size();
        
        k = k % len;
        
        int x;
        int y;
        int start=0;
        int pos=0;
        x=nums[pos];
        int num=0;
        while(1)
        {
            y = nums[(pos+k)%len];
            nums[(pos+k)%len] = x;
            x = y;
            pos = (pos+k)%len;
            
            num++;
            
            if(pos==start && num!=nums.size())
            {
                pos = start+1;
                start = pos;
                x = nums[pos];
                continue;
            }
            
            if(num==nums.size())
                break;
        }
    }
};