我需要在陣列（字串）中找到第 k 個最大的元素并根據排名回傳它們。
例子 -
輸入
var array = ['java','python','javascript','C','Swift','Dart'];
預期產出
[['javascript', 1],
['python', 2],
['Swift', 3],
['java', 4],
['Dart', 4],
['C', 5]]
我試過這個 -
var rank = 0
var result = []
var arr = ['java','python','javascript','C','Swift','Dart'];
arr.sort((a,b)=>b.length-a.length);
for(let i=0;i<arr.length;i ){
if(arr[i 1]===undefined){
break;
}
else if (arr[i].length>arr[i 1].length){
rank}
result.push([arr[i],rank])
}
console.log(JSON.stringify(result))但正如你所看到的，它確實有效。我該如何處理？請給一點幫助。
uj5u.com熱心網友回復：
const arr = ['java','python','javascript','C','Swift','Dart'];
arr.sort((a, b) => b.length - a.length)
const res = arr.reduce((acc, el) => {acc.push([el, acc.length == 0 ? 1 : el.length == acc[acc.length-1][0].length ? acc[acc.length-1][1] : acc[acc.length-1][1] 1]); return acc}, [])
console.log(JSON.stringify(res))如果您想按照自己的方式進行操作，可以執行以下操作：
let rank = 1
const arr = ['java','python','javascript','C','Swift','Dart'];
arr.sort((a,b)=>b.length-a.length);
const result = [[arr[0], 1]]
for(let i=1;i<arr.length;i ){
if (arr[i].length<arr[i-1].length){
rank}
result.push([arr[i],rank])
}
console.log(JSON.stringify(result))
uj5u.com熱心網友回復：
您可以利用物件屬性按索引值的順序迭代的事實：
const array = ['java','python','javascript','C','Swift','Dart'];
const buckets = Object.fromEntries(array.map(a => [a.length, []]));
for (let word of array) buckets[word.length].push(word);
const result = Object.values(buckets)
.reverse()
.map((bucket, rank) => bucket.map(word => [rank 1, word]))
.flat();
console.log(result);轉載請註明出處，本文鏈接：https://www.uj5u.com/gongcheng/374294.html
標籤：javascript 算法