Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Arrays; // necessary to Sysout the arrays of ints in a human-readable fashion.
- //import java.util.Scanner;
- //import java.lang.Math;
- public class cse215 {
- // public static Scanner s = new Scanner(System.in);
- // public static void main(String[] args) {
- // int b = s.nextInt();
- // System.out.println(hw(b));
- // }
- // // attempt: at using a scanner to read in NUMBER
- // public static String hw(String a) { // at using a string function instead of int[] array
- // a += ;
- //
- // return "";
- // }
- public static final int NUMBER = 5;
- public static void main(String[] args) {
- // int a = s.nextInt();
- // for (int i = 0; i < a; i++) {
- // System.out.print(i);
- // }
- // for (int i = a; i > -1; i--) { // attempt at using iteration instead of recursion
- // System.out.print(i);
- //
- // }
- int[] inputarray = new int[1];
- inputarray[0] = NUMBER;
- System.out.println(Arrays.toString(hw(inputarray)));
- }
- public static int[] hw(int[] oldarr) {
- if (oldarr.length - 1 < NUMBER // && newarr[newarr.length - 1] !=
- // NUMBER) {
- ) {
- int[] newarr = new int[oldarr.length + 1];
- newarr[oldarr.length] = oldarr[oldarr.length - 1] - 1;
- for (int i = 0; i < newarr.length; i++) {
- newarr[i] = i;
- }
- // System.out.println(Arrays.toString(newarr));
- hw(newarr);
- return newarr;
- }
- else if (oldarr[oldarr.length - 1] != 0) {
- int[] newarr = new int[oldarr.length + 1];
- for (int i = 0; i < newarr.length - 1; i++) {
- newarr[i] = oldarr[i];
- }
- newarr[newarr.length - 1] = oldarr[oldarr.length - 1] - 1;
- // System.out.println(Arrays.toString(newarr));
- hw(newarr);
- return newarr;
- }
- System.out.println(Arrays.toString(oldarr));
- System.out.println("here is where it fails");
- return oldarr;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement