用递归算法实现,数组长度为5且元素的随机数在2-32间不重复的值 let arr = new Array(5), n = 0 function arrValue(){ let value = parseInt(2 + Math.floor(Math.random() * 30)) !arr.includes(value) && (arr[n] = value) && n++ n < arr.length && arrValue() } arrValue() console.log(arr)