Java Challenge - posNeg - warm_up

Given 2 int values, return true if one is negative and one is positive. Except if the parameter "negative" is true, then return true only if both are negative. posNeg(1, -1, false) → true posNeg(-1, 1, false) → true posNeg(-4, -5, true) → true

Hisoka's Style:

1 2 3 4 5 6 7 8 9 10 11 12

public boolean posNeg(int a, int b, boolean negative) { if(negative) { if(a<0 && b<0) return true; else return false; }else { if((a<0 && b>0) || (a>0 && b<0)) return true; else return false; } }

Output:

Codingbat style:

1 2 3 4 5 6 7 8

public boolean posNeg(int a, int b, boolean negative) { if (negative) { return (a < 0 && b < 0); } else { return ((a < 0 && b > 0) || (a > 0 && b < 0)); } }

Java Challenge - make10 - warm_up

Given 2 ints, a and b, return true if one if them is 10 or if their sum is 10. makes10(9, 10) → true makes10(9, 9) → false makes10(1, 9) → true

Hisoka's answer :

1 2 3

public boolean makes10(int a, int b) { return(a == 10 || b==10 || a+b==10); }

Hasilnya :

Codingbat style:

1 2 3

public boolean makes10(int a, int b) { return (a == 10 || b == 10 || a+b == 10); }

Waaaw... samaaa... :D