拆解数字

import java.util.LinkedList;

/**
 * 将任一个数字进行拆解，例如：
 * 
 * 3 = 2+1 = 1+1+1 所以3有三種拆法 
 * 4 = 3 + 1 = 2 + 2 = 2 + 1 + 1 = 1 + 1 + 1 + 1 共五種 
 * 5 = 4 + 1 = 3 + 2 = 3 + 1 + 1 = 2 + 2 + 1 = 2 + 1 + 1 + 1 = 1 + 1 +1 +1 +1　共七种
 * 
 * 随便给一个数字，对其进行拆解，并打印可拆解情况和拆解结果数。
 */
public class Uncoil {
	public static void main(String[] args) {
		LinkedList<LinkedList<LinkedList<Integer>>> results = new LinkedList<LinkedList<LinkedList<Integer>>>();
		
		
		LinkedList<LinkedList<Integer>> result = new LinkedList<LinkedList<Integer>>();
		LinkedList<Integer> oneResult;
		
		int input = 20;

		for (int i = 1; i <= input; i++) {
			result = new LinkedList<LinkedList<Integer>>();
			oneResult = new LinkedList<Integer>();
			oneResult.add(i);
			result.add(oneResult);
			for (int j = i / 2; j >=1 ; j--) {
				LinkedList<LinkedList<Integer>> lefts = results.get(i - j - 1);
				for (LinkedList<Integer> left : lefts) {
					if (left.getLast() < j) {
						break;
					}
					oneResult = new LinkedList<Integer>();
					oneResult.addAll(left);
					oneResult.add(j);
					result.add(oneResult);
				}
			}
			results.add(result);
		}
		
		for (LinkedList<LinkedList<Integer>> os : results) {
			System.out.println("====================" + os.size());
//			for (LinkedList<Integer> o : os) {
//				System.out.println(o);
//			}
		}
	}
}