Java > Array-1 > maxTriple (CodingBat Solution)

Problem:

Given an array of ints of odd length, look at the first, last, and middle values in the array and return the largest. The array length will be a least 1.

maxTriple({1, 2, 3}) → 3
maxTriple({1, 5, 3}) → 5
maxTriple({5, 2, 3}) → 5


Solution:

public int maxTriple(int[] nums) {
  int result = 0;
  int a = nums[0];
  int b= nums[((nums.length+1)/2) -1;
  int c = nums[nums.length -1];
  
  if (a>b && a>c)
  result = a;
    if (b>a && b>c)
  result = b;
    if (c>a && c>b)
  result = c;
  return result;
  }


10 comments :

  1. //How about this
    public int maxTriple(int[] nums) {
    int middle= nums.length/2;
    int compare1= Math.max(nums[0],nums[middle]);
    return Math.max(compare1,nums[nums.length-1]);
    }

    ReplyDelete
  2. Missing closed bracket on line 4 after the 1.

    ReplyDelete
  3. public int maxTriple(int[] nums) {
    int temp = 0;

    if (nums[0] > nums[(nums.length+1)/2-1])
    temp = nums[0];
    else
    temp = nums[(nums.length+1)/2-1];
    if (nums[nums.length-1] > temp)
    temp = nums[nums.length-1];
    return temp;
    }

    ReplyDelete
  4. BEST AND EASIEST SOLUTION, trust me:

    public int maxTriple(int[] nums) {
    int largest = nums[0];
    int mid = nums.length / 2;
    int[] largeArray = { nums[0], nums[mid], nums[nums.length-1] };

    for(int i = 0; i < largeArray.length; i++){
    if(largeArray[i] > largest){
    largest = largeArray[i];
    }
    }
    return largest;
    }

    ReplyDelete
  5. public int maxTriple(int[] nums) {
    int first = nums[0];
    int middle = nums[(nums.length/2)];
    int last = nums[nums.length-1];
    int firstMax = Math.max(first,middle);
    int finalMax = Math.max(firstMax,last);
    return finalMax;

    }

    ReplyDelete
  6. public int maxTriple(int[] nums) {
    int mid= nums.length/2;
    int compare= Math.max(nums[0],nums[mid]);
    return Math.max(compare,nums[nums.length-1]);
    }

    ReplyDelete
  7. int hiValue = 0;

    int [] Arr = {nums[0], nums[nums.length/2], nums[nums.length-1]};

    for(int i = 0; i < Arr.length; i++)
    if(hiValue < Arr[i])
    hiValue = Arr[i];

    return hiValue;

    ReplyDelete
  8. int first = nums[0];//first
    int middle = nums[nums.length/2];//middle
    int last = nums[nums.length-1];//last

    return (first>middle && first>last) ? (first) : (Math.max(middle, last));

    ReplyDelete
  9. Easier to follow :) :
    public int maxTriple(int[] nums) {
    int first = nums[0];
    int middle = nums[nums.length/2];
    int end = nums[nums.length-1];

    int a = Math.max(first, middle);
    int b = Math.max(a, end);

    return Math.max(a,b);

    }

    ReplyDelete

Follow Me

If you like our content, feel free to follow me to stay updated.

Subscribe

Enter your email address:

We hate spam as much as you do.

Upload Material

Got an exam, project, tutorial video, exercise, solutions, unsolved problem, question, solution manual? We are open to any coding material. Why not upload?

Upload

Copyright © 2012 - 2014 Java Problems  --  About  --  Attribution  --  Privacy Policy  --  Terms of Use  --  Contact