数组去重原型方法//---------------first---------------
array.prototype.distinct = function(){
var arr=[];
var obj={}; //对象承接
for(var i=0,len=this.length;i<len;i++){
if(!obj[this[i]]){
obj[this[i]]=1;
arr.push(this[i]);
}
}
return arr;
};
var arr = new array();
arr.push(1,3,2,4,4,4,5,6,7,8,8,8,9,0);
//--------------second----------------
array.prototype.distinct = function(){
var arr=[];
for(var i=0,len=this.length;i<len;i++){
if(this[i]==this[i+1]){
continue;
}else{
arr.push(this[i]);
}
}
return arr;
};
var arr = new array();
arr.push(1,3,2,4,4,4,5,6,7,8,8,8,9,0);
//----------------third----------------
array.prototype.distinct = function(){
for(var i=0,len=this.length;i<len;i++){
for(var j=i+1;j<=len;j++){
if(this[i]==this[j]){
console.log(this[j]);
this.splice(j,1);
j--; //得考虑如果删除一个元素,j的值需要减1
len--;
}
}
}
//return this;
};
var arr = new array();
arr.push("a","b","c","c","b","bb","dd","d","aa","c","bb");
arr.distinct();
普通方法function removerepeat(arr){
var array=[];
var obj={};
for(var i=0,len=arr.length;i<len;i++){
if(!obj[arr[i]]){
obj[arr[i]]=1;
array.push(arr[i]);
}
}
return array;
};
var arr = new array(1,3,2,4,4,4,5,6,7,8,8,8,9,0);
var array = removerepeat(arr);
数组查找顺序查找function sequencesearch(arr, value){
var i;
for(i=0; i<arr.length; i++){
if(arr[i]==value)
return i;
}
return -1;
}
二分查找二分查找元素必须是有序的，如果是无序的则要先进行排序操作
-------------折半查找--------------
function binarysearch1(arr, value){
var low, high, mid;
low = 0;
high = arr.length-1;
while(low<=high){
mid = math.floor((low+high)/2);
if(a[mid]==value){
return mid;
}
if(a[mid]>value){
high = mid-1;
}
if(a[mid]<value){
low = mid+1;
}
}
return -1;
}
-------------递归版本--------------
function binarysearch2(arr, value){
var low, high, mid;
low = 0;
high = arr.length-1;
var mid = low+(high-low)/2;
if(arr[mid]==value){
return mid;
}
if(a[mid]>value){
return binarysearch2(arr, value);
}
if(a[mid]<value){
return binarysearch2(arr, value);
}
}
数组插入顺序插入//----------------first----------------
function insert(arr, n, data){
//若插入数据位置不在表尾
if (n < arr.length){
//将要插入位置之后元素依次向后移动一位
for (var i = seqlist.listlen - 1; i >= n; i--) {
seqlist.listdata[i + 1] = seqlist.listdata[i];
}
}
//将数据插入到位置为n的位置并将数组的长度加1
seqlist.listdata[n-1] = data;
seqlist.listlen++;
return true;
}
//----------------second----------------
function aa(arr, val) {
for (var i = 0; i <arr.length; i++) {
if (arr[i] == val) return i;
}
return -1;
};
function bb(arr, val) {
var index =arr.indexof(val);
if (index > -1) {
arr.splice(index, 1);
}
};
var emp = ['abs','dsf','sdf','fd']
bb(emp, 'fd');
数组删除function delete(arr, n){
//判断数组是否为空
if (seqlist.listlen == 0) return false;
//判断n的位置是否合法
if (n < 1 || n > seqlist.listlen) return false;
//如果删除不是最后位置
if (n < seqlist.listlen) {
//将删除位置后继元素依次前移
for (int i = n; i < seqlist.listlen; i++) {
seqlist.listdata[i-1] = seqlist.listdata[i];
}
}
//表长减1
seqlist.listlen--;
return true;
}
以上就是javascript数组去重/查找/插入/删除的方法的详细内容。