js單向鏈表的具體實現實例_javascript技巧

代碼如下:
function linkNode(_key, _value)
{
///

/// 鏈表類的節點類
///

this.Key = _key;
this.Value = _value;
this.next = null;
}
function Link()
{
///

/// 創建一個鏈表類
///

this.root = new linkNode(null, null); //root永遠是個空節點
this.end = this.root;
}
Link.prototype =
{
count: 0,
value: function (_key)
{
///

/// 根據key的值來獲取value值
///

///
/// key的值
///
///
/// 對應的value的值
///
var i = this.root;
while (Boolean(i = i.next))
{
if (i.Key == _key)
return i.Value;
}
},
add: function (_key, _value)
{
///

/// 往鏈表的尾部中加入一個節點
///

///
/// key的值
///
///
/// value的值
///
///
/// 返回新增加的value的值
///
var i = this.root;
while (Boolean(i = i.next))
{
if (i.Key == _key)
return i.Value = _value;
}
var node = new linkNode(_key, _value);
if (this.count == 0)
this.root.next = node;
else
this.end.next = node;
this.end = node;
this.count++;
return _value;
},
insert: function (_key, node)
{
///

/// 從鏈表類的某節點之后插入新節點node.
///

///
/// 在鍵值等于_key的元素之后插入
///
///
/// 要插入的元素
///
var i = this.root;
while (Boolean(i = i.next))
{
if (i.Key == _key)
{
var tmp = i.next;
i.next = node;
node.next = tmp;
break;
}
}
},
insertBefore: function (_key, node)
{
///

/// 從鏈表類的某節點之后插入新節點node.
///

///
/// 在鍵值等于_key的元素之后插入
///
///
/// 要插入的元素 www.gxlcms.com
///
var i = this.root;
while (Boolean(i = i.next))
{
if (i.next.Key == _key)
{
var tmp = i.next;
i.next = node;
node.next = tmp;
break;
}
}
},
remove: function (_key)
{
///

/// 從鏈表類中移除一個key
///

///
/// key的值
///
var i = this.root;
do
{
if (i.next.Key == _key)
{
if (i.next.next == null)
this.end = i;
i.next = i.next.next;

this.count--;
return;
}
} while (Boolean(i = i.next))
},
exists: function (_key)
{
///

/// 檢查鏈表類中是否存在一個key
///

///
/// key的值
///
///
///
var i = this.root;
while (Boolean(i = i.next))
if (i.Key == _key)
return true;
return false;
},
removeAll: function ()
{
///

/// 清空鏈表類
///

this.root = new linkNode(null, null);
this.end = this.root;
this.count = 0;
},
Obj2str: function (o)
{
if (o == undefined)
{
return "";
}
var r = [];
if (typeof o == "string")
return "\"" + o.replace(/([\"\\])/g, "\\$1").replace(/(\n)/g, "\\n").replace(/(\r)/g, "\\r").replace(/(\t)/g, "\\t") + "\"";
if (typeof o == "object")
{
if (!o.sort)
{
for (var i in o)
r.push("\"" + i + "\":" + this.Obj2str(o[i]));
r = "{" + r.join() + "}";
}
else
{
for (var i = 0; i < o.length; i++)
r.push(this.Obj2str(o[i]))
r = "[" + r.join() + "]";
}
return r;
}
return o.toString().replace(/\"\:/g, '":""');
},
getJSON: function ()
{
///

/// 轉換成JSON字符串
///

///
///
//內部方法，用于遞歸
var me = this;
var getChild = function (node)
{
var str = "";
str += "{\"Key\":\"" + node.Key + "\",\"Value\":" + me.Obj2str(node.Value);
if (node.next != null)
str += ",\"next\":" + getChild(node.next);
else
str += ",\"next\":\"null\"";
str += "}";
return str;
};
var link = "{\"root\":{\"Key\":\"null\",\"Value\":\"null\",\"next\":";
if (this.count == 0)//如果空表
{
return "{\"root\":{\"Key\":\"null\",\"Value\":\"null\",\"next\":\"null\"},\"end\":{\"Key\":\"null\",\"Value\":\"null\",\"next\":\"null\"},\"count\":\"0\"}";
}
link += getChild(this.root.next) + "}";
//加上end
link += ",\"end\":{\"Key\":\"" + this.end.Key + "\",\"Value\":" + me.Obj2str(this.end.Value) + ",\"next\":\"null\"";
link += "},\"count\":\"" + this.count + "\"}";
return link;
},
getArrayJSON: function ()
{
///

/// 轉所有節點的value換成JSON字符串,數組格式
///

///
///
var link = "{\"link\":[";
var i = this.root;
while (Boolean(i = i.next))
{
link += this.Obj2str(i.Value) + ",";
}
link = link.substr(0, link.length - 1);
link += "]}";
return link;
},
sort: function (fn)
{
///

/// 對鏈表進行排序
///

///
/// 比較兩個鏈表元素大小的方法，當返回真時，此方法的參數所指的節點將往下沉
///
if (fn != null)
{

var i = this.root;
while (Boolean(i = i.next))
{
var j = this.root;
while (Boolean(j = j.next))
{
if (j.next != null)
{
if (fn.call(this, j))
{
var Key = j.Key;
var Value = j.Value;
j.Key = j.next.Key;
j.Value = j.next.Value;
j.next.Key = Key;
j.next.Value = Value;
}
}
}
this.end = i;
}

}
else
{

}
}
};

聲明：本網頁內容旨在傳播知識，若有侵權等問題請及時與本網聯系，我們將在第一時間刪除處理。TEL:177 7030 7066 E-MAIL:11247931@qq.com