原题如下:
The following iterative sequence is defined for the set of positive integers:
n n/2 (n is even)
n 3n + 1 (n is odd)
Using the rule above and starting with 13, we generate the following sequence:
It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. Although it has not been proved yet (Collatz Problem), it is thought that all starting numbers finish at 1.
Which starting number, under one million, produces the longest chain?
NOTE: Once the chain starts the terms are allowed to go above one million.
翻译:
以下迭代序列定义在整数集合上:
n n/2 (当n是偶数时)
n 3n + 1 (当n是奇数时)
应用以上规则,并且以数字13开始,我们得到以下序列:
可以看出这个以13开始以1结束的序列包含10个项。虽然还没有被证明(Collatz问题),但是人们认为在这个规则下,以任何数字开始都会以1结束。
以哪个不超过100万的数字开始,能给得到最长的序列?注意: 一旦序列开始之后,也就是从第二项开始,项是可以超过100万的。
解题思路:
遍历小于1000000的所以数,分别检测可以得到的数列长度,遍历完成后,取出最大值所对应的起始数字即为答案 837799,java代码如下:
public static void main(String[] args) {
// TODO Auto-generated method stub
int count=0;
long n=0L;
int startNum=0;
int max=0;
for(int i=2;i<1000000;i++){
n=i;
while(n!=1){
if(n%2==0){
n=n/2;
count++;
}else{
n=n*3+1;
count++;
}
}
if(count+1>max){ //由于在while循环中,n==1时,count没有+1,所以得到的数列长度忽略了1,这里加上
max=count+1;
startNum=i;
}
System.out.println(count+1);
count=0;
}
System.out.println(startNum);
}
}