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
32 changes: 27 additions & 5 deletions src/main/java/com/booleanuk/core/Exercise.java
Original file line number Diff line number Diff line change
Expand Up @@ -11,34 +11,56 @@ public class Exercise {

public void stepOne() {
// TODO: 1. Write a for loop that adds the numbers 0 to 3 to the numsZeroToThree array

numsZeroToThree = new int[4];
for (int i = 0; i < 4; i++){
numsZeroToThree[i] = i;
}

}

public void stepTwo() {
// TODO: 2. Write a for loop that adds the numbers 5 to 10 to the numsFiveToTen array
int lower = 5;
int upper = 10;

numsFiveToTen = new int[upper-lower+1];

for(int i = 0; i <= upper-lower; i++){
numsFiveToTen[i] = i+lower;
}

}

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

for (int i = 0; i <= upper; i++){
countdown[i] = upper-i;
}

}

public boolean stepFour(int num) {
// TODO: 6. Write a for loop that checks if num is in the favouriteNumbers array



for(int cur : favouriteNumbers){
if (cur == num){
return true;
}
}
return false;
}

public boolean stepFive(String hobby) {
// TODO 5. Write a for loop that checks if the hobby String is in the myHobbies array


for(String str : myHobbies){
if(str.equals(hobby)){
return true;
}
}

return false;
}
Expand Down
10 changes: 9 additions & 1 deletion src/main/java/com/booleanuk/extension/Extension.java
Original file line number Diff line number Diff line change
Expand Up @@ -5,8 +5,16 @@ 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 upper = 6;
numsEven = new int[(upper/2) + 1]; //+1 because 0 is included
int currIndex = 0;

for(int i = 0; i <= 6; i++){
if (i%2 == 0){
numsEven[currIndex] = i;
currIndex++;
}
}


}
}
Loading