第 11 题：将数组扁平化并去除其中重复数据，最终得到一个升序且不重复的数组 #8

zpzxgcr · 2019-02-12T00:58:14Z

Array.from(new Set(arr.flat(Infinity))).sort((a,b)=>{ return a-b})

The text was updated successfully, but these errors were encountered:

zpzxgcr · 2019-02-12T01:02:07Z

zpzxgcr · 2019-02-12T01:03:54Z

相关知识点

hejiaqian · 2019-02-12T01:44:45Z

arr.toString().split(",").sort((a,b)=>{ return a-b})

hejiaqian · 2019-02-12T01:45:41Z

zpzxgcr · 2019-02-12T01:50:13Z

arr.toString（）。split（“，”）。sort（（a，b）=> {return ab}）

你可能后面需要 arr.toString().split(",").sort((a,b)=>{ return a-b}).map(Number)
不然数组元素都是字符串结果并没有去重还有两个2 5和12

hejiaqian · 2019-02-12T01:53:39Z

arr.toString（）。split（“，”）。sort（（a，b）=> {return ab}）

你可能后面需要 arr.toString().split(",").sort((a,b)=>{ return a-b}).map(Number)
不然数组元素都是字符串

谢谢大佬指点，学习了

cjfff · 2019-02-12T01:59:00Z

Array.prototype.flat= function() {
    return [].concat(...this.map(item => (Array.isArray(item) ? item.flat() : [item])));
}

Array.prototype.unique = function() {
    return [...new Set(this)]
}

const sort = (a, b) => a - b;

console.log(arr.flat().unique().sort(sort)); // [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 ]

AprilTong · 2019-02-12T02:00:21Z

var arr = [ [1, 2, 2], [3, 4, 5, 5], [6, 7, 8, 9, [11, 12, [12, 13, [14] ] ] ], 10];
function flatten(arr) {

    while (arr.some(item => Array.isArray(item))) {
        arr = [].concat(...arr);
    }

    return arr;
}
Array.from(new Set(flatten(arr))).sort((a, b) => {
 return a - b
})

zpzxgcr · 2019-02-12T02:00:50Z

Array.prototype.falt = function() {
    return [].concat(...this.map(item => (Array.isArray(item) ? item.falt() : [item])));
}

Array.prototype.unique = function() {
    return [...new Set(this)]
}

const sort = (a, b) => a - b;

console.log(arr.falt().unique().sort(sort)); // [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 ]

函数名应该是flat

cjfff · 2019-02-12T02:01:54Z

Array.prototype.falt = function() {
    return [].concat(...this.map(item => (Array.isArray(item) ? item.falt() : [item])));
}

Array.prototype.unique = function() {
    return [...new Set(this)]
}

const sort = (a, b) => a - b;

console.log(arr.falt().unique().sort(sort)); // [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 ]

函数名应该是flat

-感谢斧正

w587 · 2019-02-12T02:42:49Z

var old_arr=[ [1, 2, 2], [3, 4, 5, 5], [6, 7, 8, 9, [11, 12, [12, 13, [14] ] ] ], 10];
		
// 数组拍平
var level_arr=old_arr.flat(4);

//数组去重
var Distinct=Array.from(new Set(level_arr));

// 排序
var sort=  Distinct.sort((a, b) =>a - b)

console.log("new arr",sort)

jackchenl · 2019-02-13T06:06:52Z

递归函数解法：

function spreadArr(arr=[]){
	if(arr.some(ele=>Array.isArray(ele))){
		let newArr = [];
		arr.forEach((ele) => {
			if(Array.isArray(ele)){
				newArr = newArr.concat(...ele)
			}else{
				if(!newArr.includes(ele)) newArr.push(ele)
			}
		})
		return spreadArr(newArr);
	}
	return arr.sort((a,b)=> a-b);
}
spreadArr([ [1, 2, 2], [3, 4, 5, 5], [6, 7, 8, 9, [11, 12, [12, 13, [14] ] ] ], 10]);

zhuzhuoxingguang · 2019-02-14T01:02:22Z

利用前面的答案，修正一个没用ES6的写法：

// 1、扁平化数组
var flatArr = arr.toString().split(",");
// 2、去重
var hash = {};
for (var i = 0, len = flatArr.length; i < len; i++) {
hash[flatArr[i]] = "abc"
}
flatArr = [];
// 3、将元素字符串转化为数字、遍历hash并不能保证输出顺序
for (var i in hash) {
flatArr.push(+i)
}
// 4、排序
flatArr = flatArr.sort(function(a, b) {
return a - b
})
console.log(flatArr)

sisterAn · 2019-02-16T09:18:58Z

看一道面试题：

已知如下数组：var arr = [ [1, 2, 2], [3, 4, 5, 5], [6, 7, 8, 9, [11, 12, [12, 13, [14] ] ] ], 10];

编写一个程序将数组扁平化去并除其中重复部分数据，最终得到一个升序且不重复的数组

答案：

var arr = [ [1, 2, 2], [3, 4, 5, 5], [6, 7, 8, 9, [11, 12, [12, 13, [14] ] ] ], 10]
// 扁平化
let flatArr = arr.flat(4)
// 去重
let disArr = Array.from(new Set(flatArr))
// 排序
let result = disArr.sort(function(a, b) {
    return a-b
})
console.log(result)
// [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14]

关于 Set 请查阅 Set、WeakSet、Map及WeakMap

本文首发于我的博客：数组扁平化、去重、排序

xiaoluoboding · 2019-02-18T02:07:54Z

[...new Set(String(arr).split(','))].sort((a, b) => a - b).map(Number)

wangweianger · 2019-02-18T02:23:54Z

[...new Set(arr.toString().split(','))].sort((a,b)=>a-b)

Allen3039 · 2019-02-18T12:36:37Z

额虽然没大佬们厉害，暂且做个记录吧

function flap(arr){
  if([].every.call(arr,item=>!Array.isArray(item))){
    return arr; 
  }
  return [].reduce.call(arr,(pre,cur)=>{
    if(Array.isArray(cur)){
      return [].concat(pre,flap(cur));
    }else{
      return [].concat(pre,cur);
    }
  },[])
}

function removeRepeat(arr){
  return [...new Set(arr)];
}

function sort(arr){
  return [].sort.call(arr,(a,b)=>a-b)
}

function handle(data,...fns){
  return fns.reduce((pre,cur)=>{
      return cur(pre);
  },data)
}

handle(arr,flap,sort,removeRepeat);

xpbsm · 2019-02-18T15:07:32Z

arr.join(','),split(','),sort((a,b) => a - b)

mydaoyuan · 2019-02-19T01:11:59Z

拍平： const deepFlatten = arr => [].concat(...arr.map(v => (Array.isArray(v) ? deepFlatten(v) : v)));
用toString会改变数组里面的原始数据，应该会是扣分项。

ihuoge · 2019-02-19T02:48:52Z

Jason686 · 2019-02-19T06:30:33Z

Array.from(new Set(arr.toString().split(',').map(Number))).sort((a, b) => (a-b))

hellojackhui · 2019-02-19T06:54:48Z

拍平数组：const flatArray = arr => arr.reduce((a,b) => a.concat(Array.isArray(b) ? flatArray(b): b), []);
去重+排序: [...new Set(flatArray)].sort((a,b) => a-b);

fan-2 · 2019-02-19T07:05:50Z

yishuihan-001 · 2019-02-19T07:30:16Z

var arr = [...new Set(arr.join(',').split(','))].map(v => Number(v)).sort((a,b) => a-b)

xiaochen111 · 2019-02-20T02:53:20Z

var arr = [ [1, 2, 2], [3, 4, 5, 5], [6, 7, 8, 9, [11, 12, [12, 13, [14] ] ] ], 10];

  var obj = {};
  function arrDef(arr) {
      if(arr instanceof Array){
        arrforDef(arr)
      }else {
        obj[arr] = 1;
      }
  }

  function arrforDef(arr){
    arr.forEach( function(element, index) {
       arrDef(element)
    });
  }

 
  arrDef(arr);
  console.log(Object.keys(obj))

mySouler · 2019-02-20T07:16:00Z

var arr = [...new Set(arr.toString().split(',').map(Number).sort((a,b)=>a-b))]

Liubasara · 2019-02-20T09:15:44Z

const arr = [ [1, 2, 2], [3, 4, 5, 5], [6, 7, 8, 9, [11, 12, [12, 13, [14] ] ] ], 10]

function flat (arr) {
  function toFlat (acc, current) {
    if (Object.prototype.toString.call(current) === '[object Array]') {
      current.forEach(item => {
        toFlat(acc, item)
      })
    } else {
      if (!acc.includes(current)) {
        acc.push(current)
      }
    }
    return acc
  }
  return arr.reduce(toFlat, []).sort((value1, value2) => value1 - value2)
}

flat(arr)

利用Array.prototype.reduce函数递归进行函数拍平去重加排序。这个咋样？

weiweixuan · 2019-02-20T09:28:15Z

// 已知如下数组：
var arr = [
[1, 2, 2],
[3, 4, 5, 5],
[6, 7, 8, 9, [11, 12, [12, 13, [14]]]], 10
];
// 编写一个程序将数组扁平化去并除其中重复部分数据，最终得到一个升序且不重复的数组

    // // 去扁平化
    function paiping(arr){
        if(Array.isArray(arr)){
            let arr_ = [];
            digui(arr,arr_);
            return arr_;
        }
    }
    // 递归
    function digui(arr_item,arr_){
        for(let i=0;i<arr_item.length;i++){
                if(Array.isArray(arr_item[i])){
                    digui(arr_item[i],arr_);
                }else{
                    arr_.push(arr_item[i]);
                }
            }
    }
    let res =[...new Set(paiping(arr).sort((a,b)=>a-b))];
    console.log(res);
    // 方法二
   let res2 =[...new Set(arr.toString().split(",").map((items)=>{
      return parseInt(items);
   }).sort((a,b)=>a-b))] ;
   console.log(res2);

xifenzs · 2019-02-20T09:42:23Z

原题中的Infinity是用来干什么的

catbea · 2022-10-11T07:03:03Z

这是来自QQ邮箱的假期自动回复邮件。您好，我最近正在休假中，无法亲自回复您的邮件。我将在假期结束后，尽快给您回复。

ScholatLouis · 2022-10-11T07:03:25Z

您的来信已收到，我会尽快回复，谢谢

listentolife · 2022-10-11T07:03:29Z

你的邮件我已收到，我会马上查看！ —————————————————————— 现在的追逐梦想是为了日后能拥有美好的“那些年”！

janyin · 2022-10-14T06:34:19Z

[...new Set(arr.flat(5))].sort((a, b) => a - b)

pinelxk · 2023-01-30T06:41:34Z

[...new Set(arr.flat(Infinity))].sort((a,b) => a-b)

ScholatLouis · 2023-01-30T06:41:58Z

您的来信已收到，我会尽快回复，谢谢

catbea · 2023-01-30T06:42:00Z

这是来自QQ邮箱的假期自动回复邮件。您好，我最近正在休假中，无法亲自回复您的邮件。我将在假期结束后，尽快给您回复。

listentolife · 2023-01-30T06:42:02Z

你的邮件我已收到，我会马上查看！ —————————————————————— 现在的追逐梦想是为了日后能拥有美好的“那些年”！

lunhui1994 · 2023-01-30T06:42:03Z

这是来自QQ邮箱的假期自动回复邮件。您好，我最近正在休假中，无法亲自回复您的邮件。我将在假期结束后，尽快给您回复。

cliYao · 2023-01-30T06:42:06Z

这是来自QQ邮箱的假期自动回复邮件。您好，我最近正在休假中，无法亲自回复您的邮件。我将在假期结束后，尽快给您回复。

QWYZ · 2023-02-12T12:36:19Z

[...new Set(arr.flat(4).sort((a,b)=>a-b))]

SceneryCN · 2023-02-14T08:09:17Z

const paseArr = (arr) => { return Array.from( new Set( arr.reduce((rev, item) => { // 递归条件判断 if (item instanceof Array) { return rev.concat([...paseArr(item)]); } else { return rev.concat([item]); } }, []) ) ).sort((a, b) => a - b); };

2791666300 · 2023-08-14T13:55:41Z

[...new Set(arr.map(item => (Array.isArray(item) ? item.flat():item)).flat())].sort((a,b) => a - b)

catbea · 2023-08-14T13:56:06Z

这是来自QQ邮箱的假期自动回复邮件。您好，我最近正在休假中，无法亲自回复您的邮件。我将在假期结束后，尽快给您回复。

ScholatLouis · 2023-08-14T13:56:06Z

您的来信已收到，我会尽快回复，谢谢

listentolife · 2023-08-14T13:56:11Z

你的邮件我已收到，我会马上查看！ —————————————————————— 现在的追逐梦想是为了日后能拥有美好的“那些年”！

Yangbg2018 · 2023-10-11T07:19:29Z

Array.from(new Set(arr.flat(Infinity))).sort((a,b)=>{ return a-b})

原生搞个
function hArr(arr){
var list=[]
for(let i=0;i<arr.length;i++){
if(Object.prototype.toString.call(arr[i])==='[object Array]'){
list.push(...hArr(arr[i]))
}else{
list.push(arr[i])
}
}
return [...new Set(list)].sort((a,b)=>a-b)
}

catbea · 2023-10-11T07:19:58Z

这是来自QQ邮箱的假期自动回复邮件。您好，我最近正在休假中，无法亲自回复您的邮件。我将在假期结束后，尽快给您回复。

lunhui1994 · 2023-10-11T07:19:58Z

这是来自QQ邮箱的假期自动回复邮件。您好，我最近正在休假中，无法亲自回复您的邮件。我将在假期结束后，尽快给您回复。

donghym · 2023-10-12T08:51:31Z

[...new Set(arr.flat(Infinity))].sort()

Dangdtx · 2024-03-14T09:31:00Z

var arr = [ [1, 2, 2], [3, 4, 5, 5], [6, 7, 8, 9, [11, 12, [12, 13, [14] ] ] ], 10];
[... new Set(arr.flat(4)) ]
[1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 10]

catbea · 2024-03-14T09:31:39Z

这是来自QQ邮箱的假期自动回复邮件。您好，我最近正在休假中，无法亲自回复您的邮件。我将在假期结束后，尽快给您回复。

lunhui1994 · 2024-03-14T09:31:40Z

这是来自QQ邮箱的假期自动回复邮件。您好，我最近正在休假中，无法亲自回复您的邮件。我将在假期结束后，尽快给您回复。

listentolife · 2024-03-14T09:31:46Z

你的邮件我已收到，我会马上查看！ —————————————————————— 现在的追逐梦想是为了日后能拥有美好的“那些年”！

cliYao · 2024-03-14T09:31:55Z

这是来自QQ邮箱的假期自动回复邮件。您好，我最近正在休假中，无法亲自回复您的邮件。我将在假期结束后，尽快给您回复。

TobinXu · 2024-05-07T01:46:27Z

var arr = [ [1, 2, 2], [3, 4, 5, 5], [6, 7, 8, 9, [11, 12, [12, 13, [14] ] ] ], 10];

[...new Set(arr.flat(Infinity))].sort((a, b) => a - b)

ScholatLouis · 2024-05-07T01:46:59Z

您的来信已收到，我会尽快回复，谢谢

lunhui1994 · 2024-05-07T01:47:12Z

这是来自QQ邮箱的假期自动回复邮件。您好，我最近正在休假中，无法亲自回复您的邮件。我将在假期结束后，尽快给您回复。

listentolife · 2024-05-07T01:47:14Z

你的邮件我已收到，我会马上查看！ —————————————————————— 现在的追逐梦想是为了日后能拥有美好的“那些年”！

cliYao · 2024-05-07T01:47:22Z

这是来自QQ邮箱的假期自动回复邮件。您好，我最近正在休假中，无法亲自回复您的邮件。我将在假期结束后，尽快给您回复。

yygmind changed the title ~~将数组扁平化并去除其中重复数据，最终得到一个升序且不重复的数组~~ 第11题：将数组扁平化并去除其中重复数据，最终得到一个升序且不重复的数组 Feb 12, 2019

第 11 题：将数组扁平化并去除其中重复数据，最终得到一个升序且不重复的数组 #8

第 11 题：将数组扁平化并去除其中重复数据，最终得到一个升序且不重复的数组 #8

Comments

zpzxgcr commented Feb 12, 2019 • edited

zpzxgcr commented Feb 12, 2019 • edited by yygmind

zpzxgcr commented Feb 12, 2019

相关知识点

hejiaqian commented Feb 12, 2019 • edited by yygmind

hejiaqian commented Feb 12, 2019 • edited by yygmind

zpzxgcr commented Feb 12, 2019 • edited

hejiaqian commented Feb 12, 2019

cjfff commented Feb 12, 2019 • edited

AprilTong commented Feb 12, 2019 • edited by yygmind

zpzxgcr commented Feb 12, 2019

cjfff commented Feb 12, 2019

w587 commented Feb 12, 2019 • edited by yygmind

jackchenl commented Feb 13, 2019 • edited by yygmind

zhuzhuoxingguang commented Feb 14, 2019

sisterAn commented Feb 16, 2019

xiaoluoboding commented Feb 18, 2019 • edited

wangweianger commented Feb 18, 2019 • edited by yygmind

Allen3039 commented Feb 18, 2019 • edited

xpbsm commented Feb 18, 2019

mydaoyuan commented Feb 19, 2019

ihuoge commented Feb 19, 2019 • edited by yygmind

Jason686 commented Feb 19, 2019 • edited by yygmind

hellojackhui commented Feb 19, 2019

fan-2 commented Feb 19, 2019

yishuihan-001 commented Feb 19, 2019

xiaochen111 commented Feb 20, 2019

mySouler commented Feb 20, 2019

Liubasara commented Feb 20, 2019 • edited

weiweixuan commented Feb 20, 2019

xifenzs commented Feb 20, 2019

catbea commented Oct 11, 2022 via email

ScholatLouis commented Oct 11, 2022 via email

listentolife commented Oct 11, 2022 via email

janyin commented Oct 14, 2022

pinelxk commented Jan 30, 2023

ScholatLouis commented Jan 30, 2023 via email

catbea commented Jan 30, 2023 via email

listentolife commented Jan 30, 2023 via email

lunhui1994 commented Jan 30, 2023 via email

cliYao commented Jan 30, 2023 via email

QWYZ commented Feb 12, 2023

SceneryCN commented Feb 14, 2023 • edited

2791666300 commented Aug 14, 2023

catbea commented Aug 14, 2023 via email

ScholatLouis commented Aug 14, 2023 via email

listentolife commented Aug 14, 2023 via email

Yangbg2018 commented Oct 11, 2023

catbea commented Oct 11, 2023 via email

lunhui1994 commented Oct 11, 2023 via email

donghym commented Oct 12, 2023

Dangdtx commented Mar 14, 2024

catbea commented Mar 14, 2024 via email

lunhui1994 commented Mar 14, 2024 via email

listentolife commented Mar 14, 2024 via email

cliYao commented Mar 14, 2024 via email

TobinXu commented May 7, 2024

ScholatLouis commented May 7, 2024 via email

lunhui1994 commented May 7, 2024 via email

listentolife commented May 7, 2024 via email

cliYao commented May 7, 2024 via email

zpzxgcr commented Feb 12, 2019 •

edited

zpzxgcr commented Feb 12, 2019 •

edited by yygmind

hejiaqian commented Feb 12, 2019 •

edited by yygmind

hejiaqian commented Feb 12, 2019 •

edited by yygmind

zpzxgcr commented Feb 12, 2019 •

edited

cjfff commented Feb 12, 2019 •

edited

AprilTong commented Feb 12, 2019 •

edited by yygmind

w587 commented Feb 12, 2019 •

edited by yygmind

jackchenl commented Feb 13, 2019 •

edited by yygmind

xiaoluoboding commented Feb 18, 2019 •

edited

wangweianger commented Feb 18, 2019 •

edited by yygmind

Allen3039 commented Feb 18, 2019 •

edited

ihuoge commented Feb 19, 2019 •

edited by yygmind

Jason686 commented Feb 19, 2019 •

edited by yygmind

Liubasara commented Feb 20, 2019 •

edited

SceneryCN commented Feb 14, 2023 •

edited