题目描述:小明很喜欢数学,有一天他在做数学作业时,要求计算出9~16的和,他马上就写出了正确答案是100。但是他并不满足于此,他在想究竟有多少种连续的正数序列的和为100(至少包括两个数)。没多久,他就得到另一组连续正数和为100的序列:18,19,20,21,22。现在把问题交给你,你能不能也很快的找出所有和为S的连续正数序列? Good Luck!
输出描述:输出所有和为S的连续正数序列。序列内按照从小至大的顺序,序列间按照开始数字从小到大的顺序
思路一:
*初始化left=1,right=2;
*left到right序列和小于sum,right++,大于sum,left++;
*当left增加到(1+sum)/2时停止
import java.util.ArrayList;
public class Solution {
public ArrayList<ArrayList<Integer> > FindContinuousSequence(int sum) {
ArrayList<ArrayList<Integer>> lists = new ArrayList<>();
if (sum <= 1) return lists;
int left = 1;
int right = 2;
while (left <= (sum + 1) / 2)
{
int currSum = 0;
for (int i = left; i <= right; i++)
currSum += i;
if (currSum == sum)
{
ArrayList<Integer> list = new ArrayList<>();
for (int j = left; j <= right; j++)
list.add(j);
lists.add(list);
left++;
right++;
}
else if (currSum < sum) right++;
else left++;
}
return lists;
}
}
思路二:
根据数学公式计算:(a1+an) * (an-a1+1) / 2=sum
*an-a1+1 = i;
*a1+an = d;
*a1 = (d-i+1)/2;
*an = (d+i-1)/2;
import java.util.ArrayList;
public class Solution {
public ArrayList<ArrayList<Integer> > FindContinuousSequence(int sum) {
ArrayList<ArrayList<Integer>> lists = new ArrayList<>();
if (sum < 3) return lists;
int s = (int) Math.sqrt(2 * sum);
for (int i = s; i >= 2; i--)
{
if ((2 * sum) % i == 0)
{
int d = 2 * sum / i;
if ((d % 2 != 0 && i % 2 == 0) || (d % 2 == 0 && i % 2 != 0))
{
int a1 = (d - i + 1) / 2;
int an = (d + i - 1) / 2;
ArrayList<Integer> list = new ArrayList<>();
for (int k =a1; k <= an; k++)
list.add(k);
lists.add(list);
}
}
}
return lists;
}
}