京东2017秋招 集合题 js实现

2017秋招京东集合题目 javascript实现

var arr1size,array2size;
while((arr1size=readInt())!==undefined&&(M=readInt())!==undefined){
        var list1 = read_line()
        var list2 =read_line()
        let result =[]
        let result2 =[]
         result =list1.split(" ")
        result2 =list2.split(" ")
        let array = []
        for(let i =0;i<result.length;i++){
            array.push(Number(result[i]))
        }
        for(let i =0;i<result2.length;i++){
             array.push(Number(result2[i]))     
        }
        var min;
        for(var i=0; i<array.length; i++){
          for(var j=i; j<array.length;j++){
            if(array[i]>array[j]){
              min=array[j];
              array[j]=array[i];
              array[i]=min;
            }
          }
        }
      var newArray = []
        for(let k =0;k<array.length;k++){
            if(newArray.indexOf(array[k]) == -1){
                newArray.push(array[k])
            }
        }
      var last = newArray.join(" ")
        print(last)

}

只是AC了40%,不造哪里错了

看了一段写得很好的代码：

let input
while((input = read_line())) {
  let a = input.split(' ')[0]
  let b = input.split(' ')[1]
  let setAUB = new Set()

  for (let i = 0; i < a + b; i++) {
    let num = readInt()

    if (!setAUB.has(num)) {
      setAUB.add(num)
    }
  }

  print([...setAUB].sort((a, b) => a - b).join(' '))
}