第 161 题：用最精炼的代码实现数组非零非负最小值 index

[greatInvoker]

const arr = [10, 21, 0, -7, 35, 7, 9, 23, 18];

function getIndex(arr) {
	let min = Infinity;
	arr.forEach((v) => {
		v > 0 && v < min && (min = v);
	});
	return arr.indexOf(min);
}

console.log(getIndex(arr));

[netRuby]

const arr = [10, 21, 0, -7, 35, 7, 9, 23, 18];

arr.reduce((pre,cur,index)=>{
return cur>0&cur<pre.val ? {i:index,val:cur} : pre
},{i:-1,val:Infinity})

[Dylan0916]

const ary = [10, 21, 0, -7, 35, 7, 9, 23, 18];

function getIndex(ary) {
  const result = ary.reduce(
    (acc, cur, index) =>
      acc.value > cur && cur > 0 ? { value: cur, index } : acc,
    { value: Infinity, index: -1 }
  );

  return result.index;
}