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: 23 additions & 9 deletions src/main/java/com/booleanuk/core/Exercise.java
Original file line number Diff line number Diff line change
@@ -1,43 +1,57 @@
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 < 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

for(int i = 0; i < numsFiveToTen.length; i++) {
numsFiveToTen[i] = i + 5;
}

}

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

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

}

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

for(int i = 0; i < favouriteNumbers.length; i++) {
if(num == favouriteNumbers[i]) {
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(int i = 0; i < myHobbies.length; i++) {
if(hobby.equals(myHobbies[i])) {
return true;
}
}


return false;
Expand Down
10 changes: 8 additions & 2 deletions src/main/java/com/booleanuk/extension/Extension.java
Original file line number Diff line number Diff line change
@@ -1,11 +1,17 @@
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

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


}
Expand Down