Skip to main content

javascript Find the Longest Word in a String

 Return the length of the longest word in the provided sentence.

Your response should be a number.


思路:先把句子转化为单词数组,然后创建一个变量,并赋初值为0,让这个变量与每个单词的长度进行比较,如果这个变量小于等于这个单词长度,则将这个变量更新为单词的长度。在一个for循环中比较下去,就可以得到最长的单词的长度。


function findLongestWordLength(str) {
  var strarr = str.split(" ");//用空格进行分割.
  var longest = 0;//记录并更新每两个比较
  console.log(strarr);

  for(let i=0;i<strarr.length;i++){
    if (longest<=strarr[i].length)
    {
      longest = strarr[i].length;
    }

  }
  console.log(longest);
  return longest;
}

findLongestWordLength("The quick brown fox jumped over the lazy dog");




Comments

Popular posts from this blog

span[class~="sr-only"]

  The  span[class~="sr-only"]  selector will select any  span  element whose  class   includes   sr-only . Create that selector, and give it a  border  property set to  0 . span [ class ~= "sr-only" ] {    border:   0 ; }

An Australian Pelican feast that lasted more than two decades

Why are you so focused? It turned out that the pelicans were all waiting to eat fish with their heads up, hahahaha! In the Central Coast area north of Sydney, there is a beautiful and famous town called The Entrance, which has the title of "Australian Pelican Capital". What makes a town so honored? The reason is these cute toucans. Every afternoon, the pelicans fly here from near and far, and there are no obstacles 365 days a year. As soon as 3:30, a staff member will push a large box full of fish to the small square where the pelicans gather, and the pelicans have long been eager to wait. This white-haired grandpa came to feed today. I saw the grandfather skillfully put on rubber gloves, while taking a fish out of the box and throwing it at the pelican, he interacted with the onlookers and introduced the knowledge of the pelican. The noise of the pelicans competing for the fish and the exclamation of the onlookers crowded into one, the atmosphere was warm. A clever pelican s...

正则表达式匹配空格\s和特定次数

  let   ohStr  =  "Ohhh no" ; let   ohRegex  =  /Oh{3,6}\sno/ ig ;  let   result  =  ohRegex . test ( ohStr ); {3,6}表示匹配3到6次,包含3,6. {3, )表示最少3次,无上限 { ,8}表示最多8次,无下限 {3}匹配特定次数,这里表示只匹配3次的。 后面跟一个?,表示这个字母可能会出现,也可能不出现。如/colou?r/既能匹配英式英语的colour,也能匹配美式英语的color 在 pwRegex 中使用前瞻来匹配长度大于 5 个字符且具有两个连续数字的密码。 let   sampleWord  =  "astronaut" ; let   pwRegex  =  /(?=\w{6})(?=\w*\d{2})/ gi ;  let   result  =  pwRegex . test ( sampleWord );