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
51 changes: 37 additions & 14 deletions src/main/java/com/booleanuk/core/Exercise.java
Original file line number Diff line number Diff line change
@@ -1,45 +1,68 @@
package com.booleanuk.core;

public class Exercise {
public int[] numsZeroToThree;
public int[] numsFiveToTen;
public int[] countdown;
public int[] numsZeroToThree = new int[4];

public int[] numsFiveToTen = new int [6];
public int[] countdown= new int[4];

public int[] favouriteNumbers = {1, 2, 4, 5, 7, 8, 10};

public String[] myHobbies = {"Fishing", "Language learning", "Skydiving", "Procrastinating"};

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

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

}

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

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

}

public void stepThree() {
// TODO: 3. Write a for loop that adds the numbers 3 to 0 (in that order) to the countdown array

int b = 0;
for(int i = 3; i > 0; i--){
countdown[b] = i;
b = b + 1;
}

}

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



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

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



return false;
boolean b = false;
for(int i = 0; i < myHobbies.length; i++){
if(myHobbies[i].equals(hobby)){
b = true;
}
}
if (b){
return true;
} else {
return false;
}
}

Choose a reason for hiding this comment

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

Quite allot of repeated/uneeded code here. A more concise approach would be like the following:

public boolean stepFour(int num) {
    for (int i = 0; i < favouriteNumbers.length; i++) {
        if (favouriteNumbers[i] == num) {
            return true;  // Return true immediately if the number is found
        }
    }
    return false;  // Return false if the number is not found after checking the entire array
}

}
7 changes: 6 additions & 1 deletion src/main/java/com/booleanuk/extension/Extension.java
Original file line number Diff line number Diff line change
@@ -1,10 +1,15 @@
package com.booleanuk.extension;

public class Extension {
public int[] numsEven;

public int[] numsEven = new int[4];
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
for (int i = 0; i < 7; i++){
if(i % 2 == 0){
numsEven[i / 2] = i;
}
}



Expand Down