forked from rmurphey/js-assessment
/
arrays.js
118 lines (94 loc) · 2.26 KB
/
arrays.js
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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
if (typeof define !== 'function') { var define = require('amdefine')(module); }
define(function() {
return {
indexOf : function(arr, item) {
var rst = -1;
for( var i = 0; i < arr.length; i++){
if( item == arr[i] ) {
rst = i;
break;
}
}
return rst;
},
sum : function(arr) {
var rst = 0;
for( var i = 0; i < arr.length; i++){
rst += arr[i];
}
return rst;
},
remove : function(arr, item) {
var _arry = [];
for( var i = 0; i < arr.length; i++){
if( arr[i] != item ) {
_arry.push( arr[i] );
}
}
return _arry;
},
removeWithoutCopy : function(arr, item) {
var i=0,
len = arr.length;
while( i < len ) {
if( arr[i] == item ) {
arr.splice(i, i+1);
len--;
}
i++;
}
return arr;
},
append : function(arr, item) {
arr.push( item );
return arr;
},
truncate : function(arr) {
arr.splice( -1 );
return arr;
},
concat : function(arr1, arr2) {
return arr1.concat( arr2 );
},
insert : function(arr, item, index) {
arr.splice( index, 0, item )
return arr;
},
count : function(arr, item) {
var rst = 0;
for( var i = 0; i < arr.length; i++){
if( arr[i] === item ) {
rst++;
}
}
return rst;
},
duplicates : function(arr) {
var hsh = {},
rst = [];
for( var i = 0; i < arr.length; i++){
if( !hsh[ arr[i] ] ) {
hsh[ arr[i] ] = 1;
} else {
rst.push( arr[i] );
}
}
return rst;
},
square : function(arr) {
for( var i = 0; i < arr.length; i++){
arr[i] = arr[i] * arr[i];
}
return arr;
},
findAllOccurrences : function(arr, target) {
var rst = [];
for( var i = 0; i < arr.length; i++){
if( arr[i] == target ) {
rst.push( i );
}
}
return rst;
}
};
});