本文实例为大家分享了JavaScript实现连连看连线算法的多种情况，供大家参考，具体内容如下
第一种情况为两个精灵能通过一条直线连接，如下图
代码如下：
var self = this; //用self变量来保存当下的这个this，以免在其他函数域中this指向不同对象而调用错误
//直线连接的两个对象
function isDirectLink(_begin,_end){
//若传入的是同一对象，连线的长度为0，返回false row col 分别表示精灵的行号和列号
if(_begin.row == _end.row&&_begin.col==_end.col){
m_line.length = 0;
return false;
}
//行号相等时
if(_begin.row == _end.row){
var steps = _begin.col - _end.col;
var direction = steps/Math.abs(steps);
var row = _begin.row;
//判断两个对象直线距离上是否存在精灵
for(var i = 1;i<Math.abs(steps);++i)
{
var col = _begin.col - i*direction;
//获取连线中间的精灵
var sprite = self.m_sprites[row*m_col+col];
//若不为空，连线的长度为0，返回false
if(sprite!=null)
{
m_line.length = 0;
return false;
}
}
m_line.push(new M_Segment(_begin,_end));
return true;
}
//列号相等时
if(_begin.col == _end.col){
var steps = _begin.row-_end.row;
var direction = steps/Math.abs(steps);
var col = _begin.col;
for(var i =1;i<Math.abs(steps);++i){
var row =_begin.row - i*direction;
var sprite = self.m_sprites[row*m_col+col];
if(sprite!=null){
m_line.length = 0;
return false;
}
}
m_line.push(new M_Segment(_begin,_end));
return true;
}
return false;
};
第二种情况为只需一个转角就能连接两个精灵 如下图
function isOneCornerLink(_begin,_end){
if(_begin.row == _end.row&&_begin.col == _end.col){
m_line.length = 0;
return false;
}
//第一种拐点 M_Point（）是自定义的一个函数
var point_1 = new M_Point(_begin.row,_end.col);
//用拐点分别连接两个精灵
var islink_1 =(isDirectLink(_begin,point_1)&&isDirectLink(point_1,_end));
//若连接成功
if(islink_1){
//若拐点上无精灵，则返回true
if(self.m_sprites[point_1.row*m_col+point_1.col]==null){
return true;
}
}
m_line.length=0;
//第二种拐点
var point_2 = new M_Point(_end.row,_begin.col);
var islink_2 = (isDirectLink(_begin,point_2)&&isDirectLink(point_2,_end));
if(islink_2){
if(self.m_sprites[point_2.row*m_col+point_2.col]==null){
return true;
}
}
m_line.length =0;
return false;
};
第三种情况是需要两个拐点才能相连 这种情况比较多，列出两种的图，供理解代码的时候参考
function isTwoCornerLink(_begin,_end){
function setSegment(point_1,point_2,point_3,point_4){
m_line.length = 0;
m_line.push(new M_Segment(point_1,point_2));
m_line.push(new M_Segment(point_2,point_3));
m_line.push(new M_Segment(point_3,point_4));
}
if(_begin.row==_end.row&&_begin.col==_end.col){
m_line.length = 0;
return false;
}
//若两个对象在同一行，且在边框最外的两行
if(_begin.row == _end.row&&(_begin.row ==0||_begin.row==m_row-1)){
var addline = -1;
//若在第一行，则在下面划线，否则在上面
if(_begin.row == 0){
addline =1;
}
var p_1 = new M_Point(_begin.row-addline,_begin.col);
var p_2 = new M_Point(_begin.row-addline,_end.col);
setSegment(_begin,p_1,p_2,_end);
return true;
}
m_line.length = 0;
//若两个对象在同一列，且在边框最外的两行
if(_begin.col ==_end.col&&(_begin.col==0||_begin.col==m_col-1)){
var addline = -1;
if(_begin.col == 0){
addline = 1;
}
var p_1 = new M_Point(_begin.row,_begin.col-addline);
var p_2 = new M_Point(_end.row,_end.col-addline);
setSegment(_begin,p_1,p_2,_end);
return true;
}
m_line.length = 0;
//向上画线
for(var _row = _begin.row+1;_row<=m_row;++_row){
if(_row == m_row){
//如果begin点在最外一行，判断end点对应边框上的点是否存在，再判断是否能连接
if(row - 1 ==_begin.row){
if (self.m_sprites[(_row - 1) * m_col + _end.col] == null) {
var link = isDirectLink(_end, new M_Point((_row - 1), _end.col));
if (link) {
m_line.length = 0;
var p_1 = new M_Point(_row, _begin.col);
var p_2 = new M_Point(_row, _end.col);
setSegment(_begin, p_1, p_2, _end);
return true;
}
}
}
m_line.length = 0;
// 若end点在第八行
if(_row - 1 == _end.row){
if(self.m_sprites[(_row-1)*m_col+_end.col]==null){
var link = isDirectLink(_begin,new M_Point((_row-1),_begin.col));
if(link){
m.line.length = 0;
var p_1 =new M_Point(_row,_begin.col);
var p_2 = new M_Point(_row,_end.col);
setSegment(_begin,p_1,p_2,_end);
return true;
}
}
}
m_line.length = 0;
//若begin点和end点列对应的第八行上是否为空
if(self.m_sprites[(_row-1)*m_col+_begin.col]!=null||self.m_sprites[(_row-1)*m_col+_end.col]!=null){
break;
}
var link_1 = isDirectLink(_begin,new M_Point(_row - 1,_begin.col));
var link_2 = isDirectLink(_end,new M_Point(_row -1 ,_end.col));
if(link_1&&link_2)
{
m_line.length = 0;
var p_1 = new M_Point(_row,_begin.col);
var p_2 = new M_Point(_row,_end.col);
setSegment(_begin,p_1,p_2,_end);
return true;
}
}
else{
m_line.length = 0;
var point_1 = new M_Point(_row,_begin.col);
//若连线第一个拐点为空
if(self.m_sprites[point_1.row*m_col+point_1.col]!=null){
break;
}
var link_1 = isOneCornerLink(point_1,_end);
var link_2 = isDirectLink(_begin,point_1);
if(link_1&&link_2){
return true;
}
}
}
//向下画线
m_line.length = 0;
for(var _row = begin.row-1;_row>=-1;--row){
if(_row==-1){
if(0==_begin.row){
if(self.m_sprites[_end.col]==null){
var link = isDirectLink(_end,new M_Point(0,_end.col));
if(link){
m_line.length = 0;
var p_1 = new M_Point(_row,_begin.col);
var P_2 = new M_Point(_row,_end.col);
setSegment(_begin,p_1,p_2,_end);
return true;
}
}
}
m_line.length = 0;
if(0==_end.row){
if(self.m_sprites[_begin.col]==null){
var link = isDirectLink(_begin,new M_Point(0,_begin.col));
if(link){
m_line.length = 0;
var p_1 = new M_Point(_row,_begin.col);
var p_2 = new M_Point(_row,_end.col);
setSegment(_begin,p_1,p_2,_end);
return true;
}
}
}
m_line.length = 0;
if(self.m_sprites[_begain.col]!=null||self.m_sprites[_end.col]!=null){
break;
}
var link_1 = isDirectLink(_begain,new M_Point(0,_begain.col));
var link_2 = isDirectLink(_end,new M_Point(0,_end.col));
if(link_1&&link_2){
m_line.length = 0;
var p_1 = new M_Point(_row,_begain.col);
var p_2 = new M_Point(_row,_end.col);
setSegment(_begain,p_1,p_2,_end);
return true;
}
}
else {
m_line.length = 0;
var point_1 = new M_Point(_row, _begain.col);
//cc.log(point_1.row+" "+point_1.col);
if (self.m_sprites[point_1.row * m_col + point_1.col] != null) {
break;
}
var link_1 = isOneCornerLink(point_1, _end);
var link_2 = isDirectLink(_begain, point_1);
if (link_1 && link_2) {
return true;
}
}
}
m_line.length = 0;
//向左画线
for(var _col = _begain.col-1;_col>=-1;--_col){
if(_col==-1){
if(0==_begain.col){
if(self.m_sprites[_end.row*m_col]==null){
var link = isDirectLink(_end,new M_Point(_end.row,0));
if(link){
m_line.length = 0;
var p_1 = new M_Point(_begain.row,_col);
var p_2 = new M_Point(_end.row,_col);
setSegment(_begain,p_1,p_2,_end);
//m_line.push(new M_Segment(_begain,p_1));
//m_line.push(new M_Segment(p_1,p_2));
//m_line.push(new M_Segment(p_2,_end));
return true;
}
}
}
m_line.length = 0;
if(0==_end.col){
if(self.m_sprites[_begain.row*m_col]==null){
var link = isDirectLink(_begain,new M_Point(_begain.row,0));
if(link){
m_line.length = 0;
var p_1 = new M_Point(_begain.row,_col);
var p_2 = new M_Point(_end.row,_col);
setSegment(_begain,p_1,p_2,_end);
//m_line.push(new M_Segment(_begain,p_1));
//m_line.push(new M_Segment(p_1,p_2));
//m_line.push(new M_Segment(p_2,_end));
return true;
}
}
}
m_line.length = 0;
if(self.m_sprites[_begain.row*m_col]!=null||self.m_sprites[_end.row*m_col]!=null){
break;
}
var link_1 = isDirectLink(_begain,new M_Point(_begain.row,0));
var link_2 = isDirectLink(_end,new M_Point(_end.row,0));
if(link_1&&link_2){
m_line.length = 0;
var p_1 = new M_Point(_begain.row,_col);
var p_2 = new M_Point(_end.row,_col);
setSegment(_begain,p_1,p_2,_end);
//m_line.push(new M_Segment(_begain,p_1));
//m_line.push(new M_Segment(p_1,p_2));
//m_line.push(new M_Segment(p_2,_end));
return true;
}
}
else {
m_line.length = 0;
var point_1 = new M_Point(_begain.row, _col);
//cc.log(point_1.row+" "+point_1.col);
if (self.m_sprites[point_1.row * m_col + point_1.col] != null) {
break;
}
var link_1 = isOneCornerLink(point_1, _end);
var link_2 = isDirectLink(_begain, point_1);
if (link_1 && link_2) {
return true;
}
}
}
m_line.length = 0;
//向右画线
for(var _col = _begain.col+1;_col<=m_col;++_col){
if(_col==m_col){
if(m_col-1==_begain.col){
if(self.m_sprites[_end.row*m_col+_col-1]==null){
var link = isDirectLink(_end,new M_Point(_end.row,_col-1));
if(link){
m_line.length = 0;
var p_1 = new M_Point(_begain.row,_col);
var p_2 = new M_Point(_end.row,_col);
setSegment(_begain,p_1,p_2,_end);
return true;
}
}
}
m_line.length = 0;
if(m_col-1==_end.col){
if(self.m_sprites[_begain.row*m_col+_col-1]==null){
var link = isDirectLink(_begain,new M_Point(_begain.row,_col-1));
if(link){
m_line.length = 0;
var p_1 = new M_Point(_begain.row,_col);
var p_2 = new M_Point(_end.row,_col);
setSegment(_begain,p_1,p_2,_end);
return true;
}
}
}
m_line.length = 0;
if(self.m_sprites[_begain.row*m_col+_col-1]!=null||self.m_sprites[_end.row*m_col+_col-1]!=null){
break;
}
var link_1 = isDirectLink(_begain,new M_Point(_begain.row,_col-1));
var link_2 = isDirectLink(_end,new M_Point(_end.row,_col-1));
if(link_1&&link_2){
m_line.length = 0;
var p_1 = new M_Point(_begain.row,_col);
var p_2 = new M_Point(_end.row,_col);
setSegment(_begain,p_1,p_2,_end);
return true;
}
}
else {
m_line.length = 0;
var point_1 = new M_Point(_begain.row, _col);
//cc.log(point_1.row+" "+point_1.col);
if (self.m_sprites[point_1.row * m_col + point_1.col] != null) {
break;
}
var link_1 = isOneCornerLink(point_1, _end);
var link_2 = isDirectLink(_begain, point_1);
if (link_1 && link_2) {
return true;
}
}
}
m_line.length = 0;
return false;
};
最后再检查一下
function checkLink(_begin,_end){
var islink = isDirectLink(_begin,_end);
if(islink){
return islink;
}
islink = isOneCornerLink(_begin,_end);
if(islink){
return islink;
}
islink = isTwoCornerLink(_begin,_end);
if(islink){
return islink;
}
return false;
}
以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持。
免责声明：本站文章均来自网站采集或用户投稿，网站不提供任何软件下载或自行开发的软件！
如有用户或公司发现本站内容信息存在侵权行为，请邮件告知！ 858582#qq.com
暂无“JavaScript实现连连看连线算法”评论...
P70系列延期，华为新旗舰将在下月发布
3月20日消息，近期博主@数码闲聊站 透露，原定三月份发布的华为新旗舰P70系列延期发布，预计4月份上市。
而博主@定焦数码 爆料，华为的P70系列在定位上已经超过了Mate60，成为了重要的旗舰系列之一。它肩负着重返影像领域顶尖的使命。那么这次P70会带来哪些令人惊艳的创新呢？
根据目前爆料的消息来看，华为P70系列将推出三个版本，其中P70和P70 Pro采用了三角形的摄像头模组设计，而P70 Art则采用了与上一代P60 Art相似的不规则形状设计。这样的外观是否好看见仁见智，但辨识度绝对拉满。
更新动态
2025年11月06日
2025年11月06日
- 小骆驼-《草原狼2(蓝光CD)》[原抓WAV+CUE]
- 群星《欢迎来到我身边 电影原声专辑》[320K/MP3][105.02MB]
- 群星《欢迎来到我身边 电影原声专辑》[FLAC/分轨][480.9MB]
- 雷婷《梦里蓝天HQⅡ》 2023头版限量编号低速原抓[WAV+CUE][463M]
- 群星《2024好听新歌42》AI调整音效【WAV分轨】
- 王思雨-《思念陪着鸿雁飞》WAV
- 王思雨《喜马拉雅HQ》头版限量编号[WAV+CUE]
- 李健《无时无刻》[WAV+CUE][590M]
- 陈奕迅《酝酿》[WAV分轨][502M]
- 卓依婷《化蝶》2CD[WAV+CUE][1.1G]
- 群星《吉他王(黑胶CD)》[WAV+CUE]
- 齐秦《穿乐(穿越)》[WAV+CUE]
- 发烧珍品《数位CD音响测试-动向效果（九）》【WAV+CUE】
- 邝美云《邝美云精装歌集》[DSF][1.6G]
- 吕方《爱一回伤一回》[WAV+CUE][454M]