本文實例為大家分享了JS 列出所有單詞及其出現(xiàn)次數(shù)的實現(xiàn)代碼，JS統(tǒng)計英語單詞出現(xiàn)次數(shù)，可以調(diào)用LinkedList 類的方法orderInsert(), 以字母大小的順序儲存英文字符串，同時記錄英文單詞出現(xiàn)的次數(shù)，供大家參考，具體內(nèi)容如下

<html>
<head>
 <title>Linked List</title>
 <meta charset="utf-8">
</head>
<body>
<script type="text/javascript">
 
function Node(data) { 
  this.data = data; 
  this.frequency =1;
  this.next = null; 
   }   
var SList =function SList() { 
  this.head = new Node("Dummy"); 
   } 
SList.prototype.insertLast =function(data) { 
  var p = this.head; 
  while (p.next!=null) 
  p = p.next;
  p.next=new Node(data); 
  } 
SList.prototype.insertFirst =function(data) { 
  var p=new Node(data); 
  p.next = this.head.next; 
  this.head.next=p;
  } 
SList.prototype.traversal=function (){
  var p=this.head;
  while (p.next != null){
  document.write( p.next.data + "("+p.next.frequency+"), ");
  p = p.next;
  }
 }
 
 SList.prototype.orderInsert =function(data) { 
 var k = this.search( data );
 if (k) k.frequency++;
 else {
  var p = new Node(data); 
  var q = this.head; 
  while (q.next!=null && q.next.data<data) 
  q = q.next;
  p.next=q.next;
  q.next=p;
  } 
 }
 SList.prototype.search= function (data) { 
  var p = this.head; 
  while (p.data != data && p.next!=null) 
  p = p.next;
  if (p.data !=data)
  return null; 
  else
  return p; 
  } 
   
 var Slist = new SList();
 var s=new Array("earthquake","prediction","geology","physics",
 "chemistry","biology","mathematics","computer","earth_science",
 "chemistry","biology","mathematics","computer","paleomagnetism",
 "topology","biology","mathematics","computer","earthquake");
 for (var i=0; i<s.length; i++)
 Slist.orderInsert(s[i]);
 Slist.traversal(); 
</script>
</body>
</html>

效果：