引子
排序在編程中隨處可見，從開始學習變成，到項目開發，基本上或多或少會遇到一些排序問題，接下來我要寫的是我在實際開發終于到的一個排序問題，一開始卡了我很久，后面隨著知識積累，實踐變多才解決掉了，不知道是不是我搜索關鍵字不對，還是其他原因，百度也沒有找到這方面的內容。
數據結構和需求
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
|
var arr = [ {"sonumber" : "52085848","item" : "313281","amount" : "3"}, {"sonumber" : "52085846","item" : "313321","amount" : "10"}, {"sonumber" : "52085848","item" : "313330","amount" : "5"}, {"sonumber" : "52085846","item" : "313321","amount" : "4"}, {"sonumber" : "52085843","item" : "313338","amount" : "13"}, {"sonumber" : "52085843","item" : "422784","amount" : "108"} ] |
數據結構如上，數組結構，每個數組元素由對象構成，sonumber代表采購訂單編號，item代表物料，現需求是sonumber（采購訂單編號）從小到大排序，且基于相同的采購訂單下的物料數據編號需要從小到大排列。
兩層排序實現代碼
解決思路：
先將sonumber按從小到大的順序整理成數組，然后以銷售訂單數組為外層循環，實際數據為內層循環，引入一個中間數組，中間數組中的item從小到大排序，最后按順序將所有的中間數組元素放入新數組中。
實現代碼：
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
|
/** * 兩層排序算法 */ function multilayersorting() { var arr = [ { "sonumber" : "52085848", "item" : "313281", "amount" : "3" }, { "sonumber" : "52085846", "item" : "313321", "amount" : "10" }, { "sonumber" : "52085848", "item" : "313330", "amount" : "5" }, { "sonumber" : "52085846", "item" : "313321", "amount" : "4" }, { "sonumber" : "52085843", "item" : "313338", "amount" : "13" }, { "sonumber" : "52085843", "item" : "422784", "amount" : "108" } ] // 整理sonumber成數組,并且從小到大排列 var sodata = getsodata(arr); var newdata = []; for ( var i in sodata) { var middata = [] for ( var j in arr) { if (sodata[i] == arr[j].sonumber) { middata.push(arr[j]); } } middata = middata.sort(function(obj1, obj2) { var val1 = number(obj1.item); var val2 = number(obj2.item); if (val1 < val2) { return -1; } else if (val1 > val2) { return 1; } else { return 0; } }); log.debug('middata', middata); for ( var m in middata) { newdata.push(middata[m]); } } log.debug('newdata', newdata); return newdata; } function getsodata(arr) { var sodata = []; for ( var i in arr) { if (sodata.indexof(arr[i].sonumber) == -1) { sodata.push(arr[i].sonumber); } } sodata.sort(); log.debug('sodata', sodata); return sodata; }<br> |
最終數組截圖:
對比一開始的數組和排序后的數組確實實現了按照sonumber和item兩個部分順序排列,但是也可以看到圈出來的部分的amount金額在相同的sonumber和item下并沒有順序,如果要實現amount部也有序呢?
三層排序
實現代碼:
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
|
/** * 三層排序算法 */ function multilayersorting() { var arr = [ { "sonumber" : "52085848", "item" : "313281", "amount" : "3" }, { "sonumber" : "52085846", "item" : "313321", "amount" : "10" }, { "sonumber" : "52085848", "item" : "313330", "amount" : "5" }, { "sonumber" : "52085846", "item" : "313321", "amount" : "4" }, { "sonumber" : "52085843", "item" : "313338", "amount" : "13" }, { "sonumber" : "52085843", "item" : "422784", "amount" : "108" } ] // 整理sonumber成數組,并且從小到大排列 var sodata = getsodata(arr); var newdata = []; for ( var i in sodata) { var middata = [] for ( var j in arr) { if (sodata[i] == arr[j].sonumber) { middata.push(arr[j]); } } middata = middata.sort(function(obj1, obj2) { var val1 = number(obj1.item); var val2 = number(obj2.item); if (val1 < val2) { return -1; } else if (val1 > val2) { return 1; } else { return 0; } }); var itemdata = [] for ( var m in middata) { if (itemdata.indexof(middata[m].item) == -1) { itemdata.push(middata[m].item) } } for ( var n in itemdata) { var middata1 = []; for ( var x in middata) { if (middata[x].item == itemdata[n]) { middata1.push(middata[x]); } } middata1 = middata1.sort(function(obj1, obj2) { var val1 = number(obj1.amount); var val2 = number(obj2.amount); if (val1 < val2) { return -1; } else if (val1 > val2) { return 1; } else { return 0; } }); for ( var y in middata1) { newdata.push(middata1[y]); } } } log.debug('newdata', newdata); return newdata; } function getsodata(arr) { var sodata = []; for ( var i in arr) { if (sodata.indexof(arr[i].sonumber) == -1) { sodata.push(arr[i].sonumber); } } sodata.sort(); log.debug('sodata', sodata); return sodata; } |
實現結果
從結果可以看出實現了依次按照sonumber ,item ,amount 從小到大排列
思考
從兩層排序到三層排序我們可以發現代碼原來越繁瑣,如果要實現四層就更加麻煩了,不知道是否有更好的辦法實現這種多維度,多層次的排序。
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
|
var arr = [ {"sonumber" : "52085848","item" : "313281","amount" : "3"}, {"sonumber" : "52085846","item" : "313321","amount" : "10"}, {"sonumber" : "52085848","item" : "313330","amount" : "5"}, {"sonumber" : "52085846","item" : "313321","amount" : "4"}, {"sonumber" : "52085843","item" : "313338","amount" : "13"}, {"sonumber" : "52085843","item" : "422784","amount" : "108"} ] |
總結
到此這篇關于js中多層次排序算法的文章就介紹到這了,更多相關js多層次排序算法內容請搜索服務器之家以前的文章或繼續瀏覽下面的相關文章希望大家以后多多支持服務器之家！
原文鏈接：https://www.cnblogs.com/xyf-blog/p/14241025.html
