半数集

package algorithms;/** * Created by sprint on 16-10-19. */public class HalfOfSets {    private int[] arrays = new int[10000];//默认为０    public int numberOfResult(int key) {        if (arrays[key] > 0)    return arrays[key];        int result = 1;        for (int i = 1; i <= key/2; i++) {            result += numberOfResult(i);        }        arrays[key] = result;        return result;    }    public static void main(String[] args) {        HalfOfSets hos = new HalfOfSets();        System.out.println(hos.numberOfResult(15));    }}