本文共 536 字,大约阅读时间需要 1 分钟。
function findKthPositive(arr, k){ let len0 = arr.length; let len1 = arr[len0 - 1] ; let arr1 = []; for(let i = 0; i < len1; i++){ arr1[i] = i + 1; } let arr2 = arr1.filter(el => !arr.includes(el)); if(arr2[k - 1]){ return arr2[k - 1]; }else{ return arr[len0 - 1] - arr2.length + k; }}var arr = [1, 13, 18];var k = 17;var a = findKthPositive(arr, k);
var findKthPositive = function (arr, k) { let num = 1 while (k > 0) { if (arr.indexOf(num) == -1) k-- if(k!=0)num++ } return num }
转载地址:http://hqtzi.baihongyu.com/