BIGGER2.java

/*
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]
 */
package school;

import java.util.Arrays;
public class BIGGER2 {
    public static void main(String[] args){
        int[] nums = {1,2};
        int[] nums1 = {3,4};
        int[] answer = biggerTwo(nums, nums1);
        System.out.println(Arrays.toString(answer));
    }
public static int[] biggerTwo(int[] a, int[] b) {
  int sum1;
  int sum2;
  sum1 = a[0] + a[1];
  sum2 = b[0] + b[1];
  if(sum1>sum2 || sum1==sum2){return a;}
  else {return b;}
}

}