##
**Problem:**

Start with 2 int arrays, a and b, each length 2. Consider the sum of the values in each array. Return the array which has the largest sum. In event of a tie, return a.

biggerTwo({1, 2}, {3, 4}) → {3, 4}

biggerTwo({3, 4}, {1, 2}) → {3, 4}

biggerTwo({1, 1}, {1, 2}) → {1, 2}

##
**Solution:**

public int[] biggerTwo(int[] a, int[] b) { int aTotal = a[0] + a[1]; int bTotal = b[0] + b[1]; if (aTotal == bTotal) return a; else if (aTotal > bTotal) return a; else return b; }

public int[] biggerTwo(int[] a, int[] b) {

ReplyDeleteif (a[0]+a[1]>=b[0]+b[1]) return a;

else return b;

}

public int[] biggerTwo(int[] a, int[] b) {

ReplyDeleteif (b[0] + b[1] > a[0] + a[1]) return b;

else return a;

}