剑指offerT41另外一种解法-优快云博客

本文链接：https://blog.youkuaiyun.com/longlovefilm/article/details/78176137

本文介绍了一种算法，用于找出所有可能的连续正整数序列，这些序列的和等于给定的目标值。通过双指针技术实现了高效查找，并提供了完整的C++代码实现。

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

void print(int s, int b)
{
   for (int i = s; i <= b; i++)
   {
       cout << i << " ";
   }
   cout << endl<<"------------------------------" << endl;
}

void judgeshuzu(int sum)
{
   int l = 1, r = 2;
   int mid = (sum + 1) / 2;
   int cursum = l + r;
   while (l<mid)
   {

       if (cursum == sum)
       {
           print(l, r);
           r++;
           cursum = cursum + r;

       }
       else if (l<mid&&cursum > sum)
       {
           cursum = cursum - l;
           l++;

       }
       else if (l<mid&&cursum < sum)
       {
           r++;
           cursum = cursum + r;
       }

   }
}

void FindContinuousSequence(int sum)
{
   if (sum < 3)
       return;

   int small = 1;
   int big = 2;
   int middle = (1 + sum) / 2;
   int curSum = small + big;

   while (small < middle)
   {
       if (curSum == sum)
           print(small, big);

       while (curSum > sum && small < middle)
       {
           curSum -= small;
           small++;

           if (curSum == sum)
               print(small, big);
       }

       big++;
       curSum += big;
   }
}

int main()
{
   judgeshuzu(15);
   cout << "++++++++++++++++++++++++++++++++++++++++++++++++++" << endl;
   FindContinuousSequence(15);
   system("pause");
   return 0;
}