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

Low risk, high reward: the asymmetric black swan trade

Cornwall Capital was founded in 2003 by two young people who were not in the mainstream - Charlie Ledley, and Gammy Mak. I say they were out of the mainstream because they were not financial professionals from a scientific background, but they were full of imagination, and a keen insight into the market. Their insight is evident in the transactions of First Capital Financial. Case Background Before betting that the subprime mortgage market would collapse, Cornwall Capital first noticed a credit card business company, First Capital Financial. Throughout the 1990s and early 2000s, First Capital Financial claimed that it had better tools than other firms for analyzing the creditworthiness of subprime credit card users and pricing the risk of lending to them, and the market bought that claim. But in July 2002, First Capital Financial's stock fell 60% in two days after the company voluntarily disclosed a disagreement between them and two government regulators: How much capital did they ...

javascript Mutations

 Return true if the string in the first element of the array contains all of the letters of the string in the second element of the array. For example, ["hello", "Hello"], should return true because all of the letters in the second string are present in the first, ignoring case. The arguments ["hello", "hey"] should return false because the string hello does not contain a y. Lastly, ["Alien", "line"], should return true because all of the letters in line are present in Alien. function   mutation ( arr ) {    var   temArr  =[];    for ( let   i = 0 ; i < arr [ 1 ]. length ; i ++) //要比较的是第二个数组的,所以放在外层,内层每次都要遍历第一个数组,让第二个数组中的字符去与每一个第一个数组中的字符比较,相等就push一个true,然后马上跳出内循环   {      for  ( let   j = 0 ; j < arr [ 0 ]. length ; j ++)     {        if  ( arr [ 1 ][ i ]. toUpperCase ()== arr [ 0 ][ j ]. toUpperCase ())      ...

盘点类似河北的儿童杀人案,是如何判决的