JavaScript循环实现中奖结果列渲染:每列限6条、相邻值不匹配插空的咨询
中奖结果可视化渲染实现方案
核心实现规则
- 单竖列最多排布6条记录,达到容量后自动切换新竖列排布
- 相邻两条中奖结果类型不一致时,在对应位置插入透明空白占位div
- 所有竖列高度保持对齐,无错位
现有实现的缺陷
- 未记录相邻记录的赢家类型对比逻辑,缺失空白占位的判断与插入
- Flex布局的item配置了拉伸属性,无法严格实现单竖列6条的容量约束
- 未跟踪当前列的已排布数量,无法触发超量后的自动切列逻辑
最优循环实现逻辑
- 初始化状态变量
- 定义单竖列最大容量常量
MAX_ITEMS_PER_COLUMN = 6 - 定义计数变量:当前列已排布条数
currentColumnCount = 0、上一条记录赢家类型lastWinner = null
- 定义单竖列最大容量常量
- 逐轮遍历记录做条件判断
遍历每一条中奖结果时按顺序执行判断:- 若当前列已排满6条:先补全当前列剩余的纵向占位,重置列计数与上一条记录标记,依托Flex的纵向换行特性自动进入新竖列
- 若当前记录的赢家类型与上一条不匹配:先插入空白占位div,同步更新列计数,若插入占位后列数满额则继续触发切列逻辑
- 若类型匹配且列未达容量:直接插入对应颜色的中奖item,同步更新列计数与上一条记录标记
- 遍历收尾校验
全部记录遍历完成后,对最后一列的剩余空间插入空白占位,保证所有竖列高度完全对齐
修正后的可运行代码
修正后的JavaScript逻辑
const results = [ { "winner": "red" }, { "winner": "red" }, { "winner": "red" }, { "winner": "red" }, { "winner": "red" }, { "winner": "red" }, { "winner": "red" }, { "winner": "red" }, { "winner": "red" }, { "winner": "red" }, { "winner": "blue" }, { "winner": "blue" }, { "winner": "red" }, { "winner": "red" }, { "winner": "red" }, { "winner": "blue" }, { "winner": "blue" }, { "winner": "blue" }, { "winner": "blue" }, { "winner": "blue" }, { "winner": "blue" }, { "winner": "red" }, { "winner": "blue" }, { "winner": "blue" } ]; const MAX_ITEMS_PER_COLUMN = 6; let htmlData = ''; let currentColumnCount = 0; let lastWinner = null; const htmlHistory = $('.results'); results.forEach((item) => { // 列满自动切换新竖列 if (currentColumnCount >= MAX_ITEMS_PER_COLUMN) { const fillBlankCount = MAX_ITEMS_PER_COLUMN - currentColumnCount; for (let i = 0; i < fillBlankCount; i++) { htmlData += '<div class="item blank_result"></div>'; } currentColumnCount = 0; lastWinner = null; } // 相邻结果不匹配插入空白占位 if (lastWinner !== null && item.winner !== lastWinner) { htmlData += '<div class="item blank_result"></div>'; currentColumnCount += 1; // 占位后列满则继续切新列 if (currentColumnCount >= MAX_ITEMS_PER_COLUMN) { const fillBlankCount = MAX_ITEMS_PER_COLUMN - currentColumnCount; for (let i = 0; i < fillBlankCount; i++) { htmlData += '<div class="item blank_result"></div>'; } currentColumnCount = 0; lastWinner = null; } } // 插入正常中奖结果块 htmlData += `<div class="item ${item.winner}"></div>`; currentColumnCount += 1; lastWinner = item.winner; }); // 收尾补全最后一列的占位 const finalFillCount = MAX_ITEMS_PER_COLUMN - currentColumnCount; for (let i = 0; i < finalFillCount; i++) { htmlData += '<div class="item blank_result"></div>'; } htmlHistory.html(htmlData);
同步修正的CSS配置
.results { display: flex; flex-direction: column; flex-wrap: wrap; align-content: flex-start; /* 固定容器高度为单块高度*6,触发纵向换行到新列 */ height: calc(32px * 6); overflow-x: scroll; overflow-y: hidden; background-size: 34px 34px; background-image: linear-gradient(to right, lightgrey 1px, transparent 1px), linear-gradient(to bottom, lightgrey 1px, transparent 1px); background-repeat: repeat; background-attachment: local; background-color: white; } .results .item { width: 30px; height: 30px; margin: 1px; border-style: solid; border-width: 8px; border-radius: 15px; box-shadow: 1px 2px 2px #888888; /* 关闭flex拉伸,保证每个块尺寸固定 */ flex-shrink: 0; } .item.red { border-color: #B31013; } .item.blue { border-color: blue; } .blank_result { border-color: transparent; box-shadow: none; }
内容的提问来源于stack exchange,提问作者Larvenrez Bbp
相关产品推荐
相关产品推荐

