贪吃蛇html源代码百度经验,听说爆代码可以加经验，特此爆一下上午写的贪吃蛇算法核心...

该楼层疑似违规已被系统折叠 隐藏此楼查看此楼

{

m_iNextDir = m_iHorzNum;

}

break;

case KEY_DEF_LEFT:

{

m_iNextDir = -1;

}

break;

case KEY_DEF_RIGHT:

{

m_iNextDir = 1;

}

break;

} return TRUE;

} // 获取食物数据

const __int32 CSnake::GetFoodData(void)

{

return m_iFood;

}

// 获取蛇数据

BOOL CSnake::GetSnakeData(IN OUT __int32 **lpSnake, IN OUT __int32 & iSnakeLen)

{

if (NULL == lpSnake)

{

return FALSE;

} *lpSnake = m_lpiSnake;

iSnakeLen = m_iSnakeLen;

return TRUE;

} // 规则判断

BOOL CSnake::RulesJuge(void)

{

__int32 iHead = INVALIDATE_VAL;

__int32 iNextIndex = INVALIDATE_VAL;

if (m_iBufSize <= 0\

|| m_iHorzNum <=0)

{

return FALSE;

} // 判断是否越过边界

iHead = GetHead();

iNextIndex = iHead + m_iNextDir;

if (iNextIndex < 0\

|| iNextIndex > m_iBufSize)

{

// 越上下界

return FALSE;

} if (iNextIndex / m_iHorzNum != iHead / m_iHorzNum)

{

// 越左右届

return FALSE;

} // 判断是否自撞

if (m_iFood != iNextIndex \

&& m_lpbUsed[m_iNextDir])

{

// 自撞

return FALSE;

} // 判断是否吃到食物

if (m_iFood == iNextIndex)

{

// 吃到食物

if (!AppendHead(iNextIndex))

{

return FALSE;

}

// 创建下一个食物

if (!CreateNextFood())

{

return FALSE;

}

}

else

{

RemoveTail();

AppendHead(iNextIndex);

} return TRUE;

} // 获取蛇头

__int32 CSnake::GetHead()

{

if (m_iSnakeLen <= 0\

|| NULL == m_lpiSnake)

{

return INVALIDATE_VAL;

} return m_lpiSnake[0];

}

// 移除蛇尾

void CSnake::RemoveTail()

{

__int32 iIndex = INVALIDATE_VAL;

if (m_iSnakeLen <= 0\

|| NULL == m_lpiSnake)

{

return ;

} iIndex = m_lpiSnake[m_iSnakeLen - 1];

if (iIndex != INVALIDATE_VAL)

{

m_lpbUsed[iIndex] = FALSE;

}

m_lpiSnake[m_iSnakeLen - 1] = INVALIDATE_VAL;

m_iSnakeLen -- ;

}

// 添加蛇头

BOOL CSnake::AppendHead(IN __int32 iHead)

{

if (iHead < 0 || iHead >= m_iBufSize)

{

return FALSE;

} memcpy(&m_lpiSnake[1], &m_lpiSnake[0], sizeof(__int32) * (m_iSnakeLen - 1)); m_lpiSnake[0] = iHead;

m_lpbUsed[iHead] = TRUE;

m_iSnakeLen++;

return TRUE;

} // 申请空间

BOOL CSnake::AllocBuf(IN __int32 iHorzNum, IN __int32 iVertNum)

{

if (iHorzNum <= 0 || iVertNum <= 0)

{

return FALSE;

} try

{

m_lpbUsed = new BOOL[iHorzNum * iVertNum];

m_lpiSnake = new __int32[iHorzNum * iVertNum];

m_lpiFood = new __int32[iHorzNum * iVertNum];

m_iBufSize = iHorzNum * iVertNum;

m_iHorzNum = iHorzNum;

m_iVertNum = iVertNum; memset(m_lpiSnake, INVALIDATE_VAL, sizeof(__int32) * m_iBufSize);

memset(m_lpiFood, INVALIDATE_VAL, sizeof(__int32) * m_iBufSize);

memset(m_lpbUsed, FALSE, sizeof(FALSE) * m_iBufSize);

}

catch(...)

{

ASSERT(FALSE);

return FALSE;

}

return TRUE;

} // 生成下一个食物位置

BOOL CSnake::CreateNextFood(void)

{

__int32 i = 0;

__int32 iFoodLstLen = 0;

__int32 iIndex = 0;

__int32 iFoodIndex = 0;

if (NULL == m_lpiFood\

|| NULL == m_lpbUsed\

|| m_iBufSize <=0\

|| (m_iBufSize - m_iSnakeLen) <= 0)

{

return FALSE;

} // 根据使用表初始化食物表

for (i = 0;i < m_iBufSize;i++)

{

if (!m_lpbUsed[i])

{

m_lpiFood[iFoodLstLen] = i;

iFoodLstLen++;

}

} iIndex = rand() % (iFoodLstLen);

iFoodIndex = m_lpiFood[iIndex];

if ( INVALIDATE_VAL == iFoodIndex)

{

return FALSE;

}

m_iFood = iFoodIndex;

m_lpbUsed[iFoodIndex] = TRUE; return TRUE;

} // 释放空间

void CSnake::ReleaseBuf(void)

{

if (m_lpbUsed != NULL)

{

delete[] m_lpbUsed;

} if (m_lpiFood != NULL)

{

delete[] m_lpiFood;

} if (m_lpiSnake != NULL)

{

delete[] m_lpiSnake;

}

m_lpbUsed = NULL;

m_lpiSnake = NULL;

m_iBufSize = 0;

m_iFood = INVALIDATE_VAL;

m_iHorzNum = 0;

m_iVertNum = 0;

m_iSnakeLen = 0;

m_iNextDir = 0;

}