Java > Logic-1 > sortaSum (CodingBat Solution)

Problem:

Given 2 ints, a and b, return their sum. However, sums in the range 10..19 inclusive, are forbidden, so in that case just return 20.

sortaSum(3, 4) → 7
sortaSum(9, 4) → 20
sortaSum(10, 11) → 21


Solution:

public int sortaSum(int a, int b) {
  int sum = a+b;
  
  if(sum >= 10 && sum <= 19)
    return 20;
  else
    return sum;
}

5 comments:

  1. UnknownJune 23, 2018 at 8:57 AM

    public int sortaSum(int a, int b) {
    int sum = a + b;
    return sum >= 10 && sum <= 19 ? 20 : sum;
    }

    ReplyDelete
  2. UnknownMay 13, 2020 at 9:58 PM

    public int sortaSum(int a, int b) {
    int sum = a+b;
    boolean inRange = sum >= 10 && sum <= 19;
    return !inRange ? sum:20;

    }

    ReplyDelete
  3. AnonymousSeptember 18, 2020 at 3:14 AM

    public int sortaSum(int a, int b) {
    return ( 10 <= (a + b) && (a + b) <= 19)? 20 : (a + b);
    }

    ReplyDelete
  4. Iqboljon AbdumalikovApril 15, 2022 at 5:45 AM

    In JavaScript:

    function sortaSum(a, b) {
    if(a + b >= 10 && a + b <= 20) {
    return 20
    } else {
    return a + b
    }
    }

    ReplyDelete
  5. vinayakDecember 19, 2022 at 9:49 AM

    public int sortaSum(int a, int b)
    {
    int sum;
    sum=a+b;
    if(sum>=10 && sum<=19)
    {
    return 20;
    }
    return sum;
    }

    ReplyDelete