https://leetcode.com/problems/find-all-duplicates-in-an-array/description/ 参考:http://www.cnblogs.com/grandyang/p/4843654.html Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all th
一.问题详情: 直接删除意为原数组需要被改变,而不是得到另一个数组. 二.JavaScript实现 (一)巧用数组的push( ).shift( )方法 function del(arr,num) { var l=arr.length; for (var i = 0; i < l; i++) { if (arr[0]!==num) { arr.push(arr[0]); } arr.shift(arr[0]); } return arr; } var a=[3,2,3,445,3,3,3,1,3