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
8 changes: 6 additions & 2 deletions src/main/java/com/booleanuk/core/Exercise.java
Original file line number Diff line number Diff line change
Expand Up @@ -51,20 +51,24 @@ public Exercise(int age) {
Create a constructor that accepts both a String and an int as parameters, in that order, and assign the values
provided to the name and age members
*/
public Exercise(String name, int age) {
this.name = name;
this.age = age;
}



/*
2. Create a method named add that accepts two integers. The method should return the numbers added together.
*/

public int add(int n1, int n2) { return n1 + n2; }


/*
3. Create another method named add that accepts two Strings. The method should return the strings concatenated
together with a space in between.
*/

public String add(String s1, String s2) { return s1 + " " + s2; }


}
26 changes: 26 additions & 0 deletions src/main/java/com/booleanuk/extension/Extension.java
Original file line number Diff line number Diff line change
Expand Up @@ -26,5 +26,31 @@ public class Extension extends ExtensionBase {
multiply(["2", "7", "3"], 3) -> [6, 21, 9]
*/

public float add(float f1, float f2) { return f1 + f2; }

public double add(double d1, double d2) { return d1 + d2; }

public float subtract(float f1, float f2) {return f1 - f2;}

public String subtract(String str, char ch) {
return str.replace(String.valueOf(ch), "");
}

public int multiply(int i1, int i2) { return i1 * i2; }

public String multiply(String str, int n) {
StringBuilder strBuilder = new StringBuilder(str);
for (int i = 0; i < n-1; i++) {
strBuilder.append("," + str);
}
return strBuilder.toString();
}

public int[] multiply(String[] strs, int n) {
int[] nums = new int[strs.length];
for (int i = 0; i < strs.length; i++) {
nums[i] = Integer.parseInt(strs[i]) * n;
}
return nums;
}
}
Loading