Problem:
Given an array of ints of odd length, return a new array length 3 containing the elements from the middle of the array. The array length will be at least 3.
midThree({1, 2, 3, 4, 5}) → {2, 3, 4}
midThree({8, 6, 7, 5, 3, 0, 9}) → {7, 5, 3}
midThree({1, 2, 3}) → {1, 2, 3}
Solution:
public int[] midThree(int[] nums) {
return new int[] {
nums[(nums.length+1)/2 -2],
nums[(nums.length+1)/2 -1],
nums[(nums.length+1)/2]};
}
public int[] midThree(int[] nums) {
ReplyDeleteint nn[] = {nums[nums.length/2-1], nums[nums.length/2], nums[nums.length/2+1 ]};
return nn;
public int[] midThree(int[] nums) {
ReplyDeleteint[] newArr = new int[3];
if(nums.length==3)
return nums;
else
newArr[0]=nums[nums.length/2-1];
newArr[1]=nums[nums.length/2];
newArr[2]=nums[nums.length/2+1];
return newArr;
}