The sum problem——关于连续子数列的求和问题

最新推荐文章于 2021-06-11 01:20:00 发布

Wildcatastrophe

最新推荐文章于 2021-06-11 01:20:00 发布

阅读量767

点赞数

分类专栏：知识点

本文链接：https://blog.csdn.net/Wildcatastrophe/article/details/54963451

版权

本文探讨了如何找到从1到N的所有连续子数列，其和等于给定的目标值M。首先介绍了O(N)时间复杂度和空间复杂度的算法，但由于内存限制无法通过。然后，提出了一种优化的O(Nlog N)算法，通过不考虑子列终点，仅考虑起点i和元素个数j，利用等差数列求和公式减少空间复杂度至0，成功解决Memory Limit Exceeded问题。

摘要由CSDN通过智能技术生成

Given a sequence 1,2,3,……N, your job is to calculate all the possible sub-sequences that the sum of the sub-sequence is M.
Input
Input contains multiple test cases. each case contains two integers N, M( 1 <= N, M <= 1000000000).input ends with N = M = 0.
Output
For each test case, print all the possible sub-sequence that its sum is M.The format is show in the sample below.print a blank line after each test case.
Sample Input
20 10
50 30
0 0
Sample Output
[1,4]
[10,10]
[4,8]
[6,9]
[9,11]
[30,30]