按大多数出现的某些字母对数组排序

Question

I have an array of words and the following list of letters:

searoiltnudcypmhgbkfwvzxjq

I would like to sort the array by the letter order in this list, so that the word with the most amount of letters near the start of the list appears first. For example: the following:

var wordList = "nymph, races, tundra"; 

Once sorted, should be:

wordList = "races, tundra, nymph"; 

So far I have the following to assign a weight to each letter in the list:

  for (let h = 0; h < freqWords.length; h++) {
     this["freq" + h] = h; 
  }

Next I have to give each word in the array a value based on how many of these vars it contains and then sort the way from lowest value to highest value. Unfortunately, I'm not aware of the syntax to accomplish this.

Answer 1

A shorter declarative functional-style alternative:

const letters = 'searoiltnudcypmhgbkfwvzxjq';
const input = "nymph, races, tundra"
const sorted = input.split(',').map(str => str.trim()).sort((aWord, bWord) => {

    const aCount = aWord.split('').filter(char => letters.includes(char)).length;
    const bCount = bWord.split('').filter(char => letters.includes(char)).length;

    return bCount - aCount;

});

Answer 2

First off, it'll be a lot easier if you convert your letter list into an array and if you convert your word list to an array as well. Then, you're going to need to write a comparator function for Array.prototype.sort which counts the number of letters a supplied word has in a supplied array of letters. Here's an implementation that solves your problem:

const letters = [
  's', 'e', 'a', 'r', 'o', 'i', 'l', 't', 'n', 
  'u', 'd', 'c', 'y', 'p', 'm', 'h', 'g', 'b', 
  'k', 'f', 'w', 'v', 'z', 'x', 'j', 'q'
];

const wordList = [
  'nymph', 
  'races', 
  'tundra'  
];

console.log(wordList);

const sortedList = wordList.sort((a, b) => {
  const aOccurences = letterOccurences(letters, a);
  const bOccurences = letterOccurences(letters, b);
  return aOccurences - bOccurences;
});

console.log(sortedList);

function letterOccurences(letters, word) {
  let occurences = 0;
  for (let i = 0; i < word.length; i++) {
    if (letters.includes(word.substring(i, i+1))) {
        occurences++;
    }
  }
  return occurences;
}

Input list: nymph, races, tundra

Result: tundra, nymph, races (6, 5, and 5 occurrences respectively.)

EDIT: If you need me to explain anything or if any of the syntax is unfamiliar, let me know.