递归 递归算法(二)
public static String tourData(int n) {
String str = new String();
if(1 == n) {
str = rowData(n) + "\n";
return str;
}
else {
str = tourData(n-1) + rowData(n) + "\n";
}
}
private static String rowData(int n) {
String str = new String();
for(int i=0; i
str = str+ n + " ";
}
return str;
}