這是在一次采訪中問(wèn)我的問(wèn)題，通過(guò)制作一個(gè)函數(shù)來(lái)找出通用字符串，如果有更好的解決方案，他讓我用 ES6 來(lái)做，那么請(qǐng)幫助我以更好和更短的方式解決它。如果字符串是通用字符串，此函數(shù)將返回 true，否則將返回 falseconst universalString = (string) => {  string = string.replace(/ /g, '').toLowerCase();  let cherecterLenData = [];  // array of alphabets  let alphabetData = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"];  // filter with array of alphabets  alphabetData.filter((charecter, charecterIndex) => {    if (string.indexOf(charecter) != -1) {      `check if the character present in a -given string`      // No. of times a character present in a string       let stringCherecterLen = string.split(charecter).length - 1;      if (stringCherecterLen != 0) {        cherecterLenData.push(stringCherecterLen);      }    }  });  if (cherecterLenData.every((val, i, arr) => val === arr[0])) {    return true;  }  return false;}console.log(universalString("Hello Rajat Srivastava How Are You"));console.log(universalString("aabbcchh llkkuudd"));console.log(universalString("abbabcbdbabdbdbabababcbcbab")); // falseconsole.log(universalString("aaccbbddffee")); // true