SW练习_ P1028 数的计算_简单递归


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.math.BigDecimal;
import java.util.StringTokenizer;
public class Main {
    static int[] res;
    public static void main(String[] args) throws Exception{
        BufferedReader reader=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer(reader.readLine());
        int N=Integer.parseInt(st.nextToken());
        BigDecimal[] arr=new BigDecimal[N+1];
        res=new int[N+1];


        System.out.println(process(N));

        reader.close();
    }
    public static int process(int a){
        if(a==0){
            return 0;
        }
        if(a==1){
            return res[a]=1;
        }
        if(a==2){
            return res[a]=2;
        }
        if(res[a]!=0){
            return res[a];
        }
        int sum=1;
        for (int i =1 ; i <=a/2 ; i++) {
            sum=sum+process(i);
        }
        return res[a]=sum;

    }
}

 

你可能感兴趣的:(算法)