一个Javascript链表

王朝厨房·作者佚名  2007-01-05
窄屏简体版  字體: |||超大  

function Entry(next, data)

{

this.next = next

this.data = data

}

function Iterator(node)

{

this.cousor = node

this.hasNext = function ()

{

return (this.cousor.next != null);

}

this.next = function ()

{

var rt = this.cousor.next

this.cousor = this.cousor.next

return rt.data

}

}

function LinkedList()

{

this.head = new Entry(null, null)

this.size = function ()

{

var size = 0

if (this.head == null)

{

return size

}

var p = this.head.next

for(; p!=null; p = p.next)

size++;

return size;

}

this.clear = function ()

{

this.head = null

}

this.getNode = function (idx)

{

var pos = -1;

 
 
 
免责声明:本文为网络用户发布,其观点仅代表作者个人观点,与本站无关,本站仅提供信息存储服务。文中陈述内容未经本站证实,其真实性、完整性、及时性本站不作任何保证或承诺,请读者仅作参考,并请自行核实相关内容。
 
 
© 2005- 王朝網路 版權所有 導航