查找数组中最长的字符串

Question

有没有一种简短的方法可以找到字符串数组中最长的字符串？

有点像arr.Max(x => x.Length);？

Answer 1

var longest = arr.sort(function (a, b) { return b.length - a.length; })[0];

可能效率更高,但仅在Javascript 1.8/ECMAScript 5中可用,并且在旧版浏览器中默认不可用:

var longest = arr.reduce(function (a, b) { return a.length > b.length ? a : b; });

Answer 2

对旧问题的新答案:在ES6中,您可以做得更短:

Math.max(...(x.map(el => el.length)));

Answer 3

我会做这样的事情

var arr = ['first item', 'second item is longer than the third one', 
           'third longish item'];

var lgth = 0;
var longest;

for(var i=0; i < arr.length; i++){
    if(arr[i].length > lgth){
        var lgth = arr[i].length;
        longest = arr[i];
    }      
} 

alert(longest);

http://jsfiddle.net/jasongennaro/MLqLq/

Answer 4

reduce()在 ES6 中，这可以通过复杂的调用来完成O(n)，而不是使用sort()以下解决方案O(nlogn)：

const getLongestText = (arr) => arr.reduce(
  (savedText, text) => (text.length > savedText.length ? text : savedText),
  '',
);

console.log(getLongestText(['word', 'even-longer-word', 'long-word']))

Answer 5

var arr = [ 'fdgdfgdfg', 'gdfgf', 'gdfgdfhawsdgd', 'gdf', 'gdfhdfhjurvweadsd' ];
arr.sort(function (a, b) { return b.length - a.length })[0];

Answer 6

也许不是最快的，但肯定非常可读：

function findLongestWord(array) {
  var longestWord = "";

  array.forEach(function(word) {
    if(word.length > longestWord.length) {
      longestWord = word;
    }
  });

  return longestWord;
}

var word = findLongestWord(["The","quick","brown", "fox", "jumped", "over", "the", "lazy", "dog"]);
console.log(word); // result is "jumped"

从 IE9+ 开始支持数组函数forEach。