题解 | #数据分类处理#
数据分类处理
http://www.nowcoder.com/practice/9a763ed59c7243bd8ab706b2da52b7fd
var strI = readline();
var strR = readline();
var listI = strI.split(" ");
var listR = strR.split(" ");
var iCount = listI[0];
var rCount = listR[0];
var dealListI = listI.slice(1);
var dealListR = listR.slice(1);
var result = {};
var resultList = [];
dealListR.sort((a,b)=>{return Number(a)-Number(b)});
var unquireR = [];
dealListR.forEach((info)=>{
if(unquireR.indexOf(info) === -1){
unquireR.push(info);
}
});
unquireR.forEach((cell,i)=>{
dealListI.forEach((item,j)=>{
if(item.indexOf(cell) > -1){
if(!result[cell]){
result[cell] = [];
result[cell].push({key:j,value:item});
}else{
result[cell].push({key:j,value:item});
}
}
});
})
for(let key in result){
resultList.push(key);
resultList.push(result[key].length);
for(let i=0;i<result[key].length;i++){
resultList.push(result[key][i].key);
resultList.push(result[key][i].value);
}
}
resultList.unshift(resultList.length);
console.log(resultList.join(" "));
var strR = readline();
var listI = strI.split(" ");
var listR = strR.split(" ");
var iCount = listI[0];
var rCount = listR[0];
var dealListI = listI.slice(1);
var dealListR = listR.slice(1);
var result = {};
var resultList = [];
dealListR.sort((a,b)=>{return Number(a)-Number(b)});
var unquireR = [];
dealListR.forEach((info)=>{
if(unquireR.indexOf(info) === -1){
unquireR.push(info);
}
});
unquireR.forEach((cell,i)=>{
dealListI.forEach((item,j)=>{
if(item.indexOf(cell) > -1){
if(!result[cell]){
result[cell] = [];
result[cell].push({key:j,value:item});
}else{
result[cell].push({key:j,value:item});
}
}
});
})
for(let key in result){
resultList.push(key);
resultList.push(result[key].length);
for(let i=0;i<result[key].length;i++){
resultList.push(result[key][i].key);
resultList.push(result[key][i].value);
}
}
resultList.unshift(resultList.length);
console.log(resultList.join(" "));