判断一个数组是否为单一完全循环数组

最新推荐文章于 2022-08-07 07:19:58 发布

kalium

最新推荐文章于 2022-08-07 07:19:58 发布

阅读量740

点赞数

CC 4.0 BY-SA版权

分类专栏：程序实例

本文链接：https://blog.youkuaiyun.com/kalium/article/details/7589343

程序实例专栏收录该内容

10 篇文章

订阅专栏

本文介绍了一种判断数组是否构成单一完全循环的方法。通过遍历数组元素并遵循特定的跳转规则，可以确定数组是否能形成一个从首个元素出发且最终返回到起始位置的连续路径。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

判断一个数组是否为单一完全循环数组

/* Determine if an array is a single complete circle by the following rules:
 * a[0]=1 -> a[1]=3 -> a[4]= 2 -> ...
 * If array a is of length 6, a[6] -> a[0]
 */

using namespace std;

/*
Starting from a[0] without loss of generality, it can only return 
to a[0] after traversing all data items. Anytime before that if it 
goes back to a[0], this array is not a single and complete circle.
*/

bool isSingleCompleteCircle(int* x, int len)
{
  int index = 0;
  for (int i = 0; i < len; i++)
  {
    index = ((index%len) + (x[index]%len)) % len;
    // to prevent overflow (not all the time, but when len is not very large)
    if ((index == 0) &&(i < len-1))
    {
      return false;
    }
  }
  return true;
}

int main(void)
{
  int a[]={1, 1, 1, 5};
  int len = sizeof(a)/sizeof(a[0]);
  bool result = isSingleCompleteCircle(a, len);
  cout << "A single and complete circle? " << (result?"Yes":"No") << endl;
  return 0;
}