zoukankan      html  css  js  c++  java
  • PHP二维数组的分页【转】

    方法一:

    <?php
    $arr_click = array(
        array( 'clicks' => 3, 'clickDate' =>'2010-10-11' ),
        array( 'clicks' => 2, 'clickDate' =>'2010-10-11' ),
        array( 'clicks' => 3, 'clickDate' =>'2010-10-09' ),
        array( 'clicks' => 1, 'clickDate' =>'2010-10-08' ),
    );
    $page = 2;
    $indexinpage=2;
    $newarr = array_slice($arr_click, ($page-1)*$indexinpage, $indexinpage);
    ?>
    

    原理如下:
    和分页原理一样
    数组用 array_slice(array,offset,length) 函数在数组中根据条件取出一段值。
    array:需要处理的数组
    offset:取出元素的开始位置
    length:返回数组的长度
    在每页中改变 offset 的值就行了!
    方法二:
    例如:

    <?php
    $arr_click = array(
        array( 'clicks' => 3, 'clickDate' =>'2010-10-11' ),
        array( 'clicks' => 2, 'clickDate' =>'2010-10-11' ),
        array( 'clicks' => 3, 'clickDate' =>'2010-10-09' ),
        array( 'clicks' => 1, 'clickDate' =>'2010-10-08' ),
    );
    $size = 3;
    $pnum = ceil(count($arr_click) / $size);
    if(isset($_GET['page'])){
        $page = intval($_GET['page']);
        $page = $page > $pnum? $pnum: $page;
        $page = $page < $pnum? 1: $page;
    }else{
        $page = 1;
    }
    for($i = 0; $i < $size; $i++){
        if(!isset($arr_click[($page - 1) * $size + $i]))break;
        echo '<pre>';
        print_r($arr_click[($page - 1) * $size + $i]);
        echo '<br>';
    }
    ?>
    <a href="ad.php?page=<?php echo $page - 1 > 0? $page - 1: 1; ?>">上一页</a>
    <a href="ad.php?page=<?php echo $page + 1 < $pnum? $page + 1: $pnum; ?>">下一页</a>
    

    来源:https://www.oschina.net/code/snippet_221301_8700

  • 相关阅读:
    Expanding Rods(二分)
    Monthly Expense(二分)
    sdut1269 走迷宫(dfs)
    走迷宫(dfs)
    C Looooops(扩展欧几里得+模线性方程)
    41. First Missing Positive
    40. Combination Sum II
    39. Combination Sum
    37. Sudoku Solver
    36. Valid Sudoku
  • 原文地址:https://www.cnblogs.com/KillBugMe/p/13254961.html
Copyright © 2011-2022 走看看