IBCS Warm Up by Mery Tellez

The Problem:

mtellez4 — 2021-08-10 05:27:06 UTC

Create a function that takes two numbers and a mathematical operator + - / * and will perform a calculation with the given numbers.

Examples

calculator(2, '+', 2) ➞ 4
calculator(2, '*', 2) ➞ 4
calculator(4, '/', 2) ➞ 2

Note: If the input tries to divide by 0, return 0.

Method heading:

public static int calculator(int num1, char operator, int num2) {

}

https://edabit.com/challenge/gyfsGx7KrGLscxFrD

The Problem:

mtellez4 — 2021-08-10 05:46:40 UTC

Write a function that finds the sum of an array. Make your function recursive.

Examples

sum([1, 2, 3, 4]) ➞ 10
sum([1, 2]) ➞ 3
sum([1]) ➞ 1
sum([]) ➞ 0

Note: Return 0 for an empty array.

Method heading:

public static int sum(int[] arr) {
		
}

https://edabit.com/challenge/hf2THAoQRQbAx2jc9

Siho - POST

4117016 — 2021-08-12 05:06:55 UTC

public static int calculator(int num1, char operator, int num2) {
int finalNum;
if (operator == '+') {
finalNum = num1 + num2;
} else if (operator == '-') {
finalNum = num1 - num2;
} else if (operator == '*') {
finalNum = num1 * num2;
} else if (operator == '/') {
finalNum = num1 / num2;
} else {
return 0;
}
return finalNum;
}

Siho - POST

4117016 — 2021-08-12 05:07:16 UTC

public static int sum(int[] arr) {

if (arr.length == 0) {
return 0;
} else {
int[] arr2 = new int[arr.length - 1];
for (int i = 0; i < arr.length - 1; i++) {
arr2[i] = arr[i];
}
return arr[arr.length - 1] + sum(arr2);
}

}

Hamza

2021-08-12 05:07:56 UTC

var operators = map[rune]func(int, int) int {
'+': func(a , b int) int { return a + b },
'*': func(a , b int) int { return a * b },
'/': func(a , b int) int { return a / b },
}

func calculator(a int, op rune, b int) int {
return operators[op](a, b)
}

Hamza

2021-08-12 05:09:05 UTC

func recursiveSum(s []int) int {
if len(s) == 0 {
return 0
}
return s[0] + recursiveSum(s[1:])
}

Holden - Post

2021-08-12 05:10:14 UTC

public int calculator(int num1, char operator, int num2) {
if (operator == '+'){
return num1+num2;
} else if (operator == '-'){
return num1-num2;
} else if (operator == '*'){
return num1*num2;
} else if (operator == '/'){
return num1/num2;
}

return -1;

}

Advait

2021-08-12 05:11:14 UTC

public class Challenge {
public static int calculator(int num1, char operator, int num2) {
if (operator == '+') {
return num1 + num2;
} else if (operator == '-'){
return num1 - num2;
} else if (operator == '*') {
return num1 * num2;
} else if (operator == '/'){
if (num2 == 0){
return 0;
}
return num1 / num2;
} else {
return 0;
}