What would be the most efficient way to compare two arrays of integers and return a unique array of the higher corresponding integers in each array?
(can use lodash)
ex:
var arr1 = [0, 1, 2, 1, 0];
var arr2 = [1, 0, 0, 3, 0];
// result = [1, 1, 2, 3, 0];
Here's my first, less efficient method:
var arr1 = [0, 1, 2, 1, 0];
var arr2 = [1, 0, 0, 3, 0];
arr1.map(function (item, i) {
return Math.max(item, arr2[i])
}); // [1, 1, 2, 3, 0]
What it lacks in speed, it gains in beauty!
Or for you ES6 boverers:
var arr1 = [0, 1, 2, 1, 0];
var arr2 = [1, 0, 0, 3, 0];
arr1.map((item, i) => Math.max(item, arr2[i])); // [1, 1, 2, 3, 0]
function selectHighestValues (arr1, arr2) {
var maxLength = Math.max(arr1.length, arr2.length);
var _arr = [];
for (var i = 0; i < maxLength; i++) {
if (arr1[i] && arr2[i]) {
_arr[i] = Math.max(arr1[i], arr2[i]);
} else if (arr1[i]) {
_arr[i] = arr1[i];
} else {
_arr[i] = arr2[i];
}
}
return _arr;
}
With splicing longest array and concatenation:
function selectHighestValues (arr1, arr2) {
var minLength = Math.min(arr1.length, arr2.length);
var maxLength = Math.max(arr1.length, arr2.length);
var longestArrayIndex = arr1.length > arr2.length ? 0 : 1;
var _arr = [];
for (var i = 0; i < minLength; i++) {
_arr[i] = Math.max(arr1[i], arr2[i]);
}
if (maxLength > minLength) {
var sliced = Array.prototype.slice.call(arguments[longestArrayIndex], minLength, maxLength);
_arr = Array.prototype.concat.call(_arr, sliced);
}
return _arr;
}
Brute force!
var arr1 = [0, 1, 2, 1, 0];
var arr2 = [1, 0, 0, 3, 0];
var result = [];
for(var i = 0; i < arr1.length; i++) {
if (arr1[i] > arr2[i]) {
result.push(arr1[i]);
} else {
result.push(arr2[i]);
}
}
_.zipWith(arr1, arr2, function(el1, el2) {
return (el1 > el2 ? el1 : el2);
});
_.zipWith()
is only in lodash 3.x I believe.
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.