Skip to main content

javascrip Copy each element of the first array into the second array with second array unchanged

 You are given two arrays and an index.

Copy each element of the first array into the second array, in order.

Begin inserting elements at index n of the second array.

Return the resulting array. The input arrays should remain the same after the function runs.


给你两个数组和一个索引。


按顺序将第一个数组的每个元素复制到第二个数组中。


开始在第二个数组的索引 n 处插入元素。


返回结果数组。 函数运行后,输入数组应保持不变。


这个题目的难点在于输入数组不能改变,所以需要创建第三个数组,把输入数组深度拷贝过去。


function frankenSplice(arr1arr2n) {
  var newarr = [];
  for (let j = 0;j<arr2.length;j++)
  {
    newarr.push(arr2[j]);
  }
  for (let i=arr1.length-1;i>=0;i--)
  {
    newarr.splice(n,0,arr1[i]);
  }
  console.log(newarr);
  return newarr;
}

frankenSplice([123], [456], 1);

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 );