位置：首页>> 网络编程>> JavaScript>> 简单的水果风暴的算法过程

简单的水果风暴的算法过程

作者：hehe123　来源：51js　发布时间：2009-12-13 15:49:00　

标签：算法,游戏,JavaScript

要下午传上的.结果事一多,忘记了.

好不容易回来 . 这个和 dh20156 的那个,是差不多的。找不到合适的图片,也就没做成游戏了.

这里, 为了简单的描叙下整个搜索的过程,我写了个简单的算法

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"> <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="zh-CN" lang="zh-CN"><head><title> fengbao 的算法 </title><meta http-equiv="Content-Language" content="zh-cn"/><style></style></head><body><center><div id="FengBao"></div><div id="MiaoXu"></div></center></body><script>var Fb = document.getElementById("FengBao"),Mx = document.getElementById("MiaoXu");var fengbao = {color_a : ["red","green","blue","yellow"],arr : [],insert : function(){var P = this,d = document,arr = P.arr;for(var i = -1,len_i = 9,num = 0;i++ < len_i;){var ol = d.createElement("ol")for(var j = -1,len_j = 9,m = Math;j++ < len_j;){var li = d.createElement("li"),sj = m.floor(m.random()*4);arr.push({o_:li,num_:num,i_:i,j_:j,ph_:false,ps_:false,type_:sj});li.style.background = P.color_a[sj],li.i_ = i,li.j_ = j,li.num_ = num,li.innerHTML = num;num ++,ol.appendChild(li);}Fb.appendChild(ol);}},init : function(){var P = this;P.insert();setTimeout(function(){P.coms();},2000);},coms : function(){var P = this,d = document,arr = P.arr,urr = arr.slice(0),nArr = [];var len = -1,bg = setInterval(function(){len++;var me = urr[len],nd_i = me.i_,nd_in = 0,nd_if = true,nd_j = me.j_,nd_jn = 0,nd_jf = true,num = me.num_;var str = "<div style='clear:both;border:1px #ccc solid;padding:3px;width:550px;margin:2px 0px;'>";if(!me.ph_ && !me.ps_){nArr.push({oid:num});if(!me.ph_){str += "<div style='270px;display:inline;float:left;'>序列号:"+len+" 对横排的扫描<br/>";var ms = [],na = nArr[nArr.length - 1];na.hn = 0,na.jl = nd_j,na.il = nd_i;out:for(var i = nd_j+1;i <= 9;i++){num ++;var he = urr[num];if(he.type_ == me.type_){he.ph_ = true,nd_jn++,ms.push({o_:he.o_}),na.hn++;str += "扫描到序列号"+num+"符合要求 ____此时数组长为:"+ms.length+"<br/>";}elsebreak out;}str +="</div>"; }else{str +="<div style='float:right;border:1px #ccc solid;padding:3px;width:550px;margin:2px 0px;'>序列号:"+len+" 横排的已被确定</div>";}if(!me.ps_){str += "<div style='270px;display:inline;float:left;'>序列号:"+len+" 对竖排的扫描<br/>";var ms = [],na = nArr[nArr.length - 1];na.sn = 0,na.jl = nd_j,na.il = nd_i,num = len;out:for(var i = nd_i+1;i <= 9;i++){num +=10;var he = urr[num];if(he.type_ == me.type_){he.ps_ = true,nd_jn++,ms.push({o_:he.o_}),na.sn++;str += "扫描到序列号"+num+"符合要求 ____此时数组长为:"+ms.length+"<br/>";}elsebreak out;}str +="</div>"; }else{str +="<div style='float:right;border:1px #ccc solid;padding:3px;width:550px;margin:2px 0px;'>序列号:"+len+" 竖排的已被确定</div>";}}else str += "序列号:"+len+" 已经在前次被扫描确定";str += "</div>";Mx.innerHTML += str;if(len > 98){for(var i = 0,ls = nArr.length;i < ls;i++){var os = nArr[i];if(os.hn >= 2)Fb.children[os.il].children[os.jl+os.hn].style.border = "1px #000 solid";if(os.sn >= 2)Fb.children[os.il+os.sn].children[os.jl].style.border = "1px #fff solid";}return clearInterval(bg);}},20);}}fengbao.init();</script></html>

投稿

简单的水果风暴的算法过程

猜你喜欢