FCC-----------Diff Two Array
2017-06-25 17:41
127 查看
比较两个数组,然后返回一个新数组,该数组的元素为两个给定数组中所有独有的数组元素。换言之,返回两个数组的差异。
这是一些对你有帮助的资源:
Comparison Operators
Array.slice()
Array.filter()
Array.indexOf()
Array.concat()
这是一些对你有帮助的资源:
Comparison Operators
Array.slice()
Array.filter()
Array.indexOf()
Array.concat()
function diff(arr1, arr2) { var ar1 = arr1.filter(function(value) { return arr2.indexOf(value) ===-1; }); var ar2 = arr2.filter(function(value) { return arr1.indexOf(value) ===-1; }); return ar1.concat(ar2); } diff([1, 2, 3, 5], [1, 2, 3, 4, 5]);
相关文章推荐
- FCC--Diff Two Arrays(比较两个数组)
- 532. K-diff Pairs in an Array
- 深思 PHP 数组遍历的差异(array_diff 的实现)
- array_diff_uassoc
- [Leetcode] Two Sum II - Input array is sorted
- Median Of Two Sorted Array的寻找k 的解法
- Leetcode之Two Sum II - Input array is sorted 问题
- [leetcode]-532 K-diff Pairs in an Array
- 532. K-diff Pairs in an Array
- [Leetcode] Two Sum II - Input array is sorted
- 深思 PHP 数组遍历的差异(array_diff 的实现)
- leetcode题解Java | 421. Maximum XOR of Two Numbers in an Array
- php 算法之切割数组,不用array_chunk(),算法之二,取数组的差值,不用array_diff()
- 6-18 Two Stacks In One Array(20 point(s))
- pta Two Stacks In One Array(简单版双向数组)
- LeetCode - 532 - K-diff Pairs in an Array
- Data Structure Array: Maximum sum such that no two elements are adjacent
- HT349IntersectionOfTwoArray
- 6-1 Two Stacks In One Array-PTA双指指针stack表操作实现
- 421. Maximum XOR of Two Numbers in an Array