$lastAdminId = 2590;
$yo = $lastAdminId / 1000;
$yo = intval($yo);
$yushu = $lastAdminId % 1000;
if ($yo == 0) {
$result[0]['start'] = 1;
$result[0]['end'] = $yushu;
} else {
$tail[0]['start'] = $yo * 1000 +1;
$tail[0]['end'] = $yo * 1000 + $yushu;
$new = [];
for ($i= 0; $i< $yo; $i++) {
$new[$i]['start'] = $i * 1000 +1;
$new[$i]['end'] = ($i + 1) * 1000;
}
$result = array_merge($new,$tail);
}
/**
* [
{
"start": 1,
"end": 1000
},
{
"start": 1001,
"end": 2000
},
{
"start": 2001,
"end": 2590
}
]
*/
return json($result);
分段处理算法
最新推荐文章于 2021-10-15 08:47:32 发布