-
Notifications
You must be signed in to change notification settings - Fork 24
Expand file tree
/
Copy pathArrayUtils.js
More file actions
88 lines (77 loc) · 1.76 KB
/
ArrayUtils.js
File metadata and controls
88 lines (77 loc) · 1.76 KB
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
class ArrayUtils{
//Problem 1
function isEmpty(array){
if (array.length < 1){
return true
} else {
return false;
}
}
//Problem 2
function append(original, value){
original.push(value);
return original;
}
//Problem 3
let copyArr = [];
function clone(array){
for (let value of array) {
copyArr.push(value)
}
return copyArr;
}
//Problem 4
let newArr = [];
function subArray(array, from, to){
for(let i = array[from]; i <= array[to]; i++) {
newArr = array.push(i);
return newArr;
}
}
//Problem 5
function equals(arr1, arr2){
if(!arr1 || !arr2) {
return false;
}
if(arr1.length !== arr2.length){
return false;
}
for(let i = 0; i < arr1.length; i++) {
if (arr1[i] == arr2[i]) {
continue;
} else {
return false;
}
}
return true;
}
//Problem 6
function fill(original, value){
for( i = 0; i < original.length; i++) {
original[i] = value;
}
return original;
}
//Problem 7
function indexOf(original, value){
for(i = 0; i < original.length; i++){
if (original[i] == value){
return i;
}
}
return -1;
}
//Problem 8
let newArr = [];
function remove(original, value){
newArr = clone(original);
let index = indexOf(original, value);
newArr.splice(index, 1);
return newArr;
}
//Problem 9
function reverse(original){
original.reverse();
return original;
}
}