明明生成了个1到500之间的随机整数。请你删去其中重复的数字,即相同的数字只保留一个,把其余相同的数去掉,然后再把这些数从小到大排序,按照排好的顺序输出。
数据范围: ,输入的数字大小满足
明明生成了个1到500之间的随机整数。请你删去其中重复的数字,即相同的数字只保留一个,把其余相同的数去掉,然后再把这些数从小到大排序,按照排好的顺序输出。
第一行先输入随机整数的个数 N 。 接下来的 N 行每行输入一个整数,代表明明生成的随机数。 具体格式可以参考下面的"示例"。
输出多行,表示输入数据处理后的结果
3 2 2 1
1 2
输入解释: 第一个数字是3,也即这个小样例的N=3,说明用计算机生成了3个1到500之间的随机整数,接下来每行一个随机数字,共3行,也即这3个随机数字为: 2 2 1 所以样例的输出为: 1 2
let readline = require("readline"); let r = readline.createInterface({ input: process.stdin, output: process.stdout, }); // 手写一个堆 class Heap { constructor() { this.data = []; this.cnt = 0; } // 指定大顶堆 的比较方式 compare(a, b) { return this.data[a] > this.data[b]; } swap(a, b) { let tmp = this.data[a]; this.data[a] = this.data[b]; this.data[b] = tmp; } // 向上调整 push(x) { let ind = this.cnt; this.data[this.cnt++] = x; while (ind && this.compare(ind - 1 >> 1, ind)) { this.swap(ind - 1 >> 1, ind); ind = (ind - 1) >> 1; } } // 向下调整 pop() { let top = this.data[0] this.data[0] = this.data.pop() this.cnt-- let n = this.cnt-1,ind = 0,tmp = ind while(ind*2+1<=n){ if(this.compare(ind,ind*2+1)) tmp = ind*2+1 if(ind*2+2<=n && this.compare(tmp,ind*2+2)) tmp = ind*2+2 if(ind==tmp) break this.swap(ind,tmp) ind = tmp } return top } size(){ return this.cnt } } let arr = []; r.on("line", (line) => { arr.push(Number(line)); if (arr.length > arr[0]) { let h = new Heap() let ret = [] for(let i=1;i<arr.length;i++) h.push(arr[i]) while(h.size()) ret.push(h.pop()) let m={} for(let x of ret){ if(x in m) continue m[x] = 1 console.log(x) } } });
const readline = require('readline') var rl = readline.createInterface({ input: process.stdin, output: process.stdout }) var result = [] var arr = [] var lineNum = 0 var num = 0 rl.on('line', (line) => { var flag = true // 此时重置 if (num == lineNum) { num = 0 lineNum = parseInt(line) if(arr.length > 0){ result.push(arr) arr = [] } flag = false } // 此时将数据push进数组 if ((num < lineNum) && flag) { num++ if (arr.indexOf(line) < 0) { arr.push(line) } } }) rl.on('close', () => { result.push(arr) result.forEach((res)=>{ res.sort(sortNumber) res.forEach((val) => { console.log(parseInt(val)) }) }) }) function sortNumber(a, b) { return a - b }
const readline = require('readline') const rl = readline.createInterface({ input: process.stdin, output: process.stdout }) var inputArr = [] rl.on('line', function (input) { inputArr.push(input) var len = +inputArr[0] if (inputArr.length === len + 1) { var part = inputArr.slice(1, inputArr.length + 1) // 去重 var res = part.reduce( (pre, cur) => { if (!pre.includes(cur)) { pre.push(cur) } return pre }, []) // 升序,换行输出 var result = res.sort( (a,b) => a - b).join('\n') console.log(result) // 清空上一个列子内容 inputArr = [] res = [] } });
var readline = require('readline') var rl = readline.createInterface({ input: process.stdin, output: process.stdout }) var inputY = 0 let params = [] let object = {} rl.on('line', (line) => { if(inputY == 0){ inputY = parseInt(line) }else{ params.push(line) if(params.length == inputY) { let list_1 = Array.from(new Set(params)) let list_2 = list_1.sort((a,b) => {return a - b}) for(let a of list_2){ console.log(a) } inputY = 0 params = [] } } })
while(len = parseInt(readline(), 10)) { const buffer = Array(len).fill(0).map(() => parseInt(readline(), 10)); console.log([...new Set(buffer.sort((a, b) => a - b))].join('\n')) }
while(line=readline()){ var num=parseInt(line) var arr=[] while(num-->0){ arr.push(parseInt(readline())) } var set=new Set(arr) arr=Array.from(set).sort((a,b)=>a-b) for(var i=0;i<arr.length;i++){ console.log(arr[i]) } }
// 自测没问题,保存并提交就出问题了,牛客你为什么这么烂!!!! const listNum = []; var data = ''; var size = 0; while(data = readline()){ if (size === 0) { size = data } else { size--; listNum.push(data); } } const sortList = listNum.sort((a, b) => a - b); console.log(sortList .filter((item, index) => item !== sortList[index + 1]) .join('\n')) // 自测没问题,保存并提交就出问题了,牛客你为什么这么烂!!!!
var flag = 0 var result = new Array(); var count =0 while (line = readline()){ if(flag==0){ count=parseInt(line) }else{ if(!result.includes(parseInt(line))){ result.push(parseInt(line)) } } flag++ if(flag-1==count){ flag=0 } } result.sort(function(a,b){return a-b}) result.forEach((item)=>{ console.log(item) })
const readline = require("readline"); const rl = readline.createInterface({ input: process.stdin, output: process.stdout }) let flag = true; let datas = new Array(); let len = 0; rl.on("line", function (line) { if (flag === true) { flag = false; datas = new Array(); len = parseInt(line); } else { let d = parseInt(line); datas.push(d); if (datas.length === len) { datas = Array.from(new Set(datas)); console.log(datas.sort((a, b) => a -b).join("\n")) flag = true; } } })
const readline = require('readline') const read = readline.createInterface({ input: process.stdin, output: process.stdout }) let dataSet = null let startFlag = true read.on('line', (line) =>{ // 读到起始位置,设置count数 if (startFlag === true) { startFlag = parseInt(line) dataSet = new Set() } else { dataSet.add(line) startFlag-- if (startFlag === 0) { // 读到最后一个 startFlag = true Array.from(dataSet).sort((that, next) => that - next).forEach(item => console.log(item)) dataSet = null } } })
// var readStr=1; // var num=0; // var arr=[]; // while(readStr){ // readStr = parseInt(readline()) // if(num == 0){ // num = readStr; // }else{ // num--; // arr.push(readStr) // } // } // arr.sort(function(a,b){return a-b}); // for(var i=0;i<arr.length;i++){ // if(arr[i] == arr[i-1]){ // arr.splice(i,1) // i-- // } // } // console.log(arr.join('\n')) // 正解如下 while(readNum = readline()){ var arr=[]; for(var i=0;i<readNum;i++){ arr.push(parseInt(readline())) } arr.sort(function(a,b){return a-b}); for(var i=0;i<arr.length;i++){ if(arr[i] == arr[i-1]){ arr.splice(i,1) i-- } } console.log(arr.join('\n')) }