Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
36 changes: 34 additions & 2 deletions src/main/java/com/booleanuk/core/Exercise.java
Original file line number Diff line number Diff line change
Expand Up @@ -11,35 +11,67 @@ public class Exercise {

public void stepOne() {
// TODO: 1. Write a for loop that adds the numbers 0 to 3 to the numsZeroToThree array
int[] arr = new int[4];

for (int i = 0; i <= 3 ; i++) {
arr[i] = i;

}
this.numsZeroToThree = arr;

}

public void stepTwo() {
// TODO: 2. Write a for loop that adds the numbers 5 to 10 to the numsFiveToTen array
int[] arr = new int[6];

for (int i = 5; i <= 10 ; i++) {
arr[i-5] = i;

}
this.numsFiveToTen = arr;

}

public void stepThree() {
// TODO: 3. Write a for loop that adds the numbers 3 to 0 (in that order) to the countdown array
int[] arr = new int[4];
int num=3;
for (int i = 0; i <= 3 ; i++) {
arr[i] = num;
num--;

}
this.countdown = arr;

}

public boolean stepFour(int num) {
// TODO: 6. Write a for loop that checks if num is in the favouriteNumbers array
int numberIn=0;
boolean favNumberInArray =false;
for (int i = 0; i <= favouriteNumbers.length-1 ; i++) {
numberIn=favouriteNumbers[i];
if (numberIn==num)favNumberInArray=true;

}

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Could be simplifed:

public boolean stepFour(int num) {
    for (int i = 0; i < favouriteNumbers.length; i++) {
        if (favouriteNumbers[i] == num) {
            return true;
        }
    }
    return false;
}

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

You can apply this approach to your other answers to improve readability and efficency

return favNumberInArray;



return false;
}

public boolean stepFive(String hobby) {
// TODO 5. Write a for loop that checks if the hobby String is in the myHobbies array
String stringIn="";
boolean hobbyIn =false;
for (int i = 0; i <= myHobbies.length-1 ; i++) {
stringIn=myHobbies[i];
if (stringIn.equals(hobby))hobbyIn=true;

}
return hobbyIn;


return false;
}
}
8 changes: 7 additions & 1 deletion src/main/java/com/booleanuk/extension/Extension.java
Original file line number Diff line number Diff line change
Expand Up @@ -5,7 +5,13 @@ public class Extension {

public void stepOne() {
// TODO: 1. Write a for loop that adds all the even numbers between 0 and 6 (0, 2, 4, 6) to evenNums

int[] arr = new int[4];
int count=0;
for (int i = 0; i <= 3 ; i++) {
arr[i] = count;
count += 2;
}
this.numsEven = arr;


}
Expand Down