cpt-waffle-lotide
Version:
LoTide in Typescript
22 lines (20 loc) • 634 B
text/typescript
const middle = (array:any[]):any[] => {
if (!array || array.length <= 2) {
return [];
}
if (array.length % 2) {
const mid:number = Math.floor(array.length / 2);
return [array[mid]];
} else {
const mid1:number = array.length / 2 - 1;
const mid2:number = array.length / 2;
return [array[mid1], array[mid2]];
}
}
export default middle;
// assertArrayEqual(middle([1]), []);
// assertArrayEqual(middle([1, 2]), []);
// assertArrayEqual(middle([1, 2, 3]), [2]);
// assertArrayEqual(middle([1, 2, 3, 4, 5]), [3]);
// assertArrayEqual(middle([1, 2, 3, 4]), [2, 3]);
// assertArrayEqual(middle([1, 2, 3, 4, 5, 6]), [3,4]);