project euler 14

Problem 14

---

Longest Collatz sequence

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:

13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1

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 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1

可以看出这个序列（从13开始到1结束）共有10项。尽管还没有被证明，但我们普遍认为，从任何数开始最终都能迭代至1（“考拉兹猜想”）。

从小于一百万的哪个数开始，能够生成最长的序列呢？

注： 序列开始生成后允许其中的项超过一百万。

package projecteuler;

import org.junit.Test;

public class Prj14 {

	/**
	 * 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:
	 * 
	 * 13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1 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?
	 */
	@Test
	public void test() {

		System.out.println(Calculator.calculate(1000000));

	}

	public static class Calculator {

		public static int calculate(int upLimit) {

			int maxLen = 0;
			int maxId = 3;
			for (int i = 3; i < upLimit; i++) {

				int len = calculateCollatzLen(i);
				if (len > maxLen) {
					maxLen = len;
					maxId = i;
				}

			}
			return maxId;

		}

		public static int calculateCollatzLen(int i) {

			long n = i;
			int count = 1;
			while( n != 1 ){
				if( n % 2 == 0){
					n = n / 2;
				}else{
					n = n * 3 + 1;
				}
				count ++;
			}
			return count;
		}

	}
}