Skip to main content

javascript Return an array consisting of the largest number

 Return an array consisting of the largest number . 

题目:

返回一个数组,该数组由每个提供的子数组中的最大数组成。 

比如:

arraysInArray = [[4513], [13271826], [32353739], [100010018571]]
我的思路是:
外圈一个大的for循环对大数组中的小数组遍历,内部一个for循环对每个小数组的每个元素进行遍历,用一个变量存储最大的值,用另一个变量记录最大的值所在的小数组在大数组
中的index,最后返回这个arr[index],也就是一个小数组。

function largestOfFour(arr) {
  let largestNum = 0;//存储最大数
  let index = 0;//存储最大数所在的array的序号
  for (let i=0;i<arr.length;i++)//数组中的数组
  {
    for(let j=0;j<arr[i].length;j++)//对每个小数组进行循环判断
    {
      if (largestNum<=arr[i][j])
      {
        largestNum = arr[i][j];
        index = i;//每次更新index为最大值所在的小数组的index
      }

    }
  }
  return arr[index];
}
console.log(largestOfFour([[4513], [13271826], [32353739], [100010018571]]))
largestOfFour([[4513], [13271826], [32353739], [100010018571]]);

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 ...

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

正则表达式匹配空格\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 );