一个正数N，求相加等于N的所有连续的i个数的序列。如N=5，此时只有一个序列2、3.我这个算法的复杂度已经降到根号N，效率很高-A positive number N, seeking the sum is equal to N for all i the number of consecutive sequences. If N = 5, this time there is only one sequence of 2,3. I have the complexity of this alg