算法导论：钢条切割（java递归实现）

import java.util.*;
public class Main{
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n,a;
		n = in.nextInt();
		a = rod(n);
		System.out.print(a);
	}
	public static int rod(int n) {
		int[] price = {1,5,8,9,10,17,17,20,24,30};
		int result;
		if(n==0) 
			return 0;
		result = -999999;
		for(int i=1;i<=n;i++) {
			result = Math.max(result,price[i-1]+rod(n-i));
		}
		return result;
	}
}