Problem:
Given an array of ints of even length, return a new array length 2 containing the middle two elements from the original array. The original array will be length 2 or more.
makeMiddle({1, 2, 3, 4}) → {2, 3}
makeMiddle({7, 1, 2, 3, 4, 9}) → {2, 3}
makeMiddle({1, 2}) → {1, 2}
makeMiddle({1, 2, 3, 4}) → {2, 3}
makeMiddle({7, 1, 2, 3, 4, 9}) → {2, 3}
makeMiddle({1, 2}) → {1, 2}
Solution:
public int[] makeMiddle(int[] nums) {
int[] myArray = new int[2];
int middle = nums.length / 2;
myArray[0] = nums[middle - 1];
myArray[1] = nums[middle];
return myArray;
}
public int[] makeMiddle(int[] nums) {
ReplyDeleteint sum=((nums.length/2));
int diff=((nums.length/2)-1);
int[] arr=new int[]{nums[diff], nums[sum]};
return arr;
}